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 problem gives yes /no answer.
Question # 2
Whcih is a sorting algorithms.
Question # 3
How do BFS and DFS differ.
Question # 4
Which diagram shows P, NO, NP-hard,NP Complete
Question # 5
Seach algorithm more efficinet for large datasets.
Question # 6
What is the primary goal of algorithm design techniques.
Question # 7
What is computational problem.
Question # 8
NP Problems can be
Question # 9
The halting problem is.
Question # 10
What is the main advantage of Dynamic Programming.
Question # 11
Which is solved by dynamic programming.
Question # 12
A seenario where Dynaimic progrmming proves most useful
Question # 13
What does page rank algorithm analyze.
Question # 14
How does Divide and conquere work.
Question # 15
Tractability depends on
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 |
How does Divide and conqurr work |
A.
Make local choices
B.
Break, sole, combine
C.
Store subproblem results
D.
Try all options, backtrack |
| 2 |
Tractability depends on |
A.
Inputs
B.
Complexity
C.
Outputs
D.
Algorthm type |
| 3 |
What is limitation Greedy algorithms |
A.
Too complex
B.
Always optimal
C.
Not always optimal
D.
High memory use |
| 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 space complexity measure. |
A.
Execution time
B.
Memory usage
C.
Number of steps
D.
Result accuracy |
| 6 |
Which is solved by Dynamic Programming. |
A.
Coin Change
B.
Fibonacci sequence
C.
Merge sort
D.
Puzzle solving |
| 7 |
Why use real life tasks in algorithm learning. |
A.
Show steps in life
B.
Make it harder
C.
Reduce interest
D.
Add confusion |
| 8 |
What is a key limitatio of Greedy Algorithms. |
A.
Too complex
B.
Always optimal
C.
Not always optimal
D.
High memory use |
| 9 |
Waht does O (n2) indicate. |
A.
Linear growth
B.
Constant time
C.
Square of input
D.
Logarithmic growth |
| 10 |
Why is tractability important. |
A.
Output color
B.
Language choice
C.
Solve efficiently
D.
Input type |
Test Questions