.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
Sovable problems differ becasue they.
Question # 2
Which notation shows the upper bound of time complexity.
Question # 3
Easy to verify but hard to solve problem are in.
Question # 4
What is the purpose of search algorithms
Question # 5
The meanig of NP in computational complexity is.
Question # 6
What is a key limitatio of Greedy Algorithms.
Question # 7
When is Generate and Test best.
Question # 8
NP hard problems are
Question # 9
What is the main advantages of dynamic programming.
Question # 10
What is limitation Greedy algorithms
Question # 11
Why use real life tasks in algorithm learning.
Question # 12
Which technique is used in Merge sort.
Question # 13
How does Backtracking work.
Question # 14
What is the primary goal of algorithm design techniques.
Question # 15
Knowing if a problem is solvable hellps.
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 |
Which technique is used in Merge sort. |
A.
Greedy
B.
Divide and conqurer
C.
Dynaimc Programming
D.
Back tracking |
| 2 |
What is the main advantages of dynamic programming. |
A.
Avoid redundant work
B.
Locally optimal results
C.
Solves independent problems
D.
Explore alloptions |
| 3 |
Which is an NP complete problem. |
A.
Sorting
B.
Knapsack
C.
GCD finding
D.
Binary search |
| 4 |
Problems in class P are solved in. |
A.
Exponentilal time
B.
Polynomial time
C.
Non determinaistic time
D.
Ifinite time |
| 5 |
How do BFS and DFS differ. |
A.
BFS Stack, DFS -queue
B.
BFS -level , DFS -depth
C.
BFS Sort, DFS-Search
D.
BFS always slower |
| 6 |
What is role of algorithm in problem solving. |
A.
Gives steps
B.
Ignores logic
C.
Random process
D.
Blocks solutions |
| 7 |
NP Problems can be |
A.
Solved in polynomial time
B.
Verified in polynomial time
C.
Solved in exponeitial timeonly
D.
Not verified |
| 8 |
Which notation shows the upper bound of time complexity. |
A.
Omega
B.
Theta
C.
Big O
D.
Lambda |
| 9 |
What does time complexity measrue. |
A.
Memory use
B.
Time growth with input
C.
Number of loops
D.
Output accuracy |
| 10 |
Which diagram shows P, NO, NP-hard,NP Complete |
A.
Bar chart
B.
Pie chart
C.
Venn diagram
D.
Lne graph |
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