Graph Data Structure - 01

BFT uses which data structure?

• Stack

• Queue

• Tree

• Hash

Answer explanation

Breadth-First Search uses a queue data structure technique to store the vertices. And the queue follows the First In First Out (FIFO) principle, which means that the neighbors of the node will be displayed, beginning with the node that was put first.

Which of the following statements is true about a graph?

• It is a linear data structure.

• It contains a sequence of elements.

• It consists of a set of vertices and edges.

• It can only be traversed in a single direction.

Answer explanation

A graph is a non-linear data structure that consists of a set of vertices (nodes) and edges (connections) that connect these vertices.

What is a vertex in a graph?

• The edge that connects two nodes.

• A node or a point in the graph.

• The path between two vertices.

• The length of the edge.

Answer explanation

A vertex, also known as a node, is an individual element or point in a graph.

What is an edge in a graph?

• The path between two vertices.

• A node or a point in the graph.

• The length of the vertex.

• The connection between two vertices

Answer explanation

The connection between two vertices

What is the maximum number of edges in a complete graph with n vertices?

• n

• n - 1

• n(n - 1) / 2

• 2n

Answer explanation

In a complete graph with n vertices, each vertex is connected to every other vertex. The total number of possible edges can be calculated using the formula n(n - 1) / 2.

Which of the following is NOT a type of graph?

• Directed graph

• Weighted graph

• Binary tree

• Undirected graph

Answer explanation

A binary tree is a specialized form of a graph with specific properties, such as each node having at most two children. It is not considered a type of general graph.

What is the degree of a vertex in a graph?

• The total number of vertices in the graph.

• The total number of edges in the graph.

• The number of edges incident to the vertex

• The sum of the weights of all edges connected to the vertex.

Answer explanation

The degree of a vertex in a graph is the number of edges that are incident or connected to that vertex.

Which of the following is true about a directed graph?

• The total number of vertices in the graph.

• The total number of edges in the graph.

• The number of edges incident to the vertex.

• The sum of the weights of all edges connected to the vertex.

Answer explanation

The degree of a vertex in a graph is the number of edges that are incident or connected to that vertex.

Which of the following is true about a directed graph?

• All edges have the same weight.

• Edges have a specific direction from one vertex to another.

• The degree of a vertex is always zero.

• It is a cyclic graph.

Answer explanation

In a directed graph, each edge has a specific direction associated with it, indicating the flow or connection from one vertex to another.

Which of the following graph traversal algorithms uses a queue data structure?

• Depth-First Search (DFS)

• Breadth-First Search (BFS)

• Dijkstra's algorithm

• Prim's algorithm

Answer explanation

Breadth-First Search uses a queue data structure to explore vertices in a graph, where each vertex is visited before its neighbors.