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
Which of the following correctly describes a solvable problem.
Question # 2
How does Divide and conqurr work
Question # 3
Waht does O (n2) indicate.
Question # 4
How does Backtracking work.
Question # 5
Which is solved by Dynaimc programming.
Question # 6
Which alorithm finds node relationships in a graph.
Question # 7
What do sorting algorithm mainly do.
Question # 8
The statement ghat applies to unsolvable problem
Question # 9
How does Backtracking work.
Question # 10
What is a key limitatio of Greedy Algorithms.
Question # 11
What is limitation Greedy algorithms
Question # 12
What defines a Greedy algorithm
Question # 13
Which notation shows the upper bound of time complexity.
Question # 14
Which is an example of O (log n) comlexity.
Question # 15
NP- complete matters because.
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 -
T Toqeer Ahmad 16 - May - 2026 01 Min 10 Sec 14/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 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 is outpout when checking if 8 is even. |
A.
Found at 2
B.
Even
C.
Odd
D.
Yes |
| 2 |
Which is an example of O (log n) comlexity. |
A.
Sorting numbers
B.
Pair comparison
C.
Binary search
D.
Linear search |
| 3 |
What does page rank algorithm analyze. |
A.
Page links
B.
page color
C.
Page size
D.
Page font |
| 4 |
Why is tractability important. |
A.
Output color
B.
Language choice
C.
Solve efficiently
D.
Input type |
| 5 |
An algorithm with a time complexity of O(n log n): |
A.
Bubble sort
B.
Binary Search
C.
Merge Sort
D.
Insertion sort |
| 6 |
What is the primary goal of algorithm design techniques. |
A.
Imporve hardware
B.
Sovle problems systematically
C.
Reduce input size
D.
Debug software |
| 7 |
A seenario where Dynaimic progrmming proves most useful |
A.
Problem withou overlapping sub problems
B.
Problems solved by making local choices
C.
Problems with overlapping sub problems and optimal sbstructure
D.
Problem divided into independent sub problems |
| 8 |
Which technique is used in Merge sort. |
A.
Greedy
B.
Divide and conqurer
C.
Dynaimc Programming
D.
Back tracking |
| 9 |
Problems in class P are solved in. |
A.
Exponentilal time
B.
Polynomial time
C.
Non determinaistic time
D.
Ifinite time |
| 10 |
P vs NP asks if |
A.
Fast solutions are in NP
B.
Check complexity
C.
Debug rrors
D.
Improve hardware |
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