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

The purpose of the inkeywrod used with a Pythonlist

Question # 2

Which real life example follows the stack principle.

Question # 3

Wha is a list in Python.

Question # 4

Which type of grah has edges with direction.

Question # 5

Which node is the staring point of a tree.

Question # 6

How do primitives affect a system's capabilities.

Question # 7

What is a graph in data structures.

Question # 8

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

Question # 9

What is he degree of a vrtex in a graph.

Question # 10

What is a queue.

Question # 11

Which real life example represents an undirected graph.

Question # 12

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

Question # 13

What is the purpose of the pop operation in a stack 

Question # 14

True statemetn about the height of a tree.

Question # 15

Which of the following is an application of lists.

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
    Attia Sufyan 27 - Nov - 2024 01 Min 13 Sec 14/15

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

Sr.# Question Answer
1

How are lists created in Python.

A.

Using parentheses ( )

B.

Using sqquare brackets []

C.

Using curly braces {}

D.

Using angle brackets

2

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

3

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

A.

It deletes the last item

B.

It adds an item to the end of the list

C.

It sorts the list

D.

It creates a new list

4

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

5

The opertion used to add an item to a queue

A.

Dequeue 

B.

Enqueue

C.

Remove

6

Which node is the staring point of a tree.

A.

Leaf node

B.

Child node

C.

Root node

D.

Parent node

7

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

8

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

9

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

A.

Push

B.

Pop

C.

Peek

D.

Add

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?