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
How does Linear search work
Question # 2
Which is an NP complete problem.
Question # 3
Complexity class representing problesm solvable efficinetly by a deterministic alogrithm .
Question # 4
Which is solved by Dynaimc programming.
Question # 5
How does Divide and conquere work.
Question # 6
Which alorithm finds node relationships in a graph.
Question # 7
What is outpout when checking if 8 is even.
Question # 8
The Halting Problem is an example of.
Question # 9
What is the main advantage of Dynamic Programming.
Question # 10
Which of the following correctly describes a solvable problem.
Question # 11
If P= NP ,this means
Question # 12
How does Backtracking work.
Question # 13
NP Problems can be
Question # 14
For which problems is Backtracing suitable.
Question # 15
How do BFS and DFS differ.
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 -
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 Shumaila Riaz 13 - Dec - 2024 02 Min 57 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 |
What is the primary goal of algorithm design techniques. |
A.
Imporve hardware
B.
Sovle problems systematically
C.
Reduce input size
D.
Debug software |
| 2 |
Which is solved by dynamic programming. |
A.
Coin change
B.
Fibonacci sequence
C.
Merge sort
D.
Puzzle solving |
| 3 |
How does Divide and conqurr work |
A.
Make local choices
B.
Break, sole, combine
C.
Store subproblem results
D.
Try all options, backtrack |
| 4 |
Which is solved by Dynaimc programming. |
A.
Coin Change
B.
Fibonacci sequence
C.
Merge sort
D.
Puzzle solving |
| 5 |
Which problem gives yes /no answer. |
A.
Search
B.
Decision
C.
Optimization
D.
Counting |
| 6 |
Easy to verify but hard to solve problem are in. |
A.
NP
B.
P
C.
NP hard
D.
Undecidable |
| 7 |
Problems in NP and NP-hard are called. |
A.
P
B.
BPP
C.
NP Complete
D.
Tractable |
| 8 |
What is role of algorithm in problem solving. |
A.
Gives steps
B.
Ignores logic
C.
Random process
D.
Blocks solutions |
| 9 |
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 |
| 10 |
NP Problems can be |
A.
Solved in polynomial time
B.
Verified in polynomial time
C.
Solved in exponeitial timeonly
D.
Not verified |
Test Questions