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 the main advantages of dynamic programming.
Question # 2
Which technique is used in Merge sort.
Question # 3
Whcih is an III-defined problem.
Question # 4
What is computational problem.
Question # 5
Which alorithm finds node relationships in a graph.
Question # 6
Why use real life tasks in algorithm learning.
Question # 7
Which is solved by dynamic programming.
Question # 8
NP Problems can be
Question # 9
Tractable prolem canbe solved
Question # 10
What defines a Greedy algorithm
Question # 11
Waht does O (n2) indicate.
Question # 12
How does Divide and conqurr work
Question # 13
How does Linear search work
Question # 14
What is the primary goal of algorithm design techniques.
Question # 15
Problems in class P are solved in.
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 |
The Halting Problem is an example of. |
A.
Solvable problem
B.
Tractable prolem
C.
Unsolvable problem
D.
NP Complete problem |
| 3 |
Which diagram shows P, NO, NP-hard,NP Complete |
A.
Bar chart
B.
Pie chart
C.
Venn diagram
D.
Lne graph |
| 4 |
Which is solved by Dynaimc programming. |
A.
Coin Change
B.
Fibonacci sequence
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 |
An algorithm that sort data by stepping thourgh the list and swapping adjacent elements if needed is. |
A.
Selection sort
B.
Quick sort
C.
Bubble sort
D.
Merge sort |
| 7 |
How does Linear search work |
A.
Halve search interval
B.
Check each item one by one
C.
Explore branch deeply
D.
Use queue for nodes |
| 8 |
What is generate and Test algorithm |
A.
Tests all options
B.
Picks one solution
C.
skips testing
D.
Uses no logic |
| 9 |
When is Generate and Test best. |
A.
small prblem space
B.
Large problem space
C.
No testing needed
D.
No solutions exist |
| 10 |
How do BFS and DFS differ. |
A.
BFS Stack, DFS -queue
B.
BFS -level , DFS -depth
C.
BFS Sort, DFS-Search
D.
BFS always slower |
Test Questions