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
What does page rank algorithm analyze.
Question # 2
What is limitation Greedy algorithms
Question # 3
The Halting Problem is an example of.
Question # 4
How does selection sort work.
Question # 5
Which is an example of O (log n) comlexity.
Question # 6
Sovable problems differ becasue they.
Question # 7
The characteristic of a well defined problem is.
Question # 8
Which of the following correctly describes a solvable problem.
Question # 9
Tractable prolem canbe solved
Question # 10
What is the primary goal of algorithm design techniques.
Question # 11
Whcih is an III-defined problem.
Question # 12
Easy to verify but hard to solve problem are in.
Question # 13
The statement ghat applies to unsolvable problem
Question # 14
How does bubble sort work
Question # 15
Which is a Greedy Algorithm example
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 Shumaila Riaz 13 - Dec - 2024 02 Min 57 Sec 12/15
ICS Part 1 Computer Science (New Book) Chapter 3 Important MCQ's
| Sr.# | Question | Answer |
|---|---|---|
| 1 |
What is computational problem. |
A.
solved using algorithm
B.
Solved using creativity
C.
Has unclear input
D.
Has no process |
| 2 |
Why is tractability important. |
A.
Output color
B.
Language choice
C.
Solve efficiently
D.
Input type |
| 3 |
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 |
| 4 |
Which problem gives yes /no answer. |
A.
Search
B.
Decision
C.
Optimization
D.
Counting |
| 5 |
P vs NP asks if |
A.
Fast solutions are in NP
B.
Check complexity
C.
Debug rrors
D.
Improve hardware |
| 6 |
For which problems is Backtrackign suitable. |
A.
Optimal substructure
B.
Explore all combinations
C.
One optimal choice
D.
No overlapping problems |
| 7 |
Which is a Greedy Algorithm example |
A.
Fibonacci sequence
B.
Coin change
C.
Merge sort
D.
Puzzle solving |
| 8 |
Which of the following correctly describes a solvable problem. |
A.
Cannot be solved
B.
Takes infinite time
C.
Soved by algorithm in finite time
D.
Has no input/output |
| 9 |
What does space complexity measure. |
A.
Execution time
B.
Memory usage
C.
Number of steps
D.
Result accuracy |
| 10 |
How does bubble sort work |
A.
Select smallest and swap
B.
Swap adjacent if wrong
C.
Divide and merge
D.
Explore nodes level wise |
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