DAY 30 Graph Representation & Traversal - 19th July 2024

What is a graph in data structures?

• A linear collection of nodes connected by edges

• non-linear collection of nodes connected by edges

• A collection of elements arranged in a linear order

• A set of sequentially connected elements

What is a vertex in a graph?

• A connection between two edges

• A unidirectional edge

• An individual data element

• The weight of an edge

Which type of edge has no direction?

• Directed edge

• Undirected edge

• Weighted edge

• Self-loop

In an adjacency matrix, what does a value of 1 represent?

• No edge between vertices

• Edge between vertices

• Self-loop on a vertex

• Weighted edge

What is the degree of a vertex?

• Number of edges connected to the vertex

• Number of vertices in the graph

• Number of directed edges

• Value of the edge weight

Which traversal method horizontally traverses the graph?

• Depth-First Search (DFS)

• Breadth-First Search (BFS)

• Stack traversal

• Linear traversal

In a directed graph, what does the adjacency list for a vertex represent?

• Vertices that are connected to the given vertex by outgoing edges

• Vertices that are connected to the given vertex by incoming edges

• All vertices in the graph

• None of the above

Which data structure is commonly used to implement Depth-First Search (DFS)?

• Queue

• Stack

• Array

• Linked list

What is a weighted graph?

• A graph with unidirectional edges

• A graph with bidirectional edges

• A graph with values (costs) associated with edges

• A graph without any value associated with the edges

What is an adjacency list?

• A 2D array representing connections between vertices

• An array of linked lists representing adjacent vertices

• A single linked list of vertices

• A list of vertices sorted in ascending order