Understanding Course Data Structures

What is a graph in the context of data structures?

• A graph is a collection of unordered pairs of elements.

• A graph is a type of tree structure with no cycles.

• A graph is a collection of nodes connected by edges, used to represent relationships between objects.

• A graph is a linear arrangement of data elements.

How do you represent a graph using an adjacency list?

• An adjacency list is represented as an array of lists, where each index represents a vertex and contains a list of its adjacent vertices.

• An adjacency list is a dictionary where keys are edges and values are vertices.

• An adjacency list is represented as a single list of all vertices.

• An adjacency list uses a matrix to represent connections between vertices.

What are the differences between directed and undirected graphs?

• Directed graphs are always cyclic; undirected graphs are always acyclic.

• Both directed and undirected graphs have edges that can be traversed in any direction.

• Directed graphs have edges with direction; undirected graphs have edges without direction.

• Directed graphs can have weighted edges; undirected graphs cannot.

Explain the concept of graph traversal. What are the common algorithms used?

• Graph traversal is a method for sorting arrays.

• Graph traversal is only used in tree structures.

• Common algorithms include Quick Sort and Merge Sort.

• Common algorithms used for graph traversal are Depth-First Search (DFS) and Breadth-First Search (BFS).

What is the significance of weighted graphs in data structures?

• Weighted graphs enable the modeling of complex relationships with varying costs, essential for shortest path algorithms.

• Weighted graphs are primarily used for sorting algorithms.

• Weighted graphs simplify data structures by removing unnecessary edges.

• Weighted graphs are only used for visual representation of data.