Skip to content
تعليم
Teaching
Courses
YouTube
About me
Algorithms
Graph Test
Test your graph Algorithms and Data structure knowledge
4 questions
Suggested time: 10 min
1
Consider a forest with five trees and each tree contains at least two nodes. What is the minimum number of undirected edges needed to make the forest one connected tree?
A
The minimum number of edges is 5.
B
The minimum number of edges is 4.
C
The minimum number of edges is 8.
D
The minimum number of edges is 10.
2
Assume you have a directed connected graph of 10 nodes and 30 edges (no loops). If you present the graph as an adjacency list, then the total number of chained nodes is:
A
30
B
15
C
45
D
90
3
The breadth-first search algorithm uses:
A
A FIFO queue, where it contains all gray nodes.
B
A FILO stack, where it contains all gray reachable nodes.
C
A FIFO queue, where it contains all white nodes.
D
A FIFO queue, where it contains all black nodes.
4
Picture Question:
A
6
B
5
C
4
D
8
Answered 0 of 4
Submit answers