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
The characteristic of a well defined problem is.
Question # 2
Whcih is a sorting algorithms.
Question # 3
When is Generate and Test best.
Question # 4
What is the main advantage of Dynamic Programming.
Question # 5
NP hard problems are
Question # 6
For which problems is Backtracking suitable
Question # 7
The halting problem is.
Question # 8
How do BFS and DFS differ.
Question # 9
Which is solved by Dynaimc programming.
Question # 10
How does Backtracking work.
Question # 11
Waht does O (n2) indicate.
Question # 12
Tractability depends on
Question # 13
How does Divide and conquere work.
Question # 14
Which is an example of O (log n) comlexity.
Question # 15
Which is solved by dynamic 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 -
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 |
Tractable prolem canbe solved |
A.
In exponential time
B.
Efficiently with large input
C.
With no algorithm
D.
Are always NP hard |
| 2 |
Complexity class representing problesm solvable efficinetly by a deterministic alogrithm . |
A.
P
B.
NP-Hard
C.
NP
D.
NP -Complete |
| 3 |
P vs NP asks if |
A.
Fast solutions are in NP
B.
Check complexity
C.
Debug rrors
D.
Improve hardware |
| 4 |
Why are commonly used algorithms important. |
A.
Reduce hardware cost
B.
Solve common Problems efficiently
C.
Remvoe need for data structure
D.
For theory only |
| 5 |
Which is solved by Dynamic Programming. |
A.
Coin Change
B.
Fibonacci sequence
C.
Merge sort
D.
Puzzle solving |
| 6 |
Whcih is an III-defined problem. |
A.
Check even number
B.
Find shortest path
C.
Reduce poverty
D.
Count book arrangements |
| 7 |
What is the purpose of search algorithms |
A.
Arrange data
B.
Find secific data
C.
analyze nodes
D.
Save memory |
| 8 |
Seach algorithm more efficinet for large datasets. |
A.
Bubble sort
B.
Merge sort
C.
Quick Sort
D.
Selection sort |
| 9 |
The Halting Problem is an example of. |
A.
Solvable problem
B.
Tractable prolem
C.
Unsolvable problem
D.
NP Complete problem |
| 10 |
Which is a Greedy Algorithm example |
A.
Fibonacci sequence
B.
Coin change
C.
Merge sort
D.
Puzzle solving |
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