.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
Which problem gives yes /no answer.
Question # 2
Waht does O (n2) indicate.
Question # 3
What does “input” mean in a computational problem.
Question # 4
Whcih is a sorting algorithms.
Question # 5
Problems in class P are solved in.
Question # 6
Seach algorithm more efficinet for large datasets.
Question # 7
What is computational problem.
Question # 8
Tractability depends on
Question # 9
NP- complete matters because.
Question # 10
What does space complexity measure.
Question # 11
What is the primary goal of algorithm design techniques.
Question # 12
Why are commonly used algorithms important.
Question # 13
The meanig of NP in computational complexity is.
Question # 14
Which is an NP complete problem.
Question # 15
Which is solved by Dynaimc programming.
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 |
Easy to verify but hard to solve problem are in. |
A.
NP
B.
P
C.
NP hard
D.
Undecidable |
| 2 |
The Halting Problem is an example of. |
A.
Solvable problem
B.
Tractable prolem
C.
Unsolvable problem
D.
NP Complete problem |
| 3 |
Which is solved by Dynamic Programming. |
A.
Coin Change
B.
Fibonacci sequence
C.
Merge sort
D.
Puzzle solving |
| 4 |
The meanig of NP in computational complexity is. |
A.
Non deterministic polynomial time
B.
Negative polynomial time
C.
No trivial polynomial time
D.
Numerical polynomial time |
| 5 |
How does selection sort work. |
A.
Swap adjacent
B.
Select minium form unsorted part
C.
Use quenue for nodes
D.
Store intermediate results |
| 6 |
Which notation shows the upper bound of time complexity. |
A.
Omega
B.
Theta
C.
Big O
D.
Lambda |
| 7 |
Which alorithm finds node relationships in a graph. |
A.
Bubble sort
B.
Linear Search
C.
BFS
D.
Selection sort |
| 8 |
What is role of algorithm in problem solving. |
A.
Gives steps
B.
Ignores logic
C.
Random process
D.
Blocks solutions |
| 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 |
How does Backtracking work. |
A.
Break into parts
B.
Build and Backtrack
C.
Store subproblems
D.
Make local choices |
Test Questions