Home
News
Colleges
Courses
Admission
Lectures
Online Test
Past Papers
Date Sheets
Results
Study Abroad
Jobs
Tutors
More
Apps
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
Why are commonly used algorithms important.
Question # 3
What is generate and Test algorithm
Question # 4
NP Problems can be
Question # 5
Which technique is used in Merge sort.
Question # 6
Which is solved by Dynaimc programming.
Question # 7
The halting problem is.
Question # 8
How does Backtracking work.
Question # 9
An algorithm with a time complexity of O(n log n):
Question # 10
What is computational problem.
Question # 11
For which problems is Backtracing suitable.
Question # 12
NP- complete matters because.
Question # 13
What does “input” mean in a computational problem.
Question # 14
How do BFS and DFS differ.
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 -
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 Sibtain Iqbal 08 - Sep - 2026 02 Min 43 Sec 12/15
ICS Part 1 Computer Science (New Book) Chapter 3 Important MCQ's
| Sr.# | Question | Answer |
|---|---|---|
| 1 |
Seach algorithm more efficinet for large datasets. |
A.
Bubble sort
B.
Merge sort
C.
Quick Sort
D.
Selection sort |
| 2 |
How does selection sort work. |
A.
Swap adjacent
B.
Select minium form unsorted part
C.
Use quenue for nodes
D.
Store intermediate results |
| 3 |
Whcih is a sorting algorithms. |
A.
Linear search
B.
Qucik sort
C.
DFS
D.
BFS |
| 4 |
Which is a Greedy Algorithm example |
A.
Fibonacci sequence
B.
Coin change
C.
Merge sort
D.
Puzzle solving |
| 5 |
What does time complexity measrue. |
A.
Memory use
B.
Time growth with input
C.
Number of loops
D.
Output accuracy |
| 6 |
What does page rank algorithm analyze. |
A.
Page links
B.
page color
C.
Page size
D.
Page font |
| 7 |
For which problems is Backtracking suitable |
A.
Optimal substrcuture
B.
Explore all combnations
C.
ONe optimal choice
D.
No overlapping problems |
| 8 |
Which is solved by Dynaimc programming. |
A.
Coin Change
B.
Fibonacci sequence
C.
Merge sort
D.
Puzzle solving |
| 9 |
Which is an NP complete problem. |
A.
Sorting
B.
Knapsack
C.
GCD finding
D.
Binary search |
| 10 |
Which is solved by Dynamic Programming. |
A.
Coin Change
B.
Fibonacci sequence
C.
Merge sort
D.
Puzzle solving |
Test Questions