Home
News
Colleges
Courses
Admission
Lectures
Online Test
Past Papers
Date Sheets
Results
Study Abroad
Jobs
Tutors
More
Apps
.jpg)
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 remvoe an itesm by tis value in a list
Question # 2
Which operation remvoes an item by its value in a list.
Question # 3
Which of the following best describes a tree.
Question # 4
What is he degree of a vrtex in a graph.
Question # 5
What is the dequeue opertion in a queue.
Question # 6
The purpose of the inkeywrod used with a Pythonlist
Question # 7
What hapens when you use the append () method on a list.
Question # 8
Wha is a list in Python.
Question # 9
Which is the purpose of the push operation in a stack.
Question # 10
Which of the following best describes primitive computational structures.
Question # 11
What is the height of a tree.
Question # 12
Which real life example represents an undirected graph.
Question # 13
Which principle does a stack follow.
Question # 14
A scenario where a graph data structure is most suitable.
Question # 15
If you have a list f{Apple"banana". “cherry ”}ruits = I " what is fruit (1)
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 Chapter 4 Important MCQ's
| Sr.# | Question | Answer |
|---|---|---|
| 1 |
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 |
| 2 |
Which of the following is NOT a primitive computational structure. |
A.
integers
B.
Loops
C.
Artificial intelligence
D.
Boolean values |
| 3 |
Which real life example represents an undirected graph. |
A.
Twitter followers
B.
Facebook friendships
C.
On way streets
D.
Email spam links |
| 4 |
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 |
| 5 |
Which of the following is NOT a characteristic of a graph |
A.
Vertices
B.
Edges
C.
One directional flow only
D.
Weighted or unweighted edges |
| 6 |
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 |
| 7 |
The purpose of the inkeywrod used with a Pythonlist |
A.
Add an item to the list
B.
Remvoes an itemfrom the list
C.
Cheeks if an item exists int he list
D.
Returns the length of the list |
| 8 |
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 |
| 9 |
How do primitives affect a system's capabilities. |
A.
Make program look better
B.
Decide what and how fast it computes
C.
Control internet speed
D.
Improve graphics |
| 10 |
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 |
Test Questions