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

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

Question # 2

What is he degree of a vrtex in a graph.

Question # 3

What is the enqueue operation in a queue.

Question # 4

What is the height of a tree.

Question # 5

Which of the following is NOT a characteristic of a graph

Question # 6

What is a leaf node.

Question # 7

How do primitives affect a system's capabilities.

Question # 8

Which of the following best describes primitive computational structures.

Question # 9

Which of the following is NOT a primitive computational structure.

Question # 10

How are lists created in Python.

Question # 11

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

Question # 12

What is the purpose of the pop operation in a stack 

Question # 13

Which real life example follows the stack principle.

Question # 14

Which operation remvoes an item by its value in a list.

Question # 15

What is a graph in data structures.

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


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
  • Z
    Zeeshan Shahid 27 - Nov - 2024 01 Min 01 Sec 15/15
  • F
    Fajar Hameed 06 - Dec - 2024 01 Min 05 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
  • R
    Rehman Nohri 28 - Nov - 2024 02 Min 43 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
Sr. # Question Answer
1

What is a queue.

A.

Add/remvoe from top

B.

Add/remvoe from both ends

C.

Add at back , remvoe form front

D.

Store items randomly

2

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

3

The opertion used to add an item to a queue

A.

Dequeue 

B.

Enqueue

C.

Remove

4

Which real life example represents an undirected graph.

A.

Twitter followers

B.

Facebook friendships

C.

On way streets

D.

Email spam links

5

Which operation remvoe an itesm by tis value in a list

A.

Delete ()

B.

Remove()

C.

Pop ()

D.

Clear ()

6

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

A.

Remvoe teh bottom item

B.

Add an item to the top

C.

Search for an item

D.

Sort the stack

7

What is the dequeue opertion in a queue.

A.

Removing an item formt he front

B.

Additing an item to the back

C.

Sorthing the queue

D.

Copying the queue

8

How are lists created in Python.

A.

Using parentheses ( )

B.

Using sqquare brackets []

C.

Using curly braces {}

D.

Using angle brackets

9

In which structures can cycles exist.

A.

Graph

B.

Tree

C.

Stack

D.

Queue

10

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

A.

Pop()

B.

delete ()

C.

Remove()

D.

clear ()

11

What is a graph in data structures.

A.

A linear structure

B.

A hierachiecal structure

C.

A set of vertices connected by edges.

D.

A type of array

12

Which principle does a queue follow.

A.

LIFO

B.

FIFO

C.

FILO

D.

Random access

13

True statemetn about the height of a tree.

A.

Number of edges fromt he root to the deepest node

B.

Number of nodes from the root to the deepest node

C.

Number of children of the root node

D.

Always equal to the number of nodes in the tree

14

An  operation that remvoes an item from the top of the stack

A.

Push

B.

Pop

C.

Peek

D.

Add

15

Which type of grah has edges with direction.

A.

Undirected graph

B.

Directed graph

C.

Weighted graph

D.

Binary graph

Test Questions

Is this page helpful?