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 a key limitatio of Greedy Algorithms.
Question # 2
What does page rank algorithm analyze.
Question # 3
Why are commonly used algorithms important.
Question # 4
What is generate and Test algorithm
Question # 5
For which problems is Backtracing suitable.
Question # 6
The Halting Problem is an example of.
Question # 7
Why is bubble sort not for large datasets.
Question # 8
Why is tractability important.
Question # 9
An algorithm with a time complexity of O(n log n):
Question # 10
How does Divide and conqurr work
Question # 11
Which diagram shows P, NO, NP-hard,NP Complete
Question # 12
When is Generate and Test best.
Question # 13
How does bubble sort work
Question # 14
NP- complete matters because.
Question # 15
What is the primary goal of algorithm design techniques.
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 |
What is the purpose of search algorithms |
A.
Arrange data
B.
Find secific data
C.
analyze nodes
D.
Save memory |
| 2 |
Tractability depends on |
A.
Inputs
B.
Complexity
C.
Outputs
D.
Algorthm type |
| 3 |
The characteristic of a well defined problem is. |
A.
Ambiguous goals and uncelear requirements
B.
Vegue processes and inputs
C.
Clear goas, inpus, processes, and oututs
D.
Undrined solutions |
| 4 |
How does Divide and conquere work. |
A.
Make local chices
B.
Break ,solve, combine
C.
Store subproblem results
D.
Try alloptions, backtrack |
| 5 |
What does “input” mean in a computational problem. |
A.
Result after processing
B.
Steps to solve
C.
Data at start
D.
Type of problem |
| 6 |
What is the main advantage of Dynamic Programming. |
A.
Avoid redundant work
B.
Locally optmal results
C.
Sole independent problems
D.
Explore all options |
| 7 |
What defines a Greedy algorithm |
A.
Explore all solutions
B.
Make best local choice
C.
Store results
D.
Divide problems |
| 8 |
P vs NP asks if |
A.
Fast solutions are in NP
B.
Check complexity
C.
Debug rrors
D.
Improve hardware |
| 9 |
What is outpout when checking if 8 is even. |
A.
Found at 2
B.
Even
C.
Odd
D.
Yes |
| 10 |
For which problems is Backtrackign suitable. |
A.
Optimal substructure
B.
Explore all combinations
C.
One optimal choice
D.
No overlapping problems |
Test Questions