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

NP hard problems are

Question # 2

How does Divide and conqurr work

Question # 3

Whcih is an III-defined problem.

Question # 4

How does Linear Search work.

Question # 5

What is generate and Test algorithm

Question # 6

Waht does O (n2) indicate.

Question # 7

What does “input” mean in a computational problem.

Question # 8

What does time complexity measrue.

Question # 9

What does page rank algorithm analyze.

Question # 10

Why are commonly used algorithms important.

Question # 11

For which problems is Backtracing suitable.

Question # 12

Problems in class P are solved in.

Question # 13

What is computational problem.

Question # 14

Tractable prolem canbe solved

Question # 15

What is the primary goal of algorithm design techniques.

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
  • 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
    Shumaila Riaz 13 - Dec - 2024 02 Min 57 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 role of algorithm in problem solving.

A.

Gives steps

B.

Ignores logic

C.

Random process

D.

Blocks solutions

2

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

3

What is the purpose of search algorithms

A.

Arrange data

B.

Find secific data

C.

analyze nodes

D.

Save memory

4

Tractable prolem canbe solved

A.

In exponential time

B.

Efficiently with large input

C.

With no algorithm

D.

Are always NP hard

5

Which of the following correctly describes a solvable problem.

A.

Cannot be solved

B.

Takes infinite time

C.

Soved by algorithm in finite time

D.

Has no input/output

6

NP hard problems are

A.

Easy to solve

B.

Alway solvable

C.

As hard as NP problem

D.

In class P

7

What is a key limitatio of Greedy Algorithms.

A.

Too complex

B.

Always optimal

C.

Not always optimal

D.

High memory use

8

When is Generate and Test best.

A.

small prblem space

B.

Large problem space

C.

No testing needed

D.

No solutions exist

9

How does Divide and conqurr work

A.

Make local choices

B.

Break, sole, combine

C.

Store subproblem results

D.

Try all options, backtrack

10

Problems in class P are solved in.

A.

Exponentilal time

B.

Polynomial time

C.

Non determinaistic time

D.

Ifinite time

Test Questions

Is this page helpful?