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

What is computational problem.

Question # 2

Which problem gives yes /no answer.

Question # 3

What defines a Greedy algorithm

Question # 4

What is the main advantages of dynamic programming.

Question # 5

Why are commonly used algorithms important.

Question # 6

P vs NP asks if

Question # 7

What is generate and Test algorithm

Question # 8

Easy to verify but hard to solve problem are in.

Question # 9

Knowing if a problem is solvable hellps.

Question # 10

The statement ghat applies to unsolvable problem 

Question # 11

What is limitation Greedy algorithms

Question # 12

Complexity class representing problesm solvable efficinetly by a deterministic alogrithm .

Question # 13

How does Backtracking work.

Question # 14

The halting problem is.

Question # 15

How does Backtracking work.

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

Which is solved by Dynamic Programming.

A.

Coin Change

B.

Fibonacci sequence

C.

Merge sort

D.

Puzzle solving

2

What do sorting algorithm mainly do.

A.

Network routing

B.

Arrange data

C.

Find node links

D.

Search data

3

What does space complexity measure.

A.

Execution time

B.

Memory usage

C.

Number of steps

D.

Result accuracy

4

An algorithm that sort data by stepping thourgh the list and swapping adjacent elements if needed is.

A.

Selection sort

B.

Quick sort

C.

Bubble sort

D.

Merge sort

5

What is generate and Test algorithm

A.

Tests all options

B.

Picks one solution

C.

skips testing

D.

Uses no logic

6

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

A.

Bubble sort

B.

Binary Search

C.

Merge Sort

D.

Insertion sort

7

NP hard problems are

A.

Easy to solve

B.

Alway solvable

C.

As hard as NP problem

D.

In class P

8

How does Backtracking work.

A.

Break into parts

B.

Build and Backtrack

C.

Store subproblems

D.

Make local choices

9

What is role of algorithm in problem solving.

A.

Gives steps

B.

Ignores logic

C.

Random process

D.

Blocks solutions

10

Whcih is a sorting algorithms.

A.

Linear search

B.

Qucik sort

C.

DFS

D.

BFS

Test Questions

Is this page helpful?