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
Complexity class representing problesm solvable efficinetly by a deterministic alogrithm .
Question # 2
How does Divide and conquere work.
Question # 3
Which is solved by Dynaimc programming.
Question # 4
For which problems is Backtracking suitable
Question # 5
Which technique is used in Merge sort.
Question # 6
The Halting Problem is an example of.
Question # 7
What defines a Greedy algorithm
Question # 8
For which problems is Backtracing suitable.
Question # 9
How does selection sort work.
Question # 10
Which of the following correctly describes a solvable problem.
Question # 11
The statement ghat applies to unsolvable problem
Question # 12
The characteristic of a well defined problem is.
Question # 13
Why use real life tasks in algorithm learning.
Question # 14
NP hard problems are
Question # 15
How does bubble sort work
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 |
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 |
| 2 |
Which diagram shows P, NO, NP-hard,NP Complete |
A.
Bar chart
B.
Pie chart
C.
Venn diagram
D.
Lne graph |
| 3 |
Complexity class representing problesm solvable efficinetly by a deterministic alogrithm . |
A.
P
B.
NP-Hard
C.
NP
D.
NP -Complete |
| 4 |
What is computational problem. |
A.
solved using algorithm
B.
Solved using creativity
C.
Has unclear input
D.
Has no process |
| 5 |
How does Divide and conqurr work |
A.
Make local choices
B.
Break, sole, combine
C.
Store subproblem results
D.
Try all options, backtrack |
| 6 |
For which problems is Backtracking suitable |
A.
Optimal substrcuture
B.
Explore all combnations
C.
ONe optimal choice
D.
No overlapping problems |
| 7 |
What is outpout when checking if 8 is even. |
A.
Found at 2
B.
Even
C.
Odd
D.
Yes |
| 8 |
What is the main advantages of dynamic programming. |
A.
Avoid redundant work
B.
Locally optimal results
C.
Solves independent problems
D.
Explore alloptions |
| 9 |
Which is solved by Dynaimc programming. |
A.
Coin Change
B.
Fibonacci sequence
C.
Merge sort
D.
Puzzle solving |
| 10 |
What is limitation Greedy algorithms |
A.
Too complex
B.
Always optimal
C.
Not always optimal
D.
High memory use |
Test Questions