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
Which is an example of O (log n) comlexity.
Question # 2
Easy to verify but hard to solve problem are in.
Question # 3
An algorithm that sort data by stepping thourgh the list and swapping adjacent elements if needed is.
Question # 4
NP- complete matters because.
Question # 5
For which problems is Backtracing suitable.
Question # 6
Complexity class representing problesm solvable efficinetly by a deterministic alogrithm .
Question # 7
Whcih is a sorting algorithms.
Question # 8
Which diagram shows P, NO, NP-hard,NP Complete
Question # 9
The meanig of NP in computational complexity is.
Question # 10
What is generate and Test algorithm
Question # 11
What does page rank algorithm analyze.
Question # 12
The halting problem is.
Question # 13
How does Linear Search work.
Question # 14
What does time complexity measrue.
Question # 15
How does Backtracking work.
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 |
Complexity class representing problesm solvable efficinetly by a deterministic alogrithm . |
A.
P
B.
NP-Hard
C.
NP
D.
NP -Complete |
| 2 |
Why are commonly used algorithms important. |
A.
Reduce hardware cost
B.
Solve common Problems efficiently
C.
Remvoe need for data structure
D.
For theory only |
| 3 |
Easy to verify but hard to solve problem are in. |
A.
NP
B.
P
C.
NP hard
D.
Undecidable |
| 4 |
Problems in NP and NP-hard are called. |
A.
P
B.
BPP
C.
NP Complete
D.
Tractable |
| 5 |
How does selection sort work. |
A.
Swap adjacent
B.
Select minium form unsorted part
C.
Use quenue for nodes
D.
Store intermediate results |
| 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 does page rank algorithm analyze. |
A.
Page links
B.
page color
C.
Page size
D.
Page font |
| 8 |
What is role of algorithm in problem solving. |
A.
Gives steps
B.
Ignores logic
C.
Random process
D.
Blocks solutions |
| 9 |
What is the purpose of search algorithms |
A.
Arrange data
B.
Find secific data
C.
analyze nodes
D.
Save memory |
| 10 |
The halting problem is. |
A.
Solvable and tractable
B.
Unsolable and in P
C.
Unsolvable and not in NP
D.
NP Complete |
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