First Year Computer Science Chapter 3 Online MCQ Test for 1st Year Computer Science Chapter 3 (Data Communication)

ICS Part 1 Computer Science Chapter 3 Test

Start Chapter 3 Test

ICS Part 1 Computer Science Chapter Wise Test

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

Problems in class P are solved in.

Question # 3

Knowing if a problem is solvable hellps.

Question # 4

Which problem gives yes /no answer.

Question # 5

Problems in NP and NP-hard are called.

Question # 6

What does “input” mean in a computational problem.

Question # 7

How does bubble sort work

Question # 8

Whcih is a sorting algorithms.

Question # 9

Whcih is an III-defined problem.

Question # 10

What is generate and Test algorithm

Question # 11

What is limitation Greedy algorithms

Question # 12

How does selection sort work.

Question # 13

Seach algorithm more efficinet for large datasets.

Question # 14

An algorithm with a time complexity of  O(n log n):

Question # 15

NP Problems can be

Prepare Complete Set Wise Chapter 3 "Computer Science Ics Part 1 Chapter 3 Online Test" MCQs Online With Answers


Topic Test

00:00
3rd Chapter

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
    Sibtain Iqbal 08 - Sep - 2026 02 Min 43 Sec 12/15

ICS Part 1 Computer Science (New Book) Chapter 3 Important MCQ's

Sr.# Question Answer
1

How does Linear Search work.

A.

Halve search interval

B.

Check each item one by oe

C.

Explore branch deeply

D.

Use queue for nodes

2

What is the main advantage of Dynamic Programming.

A.

Avoid redundant work

B.

Locally optmal results

C.

Sole independent problems

D.

Explore all options

3

What is role of algorithm in problem solving.

A.

Gives steps

B.

Ignores logic

C.

Random process

D.

Blocks solutions

4

Which alorithm finds node relationships in a graph.

A.

Bubble sort

B.

Linear Search 

C.

BFS

D.

Selection sort

5

What does page rank algorithm analyze.

A.

Page links

B.

page color

C.

Page size

D.

Page font

6

Knowing if a problem is solvable hellps.

A.

Increase complexity

B.

Save time

C.

Generate random output

D.

Avoid design

7

What do sorting algorithm mainly do.

A.

Network routing

B.

Arrange data

C.

Find node links

D.

Search data

8

Which is solved by dynamic programming.

A.

Coin change

B.

Fibonacci sequence

C.

Merge sort

D.

Puzzle solving

9

The Halting Problem is an example of.

A.

Solvable problem

B.

Tractable prolem

C.

Unsolvable problem

D.

NP Complete problem

10

Why is bubble sort not for large datasets.

A.

Needs more memory

B.

O (n2) time complexity

C.

Works on sorted data only

D.

Can't handle numbers

Test Questions