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

Easy to verify but hard to solve problem are in.

Question # 2

P vs NP asks if

Question # 3

Which is solved by Dynamic Programming.

Question # 4

Seach algorithm more efficinet for large datasets.

Question # 5

How does Divide and conqurr work

Question # 6

Whcih is an III-defined problem.

Question # 7

The characteristic of a well defined problem is.

Question # 8

What is generate and Test algorithm

Question # 9

How does Backtracking work.

Question # 10

Which diagram shows P, NO, NP-hard,NP Complete

Question # 11

What is the main advantages of dynamic programming.

Question # 12

What is outpout when checking if 8 is even.

Question # 13

What is computational problem.

Question # 14

Why are commonly used algorithms important.

Question # 15

Why is tractability important.

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

The halting problem is.

A.

Solvable and tractable

B.

Unsolable and in P

C.

Unsolvable and not in NP

D.

NP Complete

2

Tractable prolem canbe solved

A.

In exponential time

B.

Efficiently with large input

C.

With no algorithm

D.

Are always NP hard

3

What defines a Greedy algorithm

A.

Explore all solutions

B.

Make best local choice

C.

Store results

D.

Divide problems

4

How does selection sort work.

A.

Swap adjacent

B.

Select minium form unsorted part

C.

Use quenue for nodes

D.

Store intermediate results

5

What does page rank algorithm analyze.

A.

Page links

B.

page color

C.

Page size

D.

Page font

6

What is outpout when checking if 8 is even.

A.

Found at 2

B.

Even

C.

Odd

D.

Yes

7

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

8

Whcih is an III-defined problem.

A.

Check even number

B.

Find shortest path

C.

Reduce poverty

D.

Count book arrangements

9

Problems in class P are solved in.

A.

Exponentilal time

B.

Polynomial time

C.

Non determinaistic time

D.

Ifinite time

10

What does “input” mean in a computational problem.

A.

Result after processing

B.

Steps to solve

C.

Data at start

D.

Type of problem

Test Questions