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

Wha is a list in Python.

Question # 4

Which of the following best describes primitive computational structures.

Question # 5

The function used to add an item at the end of a list in Python.

Question # 6

What is the dequeue opertion in a queue.

Question # 7

What is the dequeue operatin ina queue.

Question # 8

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

Question # 9

What is a leaf node.

Question # 10

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

Question # 11

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

Question # 12

In which structures can cycles exist.

Question # 13

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

Question # 14

What is the enqueue operation in a queue.

Question # 15

Which real life example follows the stack principle.

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

What is a leaf node.

A.

A node with many children

B.

A node with one child

C.

A node with no children

D.

A node with no parent

2

What is a tree in data structures.  

A.

Linear data

B.

Math function 

C.

Hiearchical structure

D.

Loop

3

Wha is a list in Python.

A.

Unordered items

B.

Changeable sequence

C.

Print function 

D.

Loop type

4

Which of the following is NOT a primitive computational structure.

A.

integers

B.

Loops

C.

Artificial intelligence

D.

Boolean values

5

Which principle does a queue follow.

A.

LIFO

B.

FIFO

C.

FILO

D.

Random access

6

The function used to add an item at the end of a list in Python.

A.

Append()

B.

Insert ()

C.

remove ()

D.

PoP ()

7

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

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

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

Test Questions