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
NP Problems can be
Question # 2
NP hard problems are
Question # 3
Which is an example of O (log n) comlexity.
Question # 4
Why is tractability important.
Question # 5
How does Linear Search work.
Question # 6
Seach algorithm more efficinet for large datasets.
Question # 7
What is role of algorithm in problem solving.
Question # 8
When is Generate and Test best.
Question # 9
Which of the following correctly describes a solvable problem.
Question # 10
What is the main advantage of Dynamic Programming.
Question # 11
Whcih is a sorting algorithms.
Question # 12
Which is an NP complete problem.
Question # 13
For which problems is Backtracking suitable
Question # 14
The statement ghat applies to unsolvable problem
Question # 15
The Halting Problem is an example of.
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 |
An algorithm with a time complexity of O(n log n): |
A.
Bubble sort
B.
Binary Search
C.
Merge Sort
D.
Insertion sort |
| 2 |
Which is solved by Dynaimc programming. |
A.
Coin Change
B.
Fibonacci sequence
C.
Merge sort
D.
Puzzle solving |
| 3 |
Complexity class representing problesm solvable efficinetly by a deterministic alogrithm . |
A.
P
B.
NP-Hard
C.
NP
D.
NP -Complete |
| 4 |
NP- complete matters because. |
A.
Solved faster than P
B.
Solving one solves all NP
C.
aLWAYS TRACTABLE
D.
nO REAL USE |
| 5 |
Easy to verify but hard to solve problem are in. |
A.
NP
B.
P
C.
NP hard
D.
Undecidable |
| 6 |
Waht does O (n2) indicate. |
A.
Linear growth
B.
Constant time
C.
Square of input
D.
Logarithmic growth |
| 7 |
The Halting Problem is an example of. |
A.
Solvable problem
B.
Tractable prolem
C.
Unsolvable problem
D.
NP Complete problem |
| 8 |
The statement ghat applies to unsolvable problem |
A.
They can be solved in polynomial time
B.
They cannot be solved by any alogorithm
C.
They are always in NP class
D.
They require exponetial time to solve |
| 9 |
What is a key limitatio of Greedy Algorithms. |
A.
Too complex
B.
Always optimal
C.
Not always optimal
D.
High memory use |
| 10 |
Which problem gives yes /no answer. |
A.
Search
B.
Decision
C.
Optimization
D.
Counting |
Test Questions