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
An algorithm with a time complexity of O(n log n):
Question # 2
Which problem gives yes /no answer.
Question # 3
NP Problems can be
Question # 4
How does selection sort work.
Question # 5
Which of the following correctly describes a solvable problem.
Question # 6
Tractability depends on
Question # 7
Which technique is used in Merge sort.
Question # 8
The meanig of NP in computational complexity is.
Question # 9
How does bubble sort work
Question # 10
When is Generate and Test best.
Question # 11
Which is an NP complete problem.
Question # 12
Whcih is an III-defined problem.
Question # 13
What is computational problem.
Question # 14
What is generate and Test algorithm
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 -
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 |
How does Backtracking work. |
A.
Break into parts
B.
Build and Backtrack
C.
Store subproblems
D.
Make local choices |
| 2 |
Why use real life tasks in algorithm learning. |
A.
Show steps in life
B.
Make it harder
C.
Reduce interest
D.
Add confusion |
| 3 |
Complexity class representing problesm solvable efficinetly by a deterministic alogrithm . |
A.
P
B.
NP-Hard
C.
NP
D.
NP -Complete |
| 4 |
Which is an NP complete problem. |
A.
Sorting
B.
Knapsack
C.
GCD finding
D.
Binary search |
| 5 |
Knowing if a problem is solvable hellps. |
A.
Increase complexity
B.
Save time
C.
Generate random output
D.
Avoid design |
| 6 |
If P= NP ,this means |
A.
Some NP unsolvable
B.
all NP solvable inpolynomial time
C.
All NP unsolvable
D.
Same space complexity |
| 7 |
NP hard problems are |
A.
Easy to solve
B.
Alway solvable
C.
As hard as NP problem
D.
In class P |
| 8 |
Problems in class P are solved in. |
A.
Exponentilal time
B.
Polynomial time
C.
Non determinaistic time
D.
Ifinite time |
| 9 |
What defines a Greedy algorithm |
A.
Explore all solutions
B.
Make best local choice
C.
Store results
D.
Divide problems |
| 10 |
How do BFS and DFS differ. |
A.
BFS Stack, DFS -queue
B.
BFS -level , DFS -depth
C.
BFS Sort, DFS-Search
D.
BFS always slower |
Test Questions