Home
News
Colleges
Courses
Admission
Lectures
Online Test
Past Papers
Date Sheets
Results
Study Abroad
Jobs
Tutors
More
Apps
.gif)
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 halting problem is.
Question # 2
Which is solved by dynamic programming.
Question # 3
Tractable prolem canbe solved
Question # 4
What does space complexity measure.
Question # 5
What is the primary goal of algorithm design techniques.
Question # 6
Which technique is used in Merge sort.
Question # 7
The characteristic of a well defined problem is.
Question # 8
How does bubble sort work
Question # 9
NP Problems can be
Question # 10
What is outpout when checking if 8 is even.
Question # 11
Complexity class representing problesm solvable efficinetly by a deterministic alogrithm .
Question # 12
What is the purpose of search algorithms
Question # 13
Knowing if a problem is solvable hellps.
Question # 14
Why are commonly used algorithms important.
Question # 15
An algorithm with a time complexity of O(n log n):
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 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 |
What does page rank algorithm analyze. |
A.
Page links
B.
page color
C.
Page size
D.
Page font |
| 2 |
Sovable problems differ becasue they. |
A.
Take exponential time
B.
Need better hardware
C.
Halt with a result
D.
Have no input |
| 3 |
What does space complexity measure. |
A.
Execution time
B.
Memory usage
C.
Number of steps
D.
Result accuracy |
| 4 |
The meanig of NP in computational complexity is. |
A.
Non deterministic polynomial time
B.
Negative polynomial time
C.
No trivial polynomial time
D.
Numerical polynomial time |
| 5 |
What is role of algorithm in problem solving. |
A.
Gives steps
B.
Ignores logic
C.
Random process
D.
Blocks solutions |
| 6 |
What does time complexity measrue. |
A.
Memory use
B.
Time growth with input
C.
Number of loops
D.
Output accuracy |
| 7 |
Waht does O (n2) indicate. |
A.
Linear growth
B.
Constant time
C.
Square of input
D.
Logarithmic growth |
| 8 |
Knowing if a problem is solvable hellps. |
A.
Increase complexity
B.
Save time
C.
Generate random output
D.
Avoid design |
| 9 |
P vs NP asks if |
A.
Fast solutions are in NP
B.
Check complexity
C.
Debug rrors
D.
Improve hardware |
| 10 |
If P= NP ,this means |
A.
Some NP unsolvable
B.
all NP solvable inpolynomial time
C.
All NP unsolvable
D.
Same space complexity |
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