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
How are lists created in Python.
Question # 3
Which traversal is used for beacking up files in a directory.
Question # 4
Which of the following best describes primitive computational structures.
Question # 5
The opertion used to add an item to a queue
Question # 6
The function used to add an item at the end of a list in Python.
Question # 7
Why are primitive computationl structures important in computer sciecne.
Question # 8
Which operation remvoes an item by its value in a list.
Question # 9
Which operation remvoe an itesm by tis value in a list
Question # 10
Which type of grah has edges with direction.
Question # 11
Which of the following is NOT a characteristic of a graph
Question # 12
What is a stack.
Question # 13
Which of the following best describes a tree.
Question # 14
Which of the following is a difference between trees and graphs.
Question # 15
Which principle does a queue follow.
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 |
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 |
| 2 |
What is a tree in data structures. |
A.
Linear data
B.
Math function
C.
Hiearchical structure
D.
Loop |
| 3 |
The opertion used to add an item to a queue |
A.
Dequeue
B.
Enqueue
C.
Remove |
| 4 |
The function used to add an item at the end of a list in Python. |
A.
Append()
B.
Insert ()
C.
remove ()
D.
PoP () |
| 5 |
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 |
| 6 |
Which operation remvoe an itesm by tis value in a list |
A.
Delete ()
B.
Remove()
C.
Pop ()
D.
Clear () |
| 7 |
Whcih keyword checks if an item exists in alist |
A.
In
B.
for
C.
if
D.
exists |
| 8 |
An operation that remvoes an item from the top of the stack |
A.
Push
B.
Pop
C.
Peek
D.
Add |
| 9 |
Which real life example follows the stack principle. |
A.
Ticket line
B.
Browser back button
C.
Music playlist
D.
Email inbox |
| 10 |
Which principle does a queue follow. |
A.
LIFO
B.
FIFO
C.
FILO
D.
Random access |
Test Questions