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 real life example represents an undirected graph.

Question # 2

Which type of grah has edges with direction.

Question # 3

What does abstraction mean in computing.

Question # 4

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

Question # 5

Whcih keyword checks if an item exists in alist

Question # 6

The purpose of the inkeywrod used with a Pythonlist

Question # 7

Which real life example follows the stack principle.

Question # 8

Which node is the staring point of a tree.

Question # 9

What is the height of a tree.

Question # 10

True statemetn about the height of a tree.

Question # 11

Which of the following is NOT a primitive computational structure.

Question # 12

Why are primitive computationl structures important in computer sciecne.

Question # 13

Which principle does a stack follow.

Question # 14

What is a leaf node.

Question # 15

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

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 type of grah has edges with direction.

A.

Undirected graph

B.

Directed graph

C.

Weighted graph

D.

Binary graph

2

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

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

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

5

Which principle does a stack follow.

A.

FIFO

B.

LIFO

C.

FILO

D.

LILO

6

Which of the following is NOT a primitive computational structure.

A.

integers

B.

Loops

C.

Artificial intelligence

D.

Boolean values

7

A scenario where a graph data structure is most suitable.

A.

Managng a to do list

B.

Modeling a line of customers in a store 

C.

Representing connections in a social network 

D.

All of the above

8

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

9

Wha is a list in Python.

A.

Unordered items

B.

Changeable sequence

C.

Print function 

D.

Loop type

10

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

Test Questions