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
Whcih is a sorting algorithms.
Question # 2
What do sorting algorithm mainly do.
Question # 3
How does Divide and conquere work.
Question # 4
Which of the following correctly describes a solvable problem.
Question # 5
P vs NP asks if
Question # 6
What does “input” mean in a computational problem.
Question # 7
Which technique is used in Merge sort.
Question # 8
Which notation shows the upper bound of time complexity.
Question # 9
NP hard problems are
Question # 10
Which is solved by Dynamic Programming.
Question # 11
Why use real life tasks in algorithm learning.
Question # 12
Whcih is an III-defined problem.
Question # 13
How does selection sort work.
Question # 14
For which problems is Backtracing suitable.
Question # 15
Why is bubble sort not 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 |
What does “input” mean in a computational problem. |
A.
Result after processing
B.
Steps to solve
C.
Data at start
D.
Type of problem |
| 2 |
What do sorting algorithm mainly do. |
A.
Network routing
B.
Arrange data
C.
Find node links
D.
Search data |
| 3 |
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 |
| 4 |
What does space complexity measure. |
A.
Execution time
B.
Memory usage
C.
Number of steps
D.
Result accuracy |
| 5 |
How does selection sort work. |
A.
Swap adjacent
B.
Select minium form unsorted part
C.
Use quenue for nodes
D.
Store intermediate results |
| 6 |
What defines a Greedy algorithm |
A.
Explore all solutions
B.
Make best local choice
C.
Store results
D.
Divide problems |
| 7 |
What is limitation Greedy algorithms |
A.
Too complex
B.
Always optimal
C.
Not always optimal
D.
High memory use |
| 8 |
What is the main advantage of Dynamic Programming. |
A.
Avoid redundant work
B.
Locally optmal results
C.
Sole independent problems
D.
Explore all options |
| 9 |
Knowing if a problem is solvable hellps. |
A.
Increase complexity
B.
Save time
C.
Generate random output
D.
Avoid design |
| 10 |
Sovable problems differ becasue they. |
A.
Take exponential time
B.
Need better hardware
C.
Halt with a result
D.
Have no input |
Test Questions