First Year Computer Science Chapter 4 Online MCQ Test for 1st Year Computer Science Chapter 4 (Applications and Uses of Computer)

ICS Part 1 Computer Science Chapter 4 Test

Start Chapter 4 Test

ICS Part 1 Computer Science Chapter Wise Test

MCQ's Test For Chapter 4 "Computer Science Ics Part 1 Chapter 4 Online Test"

Try The MCQ's Test For Chapter 4 "Computer Science Ics Part 1 Chapter 4 Online Test"

  • Total Questions15

  • Time Allowed20

Computer Science Ics Part 1 Chapter 4 Online Test

00:00
Question # 1

What is he degree of a vrtex in a graph.

Question # 2

Which principle does a stack follow.

Question # 3

A scenario where a graph data structure is most suitable.

Question # 4

The purpose of the inkeywrod used with a Pythonlist

Question # 5

Which is the purpose of the push operation in a stack.

Question # 6

What does abstraction mean in computing.

Question # 7

Which of the following is NOT a characteristic of a graph

Question # 8

What is the dequeue opertion in a queue.

Question # 9

Which of the following best describes primitive computational structures.

Question # 10

Which traversal is used for beacking up files in a directory.

Question # 11

Which real life example represents an undirected graph.

Question # 12

Which type of grah has edges with direction.

Question # 13

The opertion used to add an item to a queue

Question # 14

Which of the following is a difference between trees and graphs.

Question # 15

What is a leaf node.

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


Topic Test

00:00
4th Chapter

11th Class ICS Computer Science Chapter 4 MCQ's Test

Top Scorers Of Chapter 4 "Computer Science Ics Part 1 Chapter 4 Online Test" MCQ`s Test

  • H
    Hafiz Ali Hassan 19 - Dec - 2024 00 Min 09 Sec 15/15
  • 2
    24P-0510 Abdul Mueez 09 - Dec - 2024 00 Min 15 Sec 15/15
  • S
    sallu khan 06 - Jan - 2025 00 Min 33 Sec 15/15
  • F
    Fajar Hameed 06 - Dec - 2024 01 Min 05 Sec 15/15
  • T
    Toqeer Ahmad 16 - May - 2026 01 Min 10 Sec 15/15
  • A
    Abubakar 07 - Dec - 2024 01 Min 20 Sec 15/15
  • M
    MUBASHIR HUSSAIN 06 - Dec - 2024 01 Min 28 Sec 15/15
  • I
    Iqra Amjad 21 - Dec - 2024 01 Min 30 Sec 15/15
  • H
    Hamza Shykh 10 - Dec - 2024 01 Min 31 Sec 15/15
  • R
    Rabeeha Piracha 15 - Dec - 2024 01 Min 47 Sec 15/15
  • A
    Awais Mughal 12 - Dec - 2024 01 Min 57 Sec 15/15
  • S
    Saim Yousaf 21 - Dec - 2024 02 Min 22 Sec 15/15
  • S
    Shumaila Riaz 13 - Dec - 2024 05 Min 11 Sec 15/15
  • T
    Taqdees Kiani 08 - Dec - 2024 01 Min 11 Sec 14/15
  • S
    Sheikh Umer 02 - May - 2026 01 Min 31 Sec 14/15

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

Sr.# Question Answer
1

How do primitives affect a system's capabilities.

A.

Make program look better

B.

Decide what and how fast it computes

C.

Control internet speed

D.

Improve graphics

2

Which node is the staring point of a tree.

A.

Leaf node

B.

Child node

C.

Root node

D.

Parent node

3

Which traversal is used for beacking up files in a directory.

A.

In order

B.

Post Order

C.

Pre order

D.

Level order

4

Which of the following is an application of lists.

A.

Storing a single number

B.

Implementing stacks and queues

C.

Creating images

D.

Playing music

5

If you have a list f{Apple"banana". “cherry ”}ruits = I " what is fruit (1)

A.

Apple

B.

Banana

C.

Cherry

D.

Error

6

What is the purpose of the pop operation in a stack 

A.

Add an item to the top

B.

Remove the top item

C.

Count the numebr of items

D.

Print the stack

7

Which operation  remvoes an intem by its index in a list.

A.

Pop()

B.

delete ()

C.

Remove()

D.

clear ()

8

Which type of grah has edges with direction.

A.

Undirected graph

B.

Directed graph

C.

Weighted graph

D.

Binary graph

9

A scenario where a graph data structure is most suitable.

A.

Managng a to do list

B.

Modeling a line of customers in a store 

C.

Representing connections in a social network 

D.

All of the above

10

What is the height of a tree.

A.

No of nodes

B.

Longest path 

C.

Memory used

D.

No of leaves

Test Questions