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
How does Linear search work
Question # 2
When is Generate and Test best.
Question # 3
What defines a Greedy algorithm
Question # 4
Which technique is used in Merge sort.
Question # 5
NP Problems can be
Question # 6
Why use real life tasks in algorithm learning.
Question # 7
Which is a Greedy Algorithm example
Question # 8
An algorithm that sort data by stepping thourgh the list and swapping adjacent elements if needed is.
Question # 9
Why is tractability important.
Question # 10
What is the purpose of search algorithms
Question # 11
Which is an NP complete problem.
Question # 12
What is a key limitatio of Greedy Algorithms.
Question # 13
Why is bubble sort not for large datasets.
Question # 14
How does bubble sort work
Question # 15
What is the primary goal of algorithm design techniques.
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 |
Easy to verify but hard to solve problem are in. |
A.
NP
B.
P
C.
NP hard
D.
Undecidable |
| 2 |
For which problems is Backtrackign suitable. |
A.
Optimal substructure
B.
Explore all combinations
C.
One optimal choice
D.
No overlapping problems |
| 3 |
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 |
| 4 |
What is a key limitatio of Greedy Algorithms. |
A.
Too complex
B.
Always optimal
C.
Not always optimal
D.
High memory use |
| 5 |
Which diagram shows P, NO, NP-hard,NP Complete |
A.
Bar chart
B.
Pie chart
C.
Venn diagram
D.
Lne graph |
| 6 |
Which technique is used in Merge sort. |
A.
Greedy
B.
Divide and conqurer
C.
Dynaimc Programming
D.
Back tracking |
| 7 |
Tractable prolem canbe solved |
A.
In exponential time
B.
Efficiently with large input
C.
With no algorithm
D.
Are always NP hard |
| 8 |
Whcih is a sorting algorithms. |
A.
Linear search
B.
Qucik sort
C.
DFS
D.
BFS |
| 9 |
Which is a Greedy Algorithm example |
A.
Fibonacci sequence
B.
Coin change
C.
Merge sort
D.
Puzzle solving |
| 10 |
The halting problem is. |
A.
Solvable and tractable
B.
Unsolable and in P
C.
Unsolvable and not in NP
D.
NP Complete |
Test Questions