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
For which problems is Backtrackign suitable.
Question # 2
What is the main advantage of Dynamic Programming.
Question # 3
The halting problem is.
Question # 4
Problems in NP and NP-hard are called.
Question # 5
A seenario where Dynaimic progrmming proves most useful
Question # 6
The meanig of NP in computational complexity is.
Question # 7
What is generate and Test algorithm
Question # 8
Tractable prolem canbe solved
Question # 9
What is outpout when checking if 8 is even.
Question # 10
Which diagram shows P, NO, NP-hard,NP Complete
Question # 11
How does Linear search work
Question # 12
What is the primary goal of algorithm design techniques.
Question # 13
For which problems is Backtracking suitable
Question # 14
Why are commonly used algorithms important.
Question # 15
Why use real life tasks in algorithm learning.
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 computational problem. |
A.
solved using algorithm
B.
Solved using creativity
C.
Has unclear input
D.
Has no process |
| 2 |
What is the main advantage of Dynamic Programming. |
A.
Avoid redundant work
B.
Locally optmal results
C.
Sole independent problems
D.
Explore all options |
| 3 |
What is a key limitatio of Greedy Algorithms. |
A.
Too complex
B.
Always optimal
C.
Not always optimal
D.
High memory use |
| 4 |
NP Problems can be |
A.
Solved in polynomial time
B.
Verified in polynomial time
C.
Solved in exponeitial timeonly
D.
Not verified |
| 5 |
Knowing if a problem is solvable hellps. |
A.
Increase complexity
B.
Save time
C.
Generate random output
D.
Avoid design |
| 6 |
Why are commonly used algorithms important. |
A.
Reduce hardware cost
B.
Solve common Problems efficiently
C.
Remvoe need for data structure
D.
For theory only |
| 7 |
Which is solved by dynamic programming. |
A.
Coin change
B.
Fibonacci sequence
C.
Merge sort
D.
Puzzle solving |
| 8 |
How does Divide and conquere work. |
A.
Make local chices
B.
Break ,solve, combine
C.
Store subproblem results
D.
Try alloptions, backtrack |
| 9 |
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 |
| 10 |
Which is a Greedy Algorithm example |
A.
Fibonacci sequence
B.
Coin change
C.
Merge sort
D.
Puzzle solving |
Test Questions