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
An algorithm with a time complexity of O(n log n):
Question # 2
Complexity class representing problesm solvable efficinetly by a deterministic alogrithm .
Question # 3
What is outpout when checking if 8 is even.
Question # 4
For which problems is Backtrackign suitable.
Question # 5
What defines a Greedy algorithm
Question # 6
Easy to verify but hard to solve problem are in.
Question # 7
Which is solved by Dynamic Programming.
Question # 8
How does bubble sort work
Question # 9
Which is solved by Dynaimc programming.
Question # 10
NP Problems can be
Question # 11
When is Generate and Test best.
Question # 12
What is the primary goal of algorithm design techniques.
Question # 13
Problems in NP and NP-hard are called.
Question # 14
Which problem gives yes /no answer.
Question # 15
Tractable prolem canbe solved
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 |
Whcih is an III-defined problem. |
A.
Check even number
B.
Find shortest path
C.
Reduce poverty
D.
Count book arrangements |
| 2 |
Tractable prolem canbe solved |
A.
In exponential time
B.
Efficiently with large input
C.
With no algorithm
D.
Are always NP hard |
| 3 |
Which is solved by Dynamic Programming. |
A.
Coin Change
B.
Fibonacci sequence
C.
Merge sort
D.
Puzzle solving |
| 4 |
For which problems is Backtracking suitable |
A.
Optimal substrcuture
B.
Explore all combnations
C.
ONe optimal choice
D.
No overlapping problems |
| 5 |
Whcih is a sorting algorithms. |
A.
Linear search
B.
Qucik sort
C.
DFS
D.
BFS |
| 6 |
What is generate and Test algorithm |
A.
Tests all options
B.
Picks one solution
C.
skips testing
D.
Uses no logic |
| 7 |
How does Backtracking work. |
A.
Break in to parts
B.
Make local choices
C.
Build and backtrack
D.
Store subproblems |
| 8 |
How does bubble sort work |
A.
Select smallest and swap
B.
Swap adjacent if wrong
C.
Divide and merge
D.
Explore nodes level wise |
| 9 |
What is the main advantages of dynamic programming. |
A.
Avoid redundant work
B.
Locally optimal results
C.
Solves independent problems
D.
Explore alloptions |
| 10 |
Why are commonly used algorithms important. |
A.
Reduce hardware cost
B.
Solve common Problems efficiently
C.
Remvoe need for data structure
D.
For theory only |
Test Questions