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 bubble sort work
Question # 2
Which problem gives yes /no answer.
Question # 3
How does Linear search work
Question # 4
P vs NP asks if
Question # 5
Tractable prolem canbe solved
Question # 6
Which is an example of O (log n) comlexity.
Question # 7
Easy to verify but hard to solve problem are in.
Question # 8
When is Generate and Test best.
Question # 9
Which is a Greedy Algorithm example
Question # 10
What is the purpose of search algorithms
Question # 11
How does Backtracking work.
Question # 12
Knowing if a problem is solvable hellps.
Question # 13
The characteristic of a well defined problem is.
Question # 14
Complexity class representing problesm solvable efficinetly by a deterministic alogrithm .
Question # 15
What does “input” mean in a computational problem.
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 -
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 -
A Annas Amir 09 - Jan - 2025 01 Min 40 Sec 11/15
| Sr.# | Question | Answer |
|---|---|---|
| 1 |
Whcih is an III-defined problem. |
A.
Check even number
B.
Find shortest path
C.
Reduce poverty
D.
Count book arrangements |
| 2 |
Which is solved by Dynamic Programming. |
A.
Coin Change
B.
Fibonacci sequence
C.
Merge sort
D.
Puzzle solving |
| 3 |
How does Divide and conquere work. |
A.
Make local chices
B.
Break ,solve, combine
C.
Store subproblem results
D.
Try alloptions, backtrack |
| 4 |
Which is solved by dynamic programming. |
A.
Coin change
B.
Fibonacci sequence
C.
Merge sort
D.
Puzzle solving |
| 5 |
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 |
| 6 |
Why are commonly used algorithms important. |
A.
Reduce hrdware cost
B.
Solve common problems efficiently
C.
Remove need for data structures
D.
for theory only |
| 7 |
When is Generate and Test best. |
A.
small prblem space
B.
Large problem space
C.
No testing needed
D.
No solutions exist |
| 8 |
Which alorithm finds node relationships in a graph. |
A.
Bubble sort
B.
Linear Search
C.
BFS
D.
Selection sort |
| 9 |
Problems in class P are solved in. |
A.
Exponentilal time
B.
Polynomial time
C.
Non determinaistic time
D.
Ifinite time |
| 10 |
An algorithm that sort data by stepping thourgh the list and swapping adjacent elements if needed is. |
A.
Selection sort
B.
Quick sort
C.
Bubble sort
D.
Merge sort |
Test Questions
