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 the height of a tree.

Question # 2

What is the purpose of the pop operation in a stack 

Question # 3

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

Question # 4

Which of the following is NOT a characteristic of a graph

Question # 5

Which of the following is an application of lists.

Question # 6

What is he degree of a vrtex in a graph.

Question # 7

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

Question # 8

What is the dequeue operatin ina queue.

Question # 9

Which principle does a queue follow.

Question # 10

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

Question # 11

What does abstraction mean in computing.

Question # 12

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

Question # 13

Which principle does a stack follow.

Question # 14

The opertion used to add an item to a queue

Question # 15

Which of the following best describes a tree.

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

Which of the following best describes primitive computational structures.

A.

Advanced tools

B.

Complex Algorithms

C.

Basic building blocks of computing

D.

High level data types

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 function used to add an item at the end of a list in Python.

A.

Append()

B.

Insert ()

C.

remove ()

D.

PoP ()

4

What is a stack.

A.

Add/remove at both ends

B.

Add /remove from the top

C.

Add front, remvoe back

D.

No specific order

5

How are lists created in Python.

A.

Using parentheses ( )

B.

Using sqquare brackets []

C.

Using curly braces {}

D.

Using angle brackets

6

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

A.

In order

B.

Post Order

C.

Pre order

D.

Level order

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

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

9

Which operation remvoe an itesm by tis value in a list

A.

Delete ()

B.

Remove()

C.

Pop ()

D.

Clear ()

10

In which structures can cycles exist.

A.

Graph

B.

Tree

C.

Stack

D.

Queue

Test Questions