.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
An algorithm with a time complexity of O(n log n):
Question # 2
How does Backtracking work.
Question # 3
Which of the following correctly describes a solvable problem.
Question # 4
How does selection sort work.
Question # 5
NP hard problems are
Question # 6
If P= NP ,this means
Question # 7
Problems in class P are solved in.
Question # 8
Waht does O (n2) indicate.
Question # 9
An algorithm that sort data by stepping thourgh the list and swapping adjacent elements if needed is.
Question # 10
Which is an NP complete problem.
Question # 11
For which problems is Backtrackign suitable.
Question # 12
How does Divide and conquere work.
Question # 13
What does space complexity measure.
Question # 14
Why is tractability important.
Question # 15
Why use real life tasks in algorithm learning.
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 |
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 |
| 2 |
Which is a Greedy Algorithm example |
A.
Fibonacci sequence
B.
Coin change
C.
Merge sort
D.
Puzzle solving |
| 3 |
What is the main advantage of Dynamic Programming. |
A.
Avoid redundant work
B.
Locally optmal results
C.
Sole independent problems
D.
Explore all options |
| 4 |
Tractability depends on |
A.
Inputs
B.
Complexity
C.
Outputs
D.
Algorthm type |
| 5 |
For which problems is Backtrackign suitable. |
A.
Optimal substructure
B.
Explore all combinations
C.
One optimal choice
D.
No overlapping problems |
| 6 |
Whcih is an III-defined problem. |
A.
Check even number
B.
Find shortest path
C.
Reduce poverty
D.
Count book arrangements |
| 7 |
An algorithm with a time complexity of O(n log n): |
A.
Bubble sort
B.
Binary Search
C.
Merge Sort
D.
Insertion sort |
| 8 |
Whcih is a sorting algorithms. |
A.
Linear search
B.
Qucik sort
C.
DFS
D.
BFS |
| 9 |
Easy to verify but hard to solve problem are in. |
A.
NP
B.
P
C.
NP hard
D.
Undecidable |
| 10 |
Waht does O (n2) indicate. |
A.
Linear growth
B.
Constant time
C.
Square of input
D.
Logarithmic growth |
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