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
Problems in class P are solved in.
Question # 2
Which is solved by Dynamic Programming.
Question # 3
What does “input” mean in a computational problem.
Question # 4
Knowing if a problem is solvable hellps.
Question # 5
Which diagram shows P, NO, NP-hard,NP Complete
Question # 6
A seenario where Dynaimic progrmming proves most useful
Question # 7
When is Generate and Test best.
Question # 8
P vs NP asks if
Question # 9
What is the main advantages of dynamic programming.
Question # 10
Why use real life tasks in algorithm learning.
Question # 11
NP hard problems are
Question # 12
Why is bubble sort not for large datasets.
Question # 13
NP Problems can be
Question # 14
How does bubble sort work
Question # 15
How does Linear Search work.
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 |
When is Generate and Test best. |
A.
small prblem space
B.
Large problem space
C.
No testing needed
D.
No solutions exist |
| 2 |
An algorithm that sort data by stepping thourgh the list and swapping adjacent elements if needed is. |
A.
Selection sort
B.
Quick sort
C.
Bubble sort
D.
Merge sort |
| 3 |
For which problems is Backtracing suitable. |
A.
Optimal substrcuture
B.
Explore all combinations
C.
ON optimal choice
D.
No overlapping problems |
| 4 |
What is the main advantages of dynamic programming. |
A.
Avoid redundant work
B.
Locally optimal results
C.
Solves independent problems
D.
Explore alloptions |
| 5 |
How does Linear search work |
A.
Halve search interval
B.
Check each item one by one
C.
Explore branch deeply
D.
Use queue for nodes |
| 6 |
How does Linear Search work. |
A.
Halve search interval
B.
Check each item one by oe
C.
Explore branch deeply
D.
Use queue for nodes |
| 7 |
The halting problem is. |
A.
Solvable and tractable
B.
Unsolable and in P
C.
Unsolvable and not in NP
D.
NP Complete |
| 8 |
Tractability depends on |
A.
Inputs
B.
Complexity
C.
Outputs
D.
Algorthm type |
| 9 |
What is limitation Greedy algorithms |
A.
Too complex
B.
Always optimal
C.
Not always optimal
D.
High memory use |
| 10 |
Whcih is a sorting algorithms. |
A.
Linear search
B.
Qucik sort
C.
DFS
D.
BFS |
Test Questions