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 that sort data by stepping thourgh the list and swapping adjacent elements if needed is.
Question # 2
How does Linear Search work.
Question # 3
P vs NP asks if
Question # 4
Seach algorithm more efficinet for large datasets.
Question # 5
Which diagram shows P, NO, NP-hard,NP Complete
Question # 6
Problems in NP and NP-hard are called.
Question # 7
What is a key limitatio of Greedy Algorithms.
Question # 8
NP Problems can be
Question # 9
Knowing if a problem is solvable hellps.
Question # 10
How does Divide and conquere work.
Question # 11
A seenario where Dynaimic progrmming proves most useful
Question # 12
For which problems is Backtrackign suitable.
Question # 13
What does space complexity measure.
Question # 14
How does Linear search work
Question # 15
If P= NP ,this means
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 |
Tractable prolem canbe solved |
A.
In exponential time
B.
Efficiently with large input
C.
With no algorithm
D.
Are always NP hard |
| 2 |
Problems in NP and NP-hard are called. |
A.
P
B.
BPP
C.
NP Complete
D.
Tractable |
| 3 |
Complexity class representing problesm solvable efficinetly by a deterministic alogrithm . |
A.
P
B.
NP-Hard
C.
NP
D.
NP -Complete |
| 4 |
Why use real life tasks in algorithm learning. |
A.
Show steps in life
B.
Make it harder
C.
Reduce interest
D.
Add confusion |
| 5 |
Easy to verify but hard to solve problem are in. |
A.
NP
B.
P
C.
NP hard
D.
Undecidable |
| 6 |
What does space complexity measure. |
A.
Execution time
B.
Memory usage
C.
Number of steps
D.
Result accuracy |
| 7 |
How does Divide and conquere work. |
A.
Make local chices
B.
Break ,solve, combine
C.
Store subproblem results
D.
Try alloptions, backtrack |
| 8 |
What does time complexity measrue. |
A.
Memory use
B.
Time growth with input
C.
Number of loops
D.
Output accuracy |
| 9 |
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 |
| 10 |
How does selection sort work. |
A.
Swap adjacent
B.
Select minium form unsorted part
C.
Use quenue for nodes
D.
Store intermediate results |
Test Questions
Share your comments & questions here
Haseeb Sajid
29 Mar 2024very helpful app for mcq s preparation please also give short question here of all subjects as a test base
Guest User
17 Oct 2019Shehzad khan
Muhammad Awais
17 Apr 2019GIVE SOME IMPORTANT QUESTION ABOUT TODAY PAPER
sohaib
21 Nov 2017Very helpful
babar ali
23 May 2017Can anyone beat me