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
The halting problem is.
Question # 2
P vs NP asks if
Question # 3
NP- complete matters because.
Question # 4
Tractable prolem canbe solved
Question # 5
How does Divide and conquere work.
Question # 6
A seenario where Dynaimic progrmming proves most useful
Question # 7
What is the main advantage of Dynamic Programming.
Question # 8
What does “input” mean in a computational problem.
Question # 9
What does page rank algorithm analyze.
Question # 10
Problems in NP and NP-hard are called.
Question # 11
Which is solved by Dynaimc programming.
Question # 12
Which of the following correctly describes a solvable problem.
Question # 13
Which problem gives yes /no answer.
Question # 14
If P= NP ,this means
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 |
For which problems is Backtracking suitable |
A.
Optimal substrcuture
B.
Explore all combnations
C.
ONe optimal choice
D.
No overlapping problems |
| 2 |
What is the main advantages of dynamic programming. |
A.
Avoid redundant work
B.
Locally optimal results
C.
Solves independent problems
D.
Explore alloptions |
| 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 |
The halting problem is. |
A.
Solvable and tractable
B.
Unsolable and in P
C.
Unsolvable and not in NP
D.
NP Complete |
| 5 |
What does time complexity measrue. |
A.
Memory use
B.
Time growth with input
C.
Number of loops
D.
Output accuracy |
| 6 |
Why use real life tasks in algorithm learning. |
A.
Show steps in life
B.
Make it harder
C.
Reduce interest
D.
Add confusion |
| 7 |
Which is solved by Dynamic Programming. |
A.
Coin Change
B.
Fibonacci sequence
C.
Merge sort
D.
Puzzle solving |
| 8 |
How does selection sort work. |
A.
Swap adjacent
B.
Select minium form unsorted part
C.
Use quenue for nodes
D.
Store intermediate results |
| 9 |
Waht does O (n2) indicate. |
A.
Linear growth
B.
Constant time
C.
Square of input
D.
Logarithmic growth |
| 10 |
What does “input” mean in a computational problem. |
A.
Result after processing
B.
Steps to solve
C.
Data at start
D.
Type of problem |
Test Questions