.jpg)
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
Problems in NP and NP-hard are called.
Question # 2
Knowing if a problem is solvable hellps.
Question # 3
Problems in class P are solved in.
Question # 4
How does Linear Search work.
Question # 5
What does space complexity measure.
Question # 6
Which of the following correctly describes a solvable problem.
Question # 7
How do BFS and DFS differ.
Question # 8
How does Linear search work
Question # 9
Why is tractability important.
Question # 10
Which notation shows the upper bound of time complexity.
Question # 11
Why is bubble sort not for large datasets.
Question # 12
Which diagram shows P, NO, NP-hard,NP Complete
Question # 13
For which problems is Backtracking suitable
Question # 14
Which is a Greedy Algorithm example
Question # 15
What is the primary goal of algorithm design techniques.
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 |
If P= NP ,this means |
A.
Some NP unsolvable
B.
all NP solvable inpolynomial time
C.
All NP unsolvable
D.
Same space complexity |
| 2 |
Tractable prolem canbe solved |
A.
In exponential time
B.
Efficiently with large input
C.
With no algorithm
D.
Are always NP hard |
| 3 |
Why is tractability important. |
A.
Output color
B.
Language choice
C.
Solve efficiently
D.
Input type |
| 4 |
NP hard problems are |
A.
Easy to solve
B.
Alway solvable
C.
As hard as NP problem
D.
In class P |
| 5 |
Which technique is used in Merge sort. |
A.
Greedy
B.
Divide and conqurer
C.
Dynaimc Programming
D.
Back tracking |
| 6 |
What does page rank algorithm analyze. |
A.
Page links
B.
page color
C.
Page size
D.
Page font |
| 7 |
How does Divide and conquere work. |
A.
Make local chices
B.
Break ,solve, combine
C.
Store subproblem results
D.
Try alloptions, backtrack |
| 8 |
What is the primary goal of algorithm design techniques. |
A.
Imporve hardware
B.
Sovle problems systematically
C.
Reduce input size
D.
Debug software |
| 9 |
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 |
| 10 |
The Halting Problem is an example of. |
A.
Solvable problem
B.
Tractable prolem
C.
Unsolvable problem
D.
NP Complete problem |
Test Questions