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 primary goal of algorithm design techniques.
Question # 2
An algorithm that sort data by stepping thourgh the list and swapping adjacent elements if needed is.
Question # 3
Which technique is used in Merge sort.
Question # 4
Which is an example of O (log n) comlexity.
Question # 5
The meanig of NP in computational complexity is.
Question # 6
The Halting Problem is an example of.
Question # 7
How does Divide and conquere work.
Question # 8
How does Backtracking work.
Question # 9
Problems in NP and NP-hard are called.
Question # 10
Easy to verify but hard to solve problem are in.
Question # 11
What do sorting algorithm mainly do.
Question # 12
Why is tractability important.
Question # 13
NP hard problems are
Question # 14
What is generate and Test algorithm
Question # 15
The halting problem is.
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 |
Why are commonly used algorithms important. |
A.
Reduce hrdware cost
B.
Solve common problems efficiently
C.
Remove need for data structures
D.
for theory only |
| 2 |
Why use real life tasks in algorithm learning. |
A.
Show steps in life
B.
Make it harder
C.
Reduce interest
D.
Add confusion |
| 3 |
NP hard problems are |
A.
Easy to solve
B.
Alway solvable
C.
As hard as NP problem
D.
In class P |
| 4 |
Which problem gives yes /no answer. |
A.
Search
B.
Decision
C.
Optimization
D.
Counting |
| 5 |
How does Backtracking work. |
A.
Break in to parts
B.
Make local choices
C.
Build and backtrack
D.
Store subproblems |
| 6 |
What is the primary goal of algorithm design techniques. |
A.
Improve hardware
B.
Solve problems systematically
C.
Reduce imput size
D.
Debug software |
| 7 |
Tractability depends on |
A.
Inputs
B.
Complexity
C.
Outputs
D.
Algorthm type |
| 8 |
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 |
| 9 |
Easy to verify but hard to solve problem are in. |
A.
NP
B.
P
C.
NP hard
D.
Undecidable |
| 10 |
What do sorting algorithm mainly do. |
A.
Network routing
B.
Arrange data
C.
Find node links
D.
Search data |
Test Questions