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 operation  remvoes an intem by its index in a list.

Question # 2

What is the dequeue opertion in a queue.

Question # 3

What is a stack.

Question # 4

The purpose of the inkeywrod used with a Pythonlist

Question # 5

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

Question # 6

How do primitives affect a system's capabilities.

Question # 7

Why are primitive computationl structures important in computer sciecne.

Question # 8

Which principle does a stack follow.

Question # 9

Which real life example follows the stack principle.

Question # 10

What is a leaf node.

Question # 11

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

Question # 12

True statemetn about the height of a tree.

Question # 13

Wha is a list in Python.

Question # 14

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

Question # 15

What is the purpose of the pop operation in a stack 

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

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

2

The opertion used to add an item to a queue

A.

Dequeue 

B.

Enqueue

C.

Remove

3

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

4

Which operation remvoe an itesm by tis value in a list

A.

Delete ()

B.

Remove()

C.

Pop ()

D.

Clear ()

5

Which real life example follows the stack principle.

A.

Ticket line

B.

Browser back button

C.

Music playlist

D.

Email inbox

6

What is the height of a tree.

A.

No of nodes

B.

Longest path 

C.

Memory used

D.

No of leaves

7

What does abstraction mean in computing.

A.

Hide data

B.

combine simple

C.

Parts into complex systems

D.

Use high level languages

8

In which structures can cycles exist.

A.

Graph

B.

Tree

C.

Stack

D.

Queue

9

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

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

Is this page helpful?