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 is a Greedy Algorithm example

Question # 2

What is role of algorithm in problem solving.

Question # 3

Which is solved by Dynaimc programming.

Question # 4

Tractable prolem canbe solved

Question # 5

How does selection sort work.

Question # 6

The halting problem is.

Question # 7

What is the primary goal of algorithm design techniques.

Question # 8

Why are commonly used algorithms important.

Question # 9

How does Backtracking work.

Question # 10

What is the main advantages of dynamic programming.

Question # 11

A seenario where Dynaimic progrmming proves most useful 

Question # 12

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

Question # 13

How does bubble sort work

Question # 14

What is the main advantage of Dynamic programming.

Question # 15

Complexity class representing problesm solvable efficinetly by a deterministic alogrithm .

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
    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

For which problems is Backtracking suitable

A.

Optimal substrcuture

B.

Explore all combnations

C.

ONe optimal choice

D.

No overlapping problems

2

How does Linear search work

A.

Halve search interval

B.

Check each item one by one

C.

Explore branch deeply

D.

Use queue for nodes

3

What is the purpose of search algorithms

A.

Arrange data

B.

Find secific data

C.

analyze nodes

D.

Save memory

4

How does bubble sort work

A.

Select smallest and swap

B.

Swap adjacent if wrong

C.

Divide and merge

D.

Explore nodes level wise

5

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

6

What does “input” mean in a computational problem.

A.

Result after processing

B.

Steps to solve

C.

Data at start

D.

Type of problem

7

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

8

What is the primary goal of algorithm design techniques.

A.

Improve hardware

B.

Solve problems systematically

C.

Reduce imput size

D.

Debug software

9

What is the main advantages of dynamic programming.

A.

Avoid redundant work

B.

Locally optimal results

C.

Solves independent problems

D.

Explore alloptions

10

When is Generate and Test best.

A.

small prblem space

B.

Large problem space

C.

No testing needed

D.

No solutions exist

Test Questions

Share your comments & questions here

Guest
  • Haseeb Sajid

    Haseeb Sajid

    29 Mar 2024

    very helpful app for mcq s preparation please also give short question here of all subjects as a test base

    Like
    Reply
  • Guest User

    Guest User

    17 Oct 2019

    Shehzad khan

    Like
    Reply
  • Muhammad Awais

    Muhammad Awais

    17 Apr 2019

    GIVE SOME IMPORTANT QUESTION ABOUT TODAY PAPER

    Like
    Reply
  • sohaib

    sohaib

    21 Nov 2017

    Very helpful

    Like
    Reply
  • babar ali

    babar ali

    23 May 2017

    Can anyone beat me

    Like
    Reply