Home
News
Colleges
Courses
Admission
Lectures
Online Test
Past Papers
Date Sheets
Results
Study Abroad
Jobs
Tutors
More
Apps
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 node is the staring point of a tree.
Question # 2
What does abstraction mean in computing.
Question # 3
What is the purpose of the pop operation in a stack
Question # 4
Which type of grah has edges with direction.
Question # 5
Wha is a list in Python.
Question # 6
How do primitives affect a system's capabilities.
Question # 7
Which operation remvoes an intem by its index in a list.
Question # 8
The function used to add an item at the end of a list in Python.
Question # 9
Which traversal is used for beacking up files in a directory.
Question # 10
A scenario where a graph data structure is most suitable.
Question # 11
Which real life example represents an undirected graph.
Question # 12
What is the dequeue operatin ina queue.
Question # 13
The purpose of the inkeywrod used with a Pythonlist
Question # 14
How are lists created in Python.
Question # 15
Which is the purpose of the push operation in a stack.
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 he degree of a vrtex in a graph. |
A.
The numebr of loops
B.
The number of edges connected to it
C.
The total numebrof vertices
D.
The weight of the vertex |
| 2 |
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 |
| 3 |
If you have a list f{Apple"banana". “cherry ”}ruits = I " what is fruit (1) |
A.
Apple
B.
Banana
C.
Cherry
D.
Error |
| 4 |
Which type of grah has edges with direction. |
A.
Undirected graph
B.
Directed graph
C.
Weighted graph
D.
Binary graph |
| 5 |
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 |
| 6 |
Which principle does a queue follow. |
A.
LIFO
B.
FIFO
C.
FILO
D.
Random access |
| 7 |
Which real life example represents an undirected graph. |
A.
Twitter followers
B.
Facebook friendships
C.
On way streets
D.
Email spam links |
| 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 |
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 |
| 10 |
The function used to add an item at the end of a list in Python. |
A.
Append()
B.
Insert ()
C.
remove ()
D.
PoP () |
Test Questions
Share your comments & questions here
Muhammad Tariq
23 May 2026Which traversal is used for beacking up files in a directory.
Babar ali
25 May 201715/15 yahoooo......faisalabadi always best