curriculum/challenges/english/blocks/quiz-graphs-and-trees/67f4138c34cd9c4ac783ceef.md
To pass the quiz, you must correctly answer at least 18 of the 20 questions below.
What is a graph?
A linear data structure that follows the Last-In, First-Out principle.
A data structure that stores multiple values of the same type that are contiguous in memory.
A linear data structure that follows the First-In, First-Out principle.
A data structure used to represent the connections or relationships between objects or entities.
Which of the following is NOT a typical scenario that can be represented using a graph?
social networks
transportation networks
communications networks
temperature measurement over time
Which of the following terms describes an object or entity that is part of the network depicted by a graph?
Cookie
Endpoint
CPU
Node
Which of the following terms describes the connections between nodes in a graph?
Gates
Connectors
Vertices
Edges
What is an undirected graph?
A graph where the nodes are undirected but the edges are directed.
A graph where the edges have a specific direction.
A graph where the nodes and edges connect at the midpoint.
A graph where the edges don't have a specific direction.
Which of the following refers to a graph in which each node is associated with a label or identifier in addition to its data?
Version labeled graph
Virtual labeled graph
Vertical labeled graph
Vertex labeled graph
Which of the following refers to a directed graph with at least one cycle?
Cycling graph
Circulating graph
Circular graph
Cyclic graph
What is a weighted graph?
A specific type of edge labeled graph that shows only the direction of connections between nodes.
A specific type of edge labeled graph that assigns categories instead of numerical values to edges.
A specific type of edge labeled graph that treats all edge weights as equal regardless of label.
A specific type of edge labeled graph in which the labels on the edges represent values that can be compared and used to perform arithmetic operations.
What is a directed acyclic graph?
A directed graph with one cycle.
A directed graph with three cycles.
A directed graph with two cycles.
A directed graph with no cycles.
Which of the following refers to a graph with two or more groups of nodes that are not connected by any edges?
Disconnect graph
Disconnecting graph
Disconnection graph
Disconnected graph
What is the Breadth-first search algorithm?
An algorithm that visits two nodes in one direction before moving another direction in the graph.
An algorithm that visits all nodes in one direction before moving another direction in the graph.
An algorithm that visits four nodes at a time before moving to the next level in the graph.
An algorithm that visits all neighboring nodes before moving to the next level in the graph.
Which of the following algorithms will follow each branch as deep as possible before it backtracks?
Data-First Search
Dock-First Search
Daemon-First Search
Depth-First Search
Which of the following terms represents a two-dimensional list in which the rows and columns represent the graph's vertices?
Array matrix
Depth matrix
Vertex matrix
Adjacency matrix
Which of the following terms represents an array or dictionary that stores all the neighbors of each node?
Cyclic list
Tuple list
Breadth list
Adjacency list
What must be true for a graph to be classified as a tree?
It must have at least one loop or cycle.
It must have at least two loops or cycles.
It must have three loops or cycles.
It cannot have loops or cycles.
Which of the following is a type of tree in which each node can have at most two child nodes?
Depth tree
Spatial tree
Linear tree
Binary tree
What is a Trie?
A tree data structure used to store a set of numbers.
A tree data structure used to store a set of dictionaries.
A tree data structure used to store a set of lists.
A tree data structure used to store a set of strings.
How does the priority queue data structure differ from a regular queue data structure?
A priority queue automatically removes duplicates before insertion.
A priority queue always processes elements in the order they were added.
A priority queue only stores elements of the same data type.
A priority queue processes elements based on their priority.
What are the two types of heaps?
Wide-heap and Tall-heap
Horizontal-heap and Vertical-heap
Breadth-heap and Depth-heap
Max-heap and Min-heap
What are the average and worst case time complexities for inserting and extracting the minimum or maximum value from a heap?
O(n log n)
O(1)
O(n)
O(log n)