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

In which structures can cycles exist.

Question # 3

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

Question # 4

Why are primitive computationl structures important in computer sciecne.

Question # 5

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

Question # 6

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

Question # 7

Which of the following best describes a tree.

Question # 8

What is the enqueue operation in a queue.

Question # 9

What is the dequeue opertion in a queue.

Question # 10

What does abstraction mean in computing.

Question # 11

What is a leaf node.

Question # 12

What is the height of a tree.

Question # 13

The purpose of the inkeywrod used with a Pythonlist

Question # 14

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

Question # 15

The opertion used to add an item to a queue

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 queue.

A.

Add/remvoe from top

B.

Add/remvoe from both ends

C.

Add at back , remvoe form front

D.

Store items randomly

2

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

3

What is a tree in data structures.  

A.

Linear data

B.

Math function 

C.

Hiearchical structure

D.

Loop

4

How are lists created in Python.

A.

Using parentheses ( )

B.

Using sqquare brackets []

C.

Using curly braces {}

D.

Using angle brackets

5

What is the dequeue operatin ina queue.

A.

Adding an item to th eback

B.

Remoiving an item fromt he fornt

C.

Sorting the queue

D.

Copying the queue

6

What is the enqueue operation in a queue.

A.

Removeing an item from the front

B.

Printing the queue

C.

Adding an item to the back

D.

Searchign for an item

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

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

A.

Append()

B.

Insert ()

C.

remove ()

D.

PoP ()

9

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

A.

Apple

B.

Banana

C.

Cherry

D.

Error

10

Which principle does a queue follow.

A.

LIFO

B.

FIFO

C.

FILO

D.

Random access

Test Questions