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
When is Generate and Test best.
Question # 2
Tractability depends on
Question # 3
What is the main advantage of Dynamic Programming.
Question # 4
Whcih is a sorting algorithms.
Question # 5
Waht does O (n2) indicate.
Question # 6
An algorithm that sort data by stepping thourgh the list and swapping adjacent elements if needed is.
Question # 7
Which alorithm finds node relationships in a graph.
Question # 8
Whcih is an III-defined problem.
Question # 9
P vs NP asks if
Question # 10
Why use real life tasks in algorithm learning.
Question # 11
What is the primary goal of algorithm design techniques.
Question # 12
Problems in NP and NP-hard are called.
Question # 13
Complexity class representing problesm solvable efficinetly by a deterministic alogrithm .
Question # 14
Why is tractability important.
Question # 15
Seach algorithm more efficinet for large datasets.
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 |
The statement ghat applies to unsolvable problem |
A.
They can be solved in polynomial time
B.
They cannot be solved by any alogorithm
C.
They are always in NP class
D.
They require exponetial time to solve |
| 2 |
How does bubble sort work |
A.
Select smallest and swap
B.
Swap adjacent if wrong
C.
Divide and merge
D.
Explore nodes level wise |
| 3 |
Problems in NP and NP-hard are called. |
A.
P
B.
BPP
C.
NP Complete
D.
Tractable |
| 4 |
When is Generate and Test best. |
A.
small prblem space
B.
Large problem space
C.
No testing needed
D.
No solutions exist |
| 5 |
How does Linear Search work. |
A.
Halve search interval
B.
Check each item one by oe
C.
Explore branch deeply
D.
Use queue for nodes |
| 6 |
NP hard problems are |
A.
Easy to solve
B.
Alway solvable
C.
As hard as NP problem
D.
In class P |
| 7 |
The characteristic of a well defined problem is. |
A.
Ambiguous goals and uncelear requirements
B.
Vegue processes and inputs
C.
Clear goas, inpus, processes, and oututs
D.
Undrined solutions |
| 8 |
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 |
| 9 |
What is role of algorithm in problem solving. |
A.
Gives steps
B.
Ignores logic
C.
Random process
D.
Blocks solutions |
| 10 |
How does Divide and conqurr work |
A.
Make local choices
B.
Break, sole, combine
C.
Store subproblem results
D.
Try all options, backtrack |
Test Questions