Graph — Learn free · DataAI Nexus

Self-check

Questions 1–10 of 10

1. What are the two basic building blocks of a graph?
Question 1A. Vertices (nodes) and edges (links)B. Rows and columnsC. Tables and keysD. Files and foldersE. Classes and objects
2. What is the correct use of the terms 'vertex' and 'vertices'?
Question 2A. Vertex means an edge, vertices means many edgesB. One node is called a vertex; multiple nodes are called verticesC. Vertex is the plural of verticesD. Both terms refer only to directed graphsE. Vertex means a weighted node
3. In which type of graph do the edges have a direction, shown by arrows?
Question 3A. Undirected graphB. Simple graphC. Directed graph (digraph)D. Complete graphE. Bipartite graph
4. What is a weighted graph?
Question 4A. A graph in which every point is connected to every other pointB. A graph with no loops or duplicate edgesC. A graph whose vertices are split into two groupsD. A graph whose edges carry values or weights, such as distance or costE. A graph with no cycles
5. Which type of graph has every point connected to every other point?
Question 5A. Simple graphB. Bipartite graphC. TreeD. Directed graphE. Complete graph
6. In a bipartite graph, how are the points and lines arranged?
Question 6A. The points are split into two groups and lines only connect points from different groupsB. Every point is connected to every other pointC. All lines start and end at the same pointD. The points form a single cycleE. Each point has exactly one edge
7. What does the degree of a vertex measure?
Question 7A. The angle between two edgesB. The number of edges connected to that pointC. The distance to the farthest vertexD. The weight of the heaviest edgeE. The number of cycles in the graph
8. In a directed graph, what is the in-degree of a vertex?
Question 8A. The number of edges pointing away from the vertexB. The total number of vertices in the graphC. The number of edges pointing to the vertexD. The number of loops at the vertexE. The weight of the vertex
9. What is a cycle in a graph?
Question 9A. Any two vertices connected by an edgeB. A graph with no edgesC. A vertex with degree zeroD. A path that starts and ends at the same pointE. An edge with a weight of zero
10. What is a tree in graph terms?
Question 10A. A graph in which every edge is weightedB. A graph with exactly one cycleC. A graph whose vertices fall into two groupsD. A graph that is disconnectedE. A special type of graph that is connected and has no cycles