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
Whcih is a sorting algorithms.
Question # 2
How does Divide and conqurr work
Question # 3
Tractability depends on
Question # 4
Complexity class representing problesm solvable efficinetly by a deterministic alogrithm .
Question # 5
If P= NP ,this means
Question # 6
What is the main advantage of Dynamic Programming.
Question # 7
Which technique is used in Merge sort.
Question # 8
What is the primary goal of algorithm design techniques.
Question # 9
How does selection sort work.
Question # 10
What does “input” mean in a computational problem.
Question # 11
Whcih is an III-defined problem.
Question # 12
Why is tractability important.
Question # 13
Which is an example of O (log n) comlexity.
Question # 14
Why are commonly used algorithms important.
Question # 15
What is a key limitatio of Greedy Algorithms.
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 |
Whcih is an III-defined problem. |
A.
Check even number
B.
Find shortest path
C.
Reduce poverty
D.
Count book arrangements |
| 2 |
For which problems is Backtracking suitable |
A.
Optimal substrcuture
B.
Explore all combnations
C.
ONe optimal choice
D.
No overlapping problems |
| 3 |
What does time complexity measrue. |
A.
Memory use
B.
Time growth with input
C.
Number of loops
D.
Output accuracy |
| 4 |
Whcih is a sorting algorithms. |
A.
Linear search
B.
Qucik sort
C.
DFS
D.
BFS |
| 5 |
What is role of algorithm in problem solving. |
A.
Gives steps
B.
Ignores logic
C.
Random process
D.
Blocks solutions |
| 6 |
What do sorting algorithm mainly do. |
A.
Network routing
B.
Arrange data
C.
Find node links
D.
Search data |
| 7 |
What is the primary goal of algorithm design techniques. |
A.
Imporve hardware
B.
Sovle problems systematically
C.
Reduce input size
D.
Debug software |
| 8 |
Seach algorithm more efficinet for large datasets. |
A.
Bubble sort
B.
Merge sort
C.
Quick Sort
D.
Selection sort |
| 9 |
Which alorithm finds node relationships in a graph. |
A.
Bubble sort
B.
Linear Search
C.
BFS
D.
Selection sort |
| 10 |
What is the main advantage of Dynamic programming. |
A.
Avoid redundant work
B.
Locally optimal results
C.
Solve independent problems
D.
Explore alloptions |
Test Questions