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
The meanig of NP in computational complexity is.
Question # 2
What does time complexity measrue.
Question # 3
Why are commonly used algorithms important.
Question # 4
P vs NP asks if
Question # 5
What do sorting algorithm mainly do.
Question # 6
What is the primary goal of algorithm design techniques.
Question # 7
What is the primary goal of algorithm design techniques.
Question # 8
Which is an example of O (log n) comlexity.
Question # 9
How does Backtracking work.
Question # 10
What is outpout when checking if 8 is even.
Question # 11
Which is solved by dynamic programming.
Question # 12
How does Backtracking work.
Question # 13
Knowing if a problem is solvable hellps.
Question # 14
How does Linear Search work.
Question # 15
Why is tractability important.
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 |
Which is an example of O (log n) comlexity. |
A.
Sorting numbers
B.
Pair comparison
C.
Binary search
D.
Linear search |
| 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 |
Which is solved by Dynaimc programming. |
A.
Coin Change
B.
Fibonacci sequence
C.
Merge sort
D.
Puzzle solving |
| 4 |
What is the main advantages of dynamic programming. |
A.
Avoid redundant work
B.
Locally optimal results
C.
Solves independent problems
D.
Explore alloptions |
| 5 |
What do sorting algorithm mainly do. |
A.
Network routing
B.
Arrange data
C.
Find node links
D.
Search data |
| 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 |
A seenario where Dynaimic progrmming proves most useful |
A.
Problem withou overlapping sub problems
B.
Problems solved by making local choices
C.
Problems with overlapping sub problems and optimal sbstructure
D.
Problem divided into independent sub problems |
| 8 |
Which of the following correctly describes a solvable problem. |
A.
Cannot be solved
B.
Takes infinite time
C.
Soved by algorithm in finite time
D.
Has no input/output |
| 9 |
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 |
| 10 |
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 |
Test Questions