Home
News
Colleges
Courses
Admission
Lectures
Online Test
Past Papers
Date Sheets
Results
Study Abroad
Jobs
Tutors
More
Apps
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
How does Linear search work
Question # 2
Why is tractability important.
Question # 3
What is limitation Greedy algorithms
Question # 4
The halting problem is.
Question # 5
What is outpout when checking if 8 is even.
Question # 6
How do BFS and DFS differ.
Question # 7
Which diagram shows P, NO, NP-hard,NP Complete
Question # 8
P vs NP asks if
Question # 9
Which is solved by dynamic programming.
Question # 10
NP- complete matters because.
Question # 11
Easy to verify but hard to solve problem are in.
Question # 12
NP hard problems are
Question # 13
Whcih is an III-defined problem.
Question # 14
How does selection sort work.
Question # 15
Tractable prolem canbe solved
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 Sibtain Iqbal 08 - Sep - 2026 02 Min 43 Sec 12/15
ICS Part 1 Computer Science (New Book) Chapter 3 Important MCQ's
| Sr.# | Question | Answer |
|---|---|---|
| 1 |
Which diagram shows P, NO, NP-hard,NP Complete |
A.
Bar chart
B.
Pie chart
C.
Venn diagram
D.
Lne graph |
| 2 |
Why is bubble sort not for large datasets. |
A.
Needs more memory
B.
O (n2) time complexity
C.
Works on sorted data only
D.
Can't handle numbers |
| 3 |
What is limitation Greedy algorithms |
A.
Too complex
B.
Always optimal
C.
Not always optimal
D.
High memory use |
| 4 |
Tractability depends on |
A.
Inputs
B.
Complexity
C.
Outputs
D.
Algorthm type |
| 5 |
The statement ghat applies to unsolvable problem |
A.
They can be solved in polynomial time
B.
They cannot be solved by any alogorithm
C.
They are always in NP class
D.
They require exponetial time to solve |
| 6 |
Which is solved by dynamic programming. |
A.
Coin change
B.
Fibonacci sequence
C.
Merge sort
D.
Puzzle solving |
| 7 |
Sovable problems differ becasue they. |
A.
Take exponential time
B.
Need better hardware
C.
Halt with a result
D.
Have no input |
| 8 |
Whcih is an III-defined problem. |
A.
Check even number
B.
Find shortest path
C.
Reduce poverty
D.
Count book arrangements |
| 9 |
Why use real life tasks in algorithm learning. |
A.
Show steps in life
B.
Make it harder
C.
Reduce interest
D.
Add confusion |
| 10 |
How does Backtracking work. |
A.
Break into parts
B.
Build and Backtrack
C.
Store subproblems
D.
Make local choices |
Test Questions