.jpg)
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 space complexity measure.
Question # 2
Which alorithm finds node relationships in a graph.
Question # 3
What is computational problem.
Question # 4
Which of the following correctly describes a solvable problem.
Question # 5
Knowing if a problem is solvable hellps.
Question # 6
Whcih is an III-defined problem.
Question # 7
What is role of algorithm in problem solving.
Question # 8
Seach algorithm more efficinet for large datasets.
Question # 9
What is the main advantages of dynamic programming.
Question # 10
What is the purpose of search algorithms
Question # 11
What is the primary goal of algorithm design techniques.
Question # 12
Which is a Greedy Algorithm example
Question # 13
What is limitation Greedy algorithms
Question # 14
The characteristic of a well defined problem is.
Question # 15
When is Generate and Test best.
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 |
Why are commonly used algorithms important. |
A.
Reduce hrdware cost
B.
Solve common problems efficiently
C.
Remove need for data structures
D.
for theory only |
| 2 |
Which technique is used in Merge sort. |
A.
Greedy
B.
Divide and conqurer
C.
Dynaimc Programming
D.
Back tracking |
| 3 |
For which problems is Backtracing suitable. |
A.
Optimal substrcuture
B.
Explore all combinations
C.
ON optimal choice
D.
No overlapping problems |
| 4 |
How does Divide and conquere work. |
A.
Make local chices
B.
Break ,solve, combine
C.
Store subproblem results
D.
Try alloptions, backtrack |
| 5 |
What does space complexity measure. |
A.
Execution time
B.
Memory usage
C.
Number of steps
D.
Result accuracy |
| 6 |
What is the main advantage of Dynamic programming. |
A.
Avoid redundant work
B.
Locally optimal results
C.
Solve independent problems
D.
Explore alloptions |
| 7 |
What is generate and Test algorithm |
A.
Tests all options
B.
Picks one solution
C.
skips testing
D.
Uses no logic |
| 8 |
The Halting Problem is an example of. |
A.
Solvable problem
B.
Tractable prolem
C.
Unsolvable problem
D.
NP Complete problem |
| 9 |
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 |
| 10 |
What does “input” mean in a computational problem. |
A.
Result after processing
B.
Steps to solve
C.
Data at start
D.
Type of problem |
Test Questions