Home
News
Colleges
Courses
Admission
Lectures
Online Test
Past Papers
Date Sheets
Results
Study Abroad
Jobs
Tutors
More
Apps
.jpg)
MCQ's Test For Chapter 3 "Computer Science Ics Part 1 Chapter 3 Online Test"
Try The MCQ's Test For Chapter 3 "Computer Science Ics Part 1 Chapter 3 Online Test"
-
Total Questions15
-
Time Allowed20
Computer Science Ics Part 1 Chapter 3 Online Test
00:00
Question # 1
Sovable problems differ becasue they.
Question # 2
Why use real life tasks in algorithm learning.
Question # 3
Which of the following correctly describes a solvable problem.
Question # 4
Which technique is used in Merge sort.
Question # 5
What does time complexity measrue.
Question # 6
How does selection sort work.
Question # 7
What does “input” mean in a computational problem.
Question # 8
What is the main advantage of Dynamic Programming.
Question # 9
If P= NP ,this means
Question # 10
Knowing if a problem is solvable hellps.
Question # 11
How does Linear search work
Question # 12
Problems in NP and NP-hard are called.
Question # 13
Whcih is a sorting algorithms.
Question # 14
For which problems is Backtracking suitable
Question # 15
Which alorithm finds node relationships in a graph.
11th Class ICS Computer Science Chapter 3 MCQ's Test
Top Scorers Of Chapter 3 "Computer Science Ics Part 1 Chapter 3 Online Test" MCQ`s Test
-
S sallu khan 06 - Jan - 2025 00 Min 37 Sec 15/15 -
U Uzma Adnan 10 - Jan - 2025 00 Min 50 Sec 15/15 -
T Toqeer Ahmad 16 - May - 2026 01 Min 10 Sec 14/15 -
F fatima amjad 26 - Jan - 2026 01 Min 53 Sec 14/15 -
M Muhib Siddiqui 23 - Dec - 2024 03 Min 10 Sec 14/15 -
R Rana Muhammad anfal 16 - Jan - 2025 01 Min 23 Sec 13/15 -
A Anas Rehman 02 - Jan - 2025 01 Min 31 Sec 13/15 -
F Faisal Maqbool 26 - Dec - 2024 02 Min 12 Sec 13/15 -
I Iqra Amjad 20 - Dec - 2024 02 Min 22 Sec 13/15 -
H Hassan Raza 24 - Dec - 2024 02 Min 01 Sec 12/15 -
N Noor Mughal Noor Mughal 19 - Jan - 2025 02 Min 08 Sec 12/15 -
A Adrien Oliver 16 - Dec - 2024 02 Min 10 Sec 12/15 -
S Saim Yousaf 20 - Dec - 2024 02 Min 17 Sec 12/15 -
S Saim G 31 - Jul - 2025 02 Min 39 Sec 12/15 -
S Shah az Ali 22 - Dec - 2024 04 Min 42 Sec 12/15
ICS Part 1 Computer Science (New Book) Chapter 3 Important MCQ's
| Sr.# | Question | Answer |
|---|---|---|
| 1 |
How do BFS and DFS differ. |
A.
BFS Stack, DFS -queue
B.
BFS -level , DFS -depth
C.
BFS Sort, DFS-Search
D.
BFS always slower |
| 2 |
What does page rank algorithm analyze. |
A.
Page links
B.
page color
C.
Page size
D.
Page font |
| 3 |
Problems in NP and NP-hard are called. |
A.
P
B.
BPP
C.
NP Complete
D.
Tractable |
| 4 |
What is limitation Greedy algorithms |
A.
Too complex
B.
Always optimal
C.
Not always optimal
D.
High memory use |
| 5 |
How does Divide and conquere work. |
A.
Make local chices
B.
Break ,solve, combine
C.
Store subproblem results
D.
Try alloptions, backtrack |
| 6 |
What is the main advantage of Dynamic programming. |
A.
Avoid redundant work
B.
Locally optimal results
C.
Solve independent problems
D.
Explore alloptions |
| 7 |
NP hard problems are |
A.
Easy to solve
B.
Alway solvable
C.
As hard as NP problem
D.
In class P |
| 8 |
Which is an example of O (log n) comlexity. |
A.
Sorting numbers
B.
Pair comparison
C.
Binary search
D.
Linear search |
| 9 |
Easy to verify but hard to solve problem are in. |
A.
NP
B.
P
C.
NP hard
D.
Undecidable |
| 10 |
What is computational problem. |
A.
solved using algorithm
B.
Solved using creativity
C.
Has unclear input
D.
Has no process |
Test Questions
Share your comments & questions here
Haseeb Sajid
29 Mar 2024very helpful app for mcq s preparation please also give short question here of all subjects as a test base
Guest User
17 Oct 2019Shehzad khan
Muhammad Awais
17 Apr 2019GIVE SOME IMPORTANT QUESTION ABOUT TODAY PAPER
sohaib
21 Nov 2017Very helpful
babar ali
23 May 2017Can anyone beat me