.jpg)
Home
News
Colleges
Courses
Admission
Lectures
Online Test
Past Papers
Date Sheets
Results
Study Abroad
Jobs
Tutors
More
Apps
.gif)
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 Backtracking work.
Question # 2
Sovable problems differ becasue they.
Question # 3
Which is a Greedy Algorithm example
Question # 4
Which is an NP complete problem.
Question # 5
What is the primary goal of algorithm design techniques.
Question # 6
P vs NP asks if
Question # 7
Why is tractability important.
Question # 8
Which technique is used in Merge sort.
Question # 9
How does Divide and conquere work.
Question # 10
Why use real life tasks in algorithm learning.
Question # 11
The Halting Problem is an example of.
Question # 12
Which notation shows the upper bound of time complexity.
Question # 13
Complexity class representing problesm solvable efficinetly by a deterministic alogrithm .
Question # 14
Which is an example of O (log n) comlexity.
Question # 15
What is a key limitatio of Greedy Algorithms.
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 -
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 Shumaila Riaz 13 - Dec - 2024 02 Min 57 Sec 12/15 -
S Shah az Ali 22 - Dec - 2024 04 Min 42 Sec 12/15
ICS Part 1 Computer Science (New Book) Chapter 3 Important MCQ's
| Sr.# | Question | Answer |
|---|---|---|
| 1 |
Why is tractability important. |
A.
Output color
B.
Language choice
C.
Solve efficiently
D.
Input type |
| 2 |
How does Divide and conquere work. |
A.
Make local chices
B.
Break ,solve, combine
C.
Store subproblem results
D.
Try alloptions, backtrack |
| 3 |
How does Linear search work |
A.
Halve search interval
B.
Check each item one by one
C.
Explore branch deeply
D.
Use queue for nodes |
| 4 |
Which is an NP complete problem. |
A.
Sorting
B.
Knapsack
C.
GCD finding
D.
Binary search |
| 5 |
What is the main advantages of dynamic programming. |
A.
Avoid redundant work
B.
Locally optimal results
C.
Solves independent problems
D.
Explore alloptions |
| 6 |
Waht does O (n2) indicate. |
A.
Linear growth
B.
Constant time
C.
Square of input
D.
Logarithmic growth |
| 7 |
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 |
| 8 |
Which is solved by Dynamic Programming. |
A.
Coin Change
B.
Fibonacci sequence
C.
Merge sort
D.
Puzzle solving |
| 9 |
What is the primary goal of algorithm design techniques. |
A.
Improve hardware
B.
Solve problems systematically
C.
Reduce imput size
D.
Debug software |
| 10 |
The Halting Problem is an example of. |
A.
Solvable problem
B.
Tractable prolem
C.
Unsolvable problem
D.
NP Complete problem |
Test Questions