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
Which is an example of O (log n) comlexity.
Question # 2
Which is solved by Dynamic Programming.
Question # 3
Waht does O (n2) indicate.
Question # 4
Why is tractability important.
Question # 5
How do BFS and DFS differ.
Question # 6
Whcih is an III-defined problem.
Question # 7
What is the main advantage of Dynamic Programming.
Question # 8
What does page rank algorithm analyze.
Question # 9
Which of the following correctly describes a solvable problem.
Question # 10
What is generate and Test algorithm
Question # 11
What is the primary goal of algorithm design techniques.
Question # 12
Why are commonly used algorithms important.
Question # 13
A seenario where Dynaimic progrmming proves most useful
Question # 14
P vs NP asks if
Question # 15
Which diagram shows P, NO, NP-hard,NP Complete
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 |
For which problems is Backtracking suitable |
A.
Optimal substrcuture
B.
Explore all combnations
C.
ONe optimal choice
D.
No overlapping problems |
| 2 |
Which is solved by Dynaimc programming. |
A.
Coin Change
B.
Fibonacci sequence
C.
Merge sort
D.
Puzzle solving |
| 3 |
Whcih is an III-defined problem. |
A.
Check even number
B.
Find shortest path
C.
Reduce poverty
D.
Count book arrangements |
| 4 |
Sovable problems differ becasue they. |
A.
Take exponential time
B.
Need better hardware
C.
Halt with a result
D.
Have no input |
| 5 |
An algorithm with a time complexity of O(n log n): |
A.
Bubble sort
B.
Binary Search
C.
Merge Sort
D.
Insertion sort |
| 6 |
What is the purpose of search algorithms |
A.
Arrange data
B.
Find secific data
C.
analyze nodes
D.
Save memory |
| 7 |
What is the main advantage of Dynamic Programming. |
A.
Avoid redundant work
B.
Locally optmal results
C.
Sole independent problems
D.
Explore all options |
| 8 |
Whcih is a sorting algorithms. |
A.
Linear search
B.
Qucik sort
C.
DFS
D.
BFS |
| 9 |
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 |
| 10 |
What do sorting algorithm mainly do. |
A.
Network routing
B.
Arrange data
C.
Find node links
D.
Search data |
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