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 computational problem.
Question # 2
Which notation shows the upper bound of time complexity.
Question # 3
What is the main advantage of Dynamic programming.
Question # 4
The Halting Problem is an example of.
Question # 5
How do BFS and DFS differ.
Question # 6
P vs NP asks if
Question # 7
What does space complexity measure.
Question # 8
Which is a Greedy Algorithm example
Question # 9
Why is bubble sort not for large datasets.
Question # 10
Problems in class P are solved in.
Question # 11
Tractable prolem canbe solved
Question # 12
What does page rank algorithm analyze.
Question # 13
Which is solved by dynamic programming.
Question # 14
Which of the following correctly describes a solvable problem.
Question # 15
Which problem gives yes /no answer.
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 -
T Toqeer Ahmad 16 - May - 2026 01 Min 10 Sec 14/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 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 |
Problems in NP and NP-hard are called. |
A.
P
B.
BPP
C.
NP Complete
D.
Tractable |
| 2 |
NP Problems can be |
A.
Solved in polynomial time
B.
Verified in polynomial time
C.
Solved in exponeitial timeonly
D.
Not verified |
| 3 |
Why are commonly used algorithms important. |
A.
Reduce hrdware cost
B.
Solve common problems efficiently
C.
Remove need for data structures
D.
for theory only |
| 4 |
Which is an example of O (log n) comlexity. |
A.
Sorting numbers
B.
Pair comparison
C.
Binary search
D.
Linear search |
| 5 |
What is outpout when checking if 8 is even. |
A.
Found at 2
B.
Even
C.
Odd
D.
Yes |
| 6 |
What is the main advantage of Dynamic programming. |
A.
Avoid redundant work
B.
Locally optimal results
C.
Solve independent problems
D.
Explore alloptions |
| 7 |
Why is bubble sort not for large datasets. |
A.
Needs more memory
B.
O (n2) time complexity
C.
Works on sorted data only
D.
Can't handle numbers |
| 8 |
Why is tractability important. |
A.
Output color
B.
Language choice
C.
Solve efficiently
D.
Input type |
| 9 |
Which is solved by Dynamic Programming. |
A.
Coin Change
B.
Fibonacci sequence
C.
Merge sort
D.
Puzzle solving |
| 10 |
The halting problem is. |
A.
Solvable and tractable
B.
Unsolable and in P
C.
Unsolvable and not in NP
D.
NP Complete |
Test Questions
Share your comments & questions here
Haseeb Sajid
29 Mar 2024very helpful app for mcq s preparation please also give short question here of all subjects as a test base
Guest User
17 Oct 2019Shehzad khan
Muhammad Awais
17 Apr 2019GIVE SOME IMPORTANT QUESTION ABOUT TODAY PAPER
sohaib
21 Nov 2017Very helpful
babar ali
23 May 2017Can anyone beat me