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 of the following is NOT a primitive computational structure.

Question # 2

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

Question # 3

Which type of grah has edges with direction.

Question # 4

What is a graph in data structures.

Question # 5

What is the purpose of the pop operation in a stack 

Question # 6

In which structures can cycles exist.

Question # 7

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

Question # 8

True statemetn about the height of a tree.

Question # 9

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

Question # 10

What is the enqueue operation in a queue.

Question # 11

The opertion used to add an item to a queue

Question # 12

What hapens when you use the append () method on a list.

Question # 13

Why are primitive computationl structures important in computer sciecne.

Question # 14

Whcih keyword checks if an item exists in alist

Question # 15

Which of the following is NOT a characteristic of a graph

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 tree in data structures.  

A.

Linear data

B.

Math function 

C.

Hiearchical structure

D.

Loop

2

What is the height of a tree.

A.

No of nodes

B.

Longest path 

C.

Memory used

D.

No of leaves

3

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

4

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

5

The opertion used to add an item to a queue

A.

Dequeue 

B.

Enqueue

C.

Remove

6

The purpose of the inkeywrod used with a Pythonlist

A.

Add an item to the list

B.

Remvoes an itemfrom the list

C.

Cheeks if an item exists int he list

D.

Returns the length of the list

7

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

A.

Pop()

B.

delete ()

C.

Remove()

D.

clear ()

8

In which structures can cycles exist.

A.

Graph

B.

Tree

C.

Stack

D.

Queue

9

Why are primitive computationl structures important in computer sciecne.

A.

They reduce memory

B.

They for all software

C.

Only for web dev

D.

Increase hardware cost

10

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

Test Questions