.jpg)
Home
News
Colleges
Courses
Admission
Lectures
Online Test
Past Papers
Date Sheets
Results
Study Abroad
Jobs
Tutors
More
Apps
.gif)
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
Which problem gives yes /no answer.
Question # 2
How does Divide and conqurr work
Question # 3
Which is solved by dynamic programming.
Question # 4
Which is solved by Dynamic Programming.
Question # 5
Which diagram shows P, NO, NP-hard,NP Complete
Question # 6
When is Generate and Test best.
Question # 7
The Halting Problem is an example of.
Question # 8
What does page rank algorithm analyze.
Question # 9
What is computational problem.
Question # 10
Tractable prolem canbe solved
Question # 11
Sovable problems differ becasue they.
Question # 12
What do sorting algorithm mainly do.
Question # 13
How does Divide and conquere work.
Question # 14
Problems in NP and NP-hard are called.
Question # 15
NP hard problems are
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 |
How does bubble sort work |
A.
Select smallest and swap
B.
Swap adjacent if wrong
C.
Divide and merge
D.
Explore nodes level wise |
| 2 |
What is outpout when checking if 8 is even. |
A.
Found at 2
B.
Even
C.
Odd
D.
Yes |
| 3 |
Which is solved by Dynaimc programming. |
A.
Coin Change
B.
Fibonacci sequence
C.
Merge sort
D.
Puzzle solving |
| 4 |
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 |
| 5 |
What does space complexity measure. |
A.
Execution time
B.
Memory usage
C.
Number of steps
D.
Result accuracy |
| 6 |
The Halting Problem is an example of. |
A.
Solvable problem
B.
Tractable prolem
C.
Unsolvable problem
D.
NP Complete problem |
| 7 |
Which diagram shows P, NO, NP-hard,NP Complete |
A.
Bar chart
B.
Pie chart
C.
Venn diagram
D.
Lne graph |
| 8 |
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 |
| 9 |
Which of the following correctly describes a solvable problem. |
A.
Cannot be solved
B.
Takes infinite time
C.
Soved by algorithm in finite time
D.
Has no input/output |
| 10 |
Knowing if a problem is solvable hellps. |
A.
Increase complexity
B.
Save time
C.
Generate random output
D.
Avoid design |
Test Questions