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
How does Linear search work
Question # 2
What is the purpose of search algorithms
Question # 3
What is role of algorithm in problem solving.
Question # 4
What does “input” mean in a computational problem.
Question # 5
How do BFS and DFS differ.
Question # 6
An algorithm that sort data by stepping thourgh the list and swapping adjacent elements if needed is.
Question # 7
Problems in class P are solved in.
Question # 8
When is Generate and Test best.
Question # 9
The meanig of NP in computational complexity is.
Question # 10
What defines a Greedy algorithm
Question # 11
Which is an example of O (log n) comlexity.
Question # 12
What is the primary goal of algorithm design techniques.
Question # 13
Why use real life tasks in algorithm learning.
Question # 14
A seenario where Dynaimic progrmming proves most useful
Question # 15
Knowing if a problem is solvable hellps.
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 |
Which is solved by Dynamic Programming. |
A.
Coin Change
B.
Fibonacci sequence
C.
Merge sort
D.
Puzzle solving |
| 2 |
The halting problem is. |
A.
Solvable and tractable
B.
Unsolable and in P
C.
Unsolvable and not in NP
D.
NP Complete |
| 3 |
How does Divide and conquere work. |
A.
Make local chices
B.
Break ,solve, combine
C.
Store subproblem results
D.
Try alloptions, backtrack |
| 4 |
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 |
| 5 |
What does time complexity measrue. |
A.
Memory use
B.
Time growth with input
C.
Number of loops
D.
Output accuracy |
| 6 |
What does “input” mean in a computational problem. |
A.
Result after processing
B.
Steps to solve
C.
Data at start
D.
Type of problem |
| 7 |
How does Divide and conqurr work |
A.
Make local choices
B.
Break, sole, combine
C.
Store subproblem results
D.
Try all options, backtrack |
| 8 |
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 |
| 9 |
Knowing if a problem is solvable hellps. |
A.
Increase complexity
B.
Save time
C.
Generate random output
D.
Avoid design |
| 10 |
A seenario where Dynaimic progrmming proves most useful |
A.
Problem withou overlapping sub problems
B.
Problems solved by making local choices
C.
Problems with overlapping sub problems and optimal sbstructure
D.
Problem divided into independent sub problems |
Test Questions