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
Problems in class P are solved in.
Question # 2
Problems in NP and NP-hard are called.
Question # 3
Which is solved by Dynaimc programming.
Question # 4
What is the main advantage of Dynamic programming.
Question # 5
NP- complete matters because.
Question # 6
Tractable prolem canbe solved
Question # 7
The halting problem is.
Question # 8
How does Divide and conquere work.
Question # 9
What is generate and Test algorithm
Question # 10
What defines a Greedy algorithm
Question # 11
Which is an example of O (log n) comlexity.
Question # 12
An algorithm that sort data by stepping thourgh the list and swapping adjacent elements if needed is.
Question # 13
What is the primary goal of algorithm design techniques.
Question # 14
How does selection sort work.
Question # 15
What does “input” mean in a computational problem.
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 -
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 -
A Annas Amir 09 - Jan - 2025 01 Min 40 Sec 11/15
ICS Part 1 Computer Science (New Book) Chapter 3 Important MCQ's
| Sr.# | Question | Answer |
|---|---|---|
| 1 |
Which is an example of O (log n) comlexity. |
A.
Sorting numbers
B.
Pair comparison
C.
Binary search
D.
Linear search |
| 2 |
The halting problem is. |
A.
Solvable and tractable
B.
Unsolable and in P
C.
Unsolvable and not in NP
D.
NP Complete |
| 3 |
P vs NP asks if |
A.
Fast solutions are in NP
B.
Check complexity
C.
Debug rrors
D.
Improve hardware |
| 4 |
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 |
| 5 |
When is Generate and Test best. |
A.
small prblem space
B.
Large problem space
C.
No testing needed
D.
No solutions exist |
| 6 |
What is the main advantage of Dynamic Programming. |
A.
Avoid redundant work
B.
Locally optmal results
C.
Sole independent problems
D.
Explore all options |
| 7 |
What is the primary goal of algorithm design techniques. |
A.
Improve hardware
B.
Solve problems systematically
C.
Reduce imput size
D.
Debug software |
| 8 |
An algorithm with a time complexity of O(n log n): |
A.
Bubble sort
B.
Binary Search
C.
Merge Sort
D.
Insertion sort |
| 9 |
Why use real life tasks in algorithm learning. |
A.
Show steps in life
B.
Make it harder
C.
Reduce interest
D.
Add confusion |
| 10 |
For which problems is Backtrackign suitable. |
A.
Optimal substructure
B.
Explore all combinations
C.
One optimal choice
D.
No overlapping problems |
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