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
Waht does O (n2) indicate.
Question # 2
Which is an NP complete problem.
Question # 3
The Halting Problem is an example of.
Question # 4
NP hard problems are
Question # 5
How do BFS and DFS differ.
Question # 6
Whcih is a sorting algorithms.
Question # 7
Which is solved by dynamic programming.
Question # 8
Which of the following correctly describes a solvable problem.
Question # 9
Which is solved by Dynamic Programming.
Question # 10
A seenario where Dynaimic progrmming proves most useful
Question # 11
Which problem gives yes /no answer.
Question # 12
What is the purpose of search algorithms
Question # 13
How does Backtracking work.
Question # 14
Which is an example of O (log n) comlexity.
Question # 15
Which technique is used in Merge sort.
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 |
What is the primary goal of algorithm design techniques. |
A.
Imporve hardware
B.
Sovle problems systematically
C.
Reduce input size
D.
Debug software |
| 2 |
How does Divide and conquere work. |
A.
Make local chices
B.
Break ,solve, combine
C.
Store subproblem results
D.
Try alloptions, backtrack |
| 3 |
What is the main advantage of Dynamic Programming. |
A.
Avoid redundant work
B.
Locally optmal results
C.
Sole independent problems
D.
Explore all options |
| 4 |
Problems in NP and NP-hard are called. |
A.
P
B.
BPP
C.
NP Complete
D.
Tractable |
| 5 |
Seach algorithm more efficinet for large datasets. |
A.
Bubble sort
B.
Merge sort
C.
Quick Sort
D.
Selection sort |
| 6 |
NP- complete matters because. |
A.
Solved faster than P
B.
Solving one solves all NP
C.
aLWAYS TRACTABLE
D.
nO REAL USE |
| 7 |
Which is solved by Dynaimc programming. |
A.
Coin Change
B.
Fibonacci sequence
C.
Merge sort
D.
Puzzle solving |
| 8 |
Which problem gives yes /no answer. |
A.
Search
B.
Decision
C.
Optimization
D.
Counting |
| 9 |
Problems in class P are solved in. |
A.
Exponentilal time
B.
Polynomial time
C.
Non determinaistic time
D.
Ifinite time |
| 10 |
Easy to verify but hard to solve problem are in. |
A.
NP
B.
P
C.
NP hard
D.
Undecidable |
Test Questions