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 principle does a stack follow.

Question # 2

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

Question # 3

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

Question # 4

What is a stack.

Question # 5

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

Question # 6

How do primitives affect a system's capabilities.

Question # 7

True statemetn about the height of a tree.

Question # 8

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

Question # 9

What is a graph in data structures.

Question # 10

How are lists created in Python.

Question # 11

What is the purpose of the pop operation in a stack 

Question # 12

Which type of grah has edges with direction.

Question # 13

What is the enqueue operation in a queue.

Question # 14

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

Question # 15

What is he degree of a vrtex in 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
  • 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
  • A
    Alyaan Shahbaz 30 - Nov - 2024 01 Min 33 Sec 14/15

ICS Part 1 Computer Science (New Book) Chapter 4 Important MCQ's

Sr.# Question Answer
1

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

2

What is a tree in data structures.  

A.

Linear data

B.

Math function 

C.

Hiearchical structure

D.

Loop

3

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

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

Which of the following is an application of lists.

A.

Storing a single number

B.

Implementing stacks and queues

C.

Creating images

D.

Playing music

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

8

Which real life example follows the stack principle.

A.

Ticket line

B.

Browser back button

C.

Music playlist

D.

Email inbox

9

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

A.

Trees have cycles

B.

Trees have many path

C.

Trees have root ; graph may not

D.

Trees are more flexible

10

The opertion used to add an item to a queue

A.

Dequeue 

B.

Enqueue

C.

Remove

Test Questions

Is this page helpful?