Home
News
Colleges
Courses
Admission
Lectures
Online Test
Past Papers
Date Sheets
Results
Study Abroad
Jobs
Tutors
More
Apps
.jpg)
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
What is generate and Test algorithm
Question # 2
What is a key limitatio of Greedy Algorithms.
Question # 3
What is the main advantages of dynamic programming.
Question # 4
Problems in NP and NP-hard are called.
Question # 5
What does “input” mean in a computational problem.
Question # 6
The statement ghat applies to unsolvable problem
Question # 7
Waht does O (n2) indicate.
Question # 8
Why is bubble sort not for large datasets.
Question # 9
What is computational problem.
Question # 10
What does page rank algorithm analyze.
Question # 11
What do sorting algorithm mainly do.
Question # 12
What is the primary goal of algorithm design techniques.
Question # 13
The characteristic of a well defined problem is.
Question # 14
How does Backtracking work.
Question # 15
For which problems is Backtracing suitable.
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 |
For which problems is Backtracing suitable. |
A.
Optimal substrcuture
B.
Explore all combinations
C.
ON optimal choice
D.
No overlapping problems |
| 2 |
Easy to verify but hard to solve problem are in. |
A.
NP
B.
P
C.
NP hard
D.
Undecidable |
| 3 |
Whcih is a sorting algorithms. |
A.
Linear search
B.
Qucik sort
C.
DFS
D.
BFS |
| 4 |
NP- complete matters because. |
A.
Solved faster than P
B.
Solving one solves all NP
C.
aLWAYS TRACTABLE
D.
nO REAL USE |
| 5 |
Which is solved by dynamic programming. |
A.
Coin change
B.
Fibonacci sequence
C.
Merge sort
D.
Puzzle solving |
| 6 |
Knowing if a problem is solvable hellps. |
A.
Increase complexity
B.
Save time
C.
Generate random output
D.
Avoid design |
| 7 |
How does Backtracking work. |
A.
Break in to parts
B.
Make local choices
C.
Build and backtrack
D.
Store subproblems |
| 8 |
Which is a Greedy Algorithm example |
A.
Fibonacci sequence
B.
Coin change
C.
Merge sort
D.
Puzzle solving |
| 9 |
Which problem gives yes /no answer. |
A.
Search
B.
Decision
C.
Optimization
D.
Counting |
| 10 |
For which problems is Backtracking suitable |
A.
Optimal substrcuture
B.
Explore all combnations
C.
ONe optimal choice
D.
No overlapping problems |
Test Questions