Graphs in Computer Science

What is a graph data structure used to model?

• Navigation systems

• Data transmission

• Web page links

• All of the above

What is a vertex in a graph?

• A node

• An edge

• A path

• A cost

What is a directed graph?

• A graph with arrow heads on both ends of edges

• A graph with no arrow heads on edges

• A graph with more edges than vertices

• A graph with few edges in relation to vertices

What can edges in a graph represent?

• Distances in kilometers

• Capacity in bits per second

• Both A and B

• None of the above

How can a graph be represented in a text-based format?

• Using a list of vertices and edges

• Using an adjacency matrix

• Using an adjacency list

• Both B and C

What is an advantage of using an adjacency matrix to represent a graph?

• Easy and quick to work with

• Space efficient for sparse graphs

• Allows easy deletion of individual nodes

• None of the above

What is a disadvantage of using an adjacency matrix to represent a graph?

• Wastes memory for sparse graphs

• Difficult to add new edges

• Inefficient for large graphs

• All of the above

What is an advantage of using an adjacency list to represent a graph?

• Space efficient for sparse graphs

• Allows easy deletion of individual nodes

• Quickly checks for presence of edges

• Both A and B

What is a disadvantage of using an adjacency list to represent a graph?

• Not suitable for dense graphs

• Requires more memory for large graphs

• Difficult to add new edges

• All of the above

What is the term used for a graph with more edges than vertices?

• Dense graph

• Sparse graph

• Directed graph

• Undirected graph