ONE 6th FORM Graphs

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 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 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

Which of the following is a directed graph? (choose 3 out of the 4)

• 
• 
• 
• 

Imagine John is a passionate gardener who loves to arrange his plants in a unique tree structure. Can you guess how many edges this tree will have if there are n plants in his garden?

• n - 1 edges

• n + 1 edges

• n edges

• n - 2 edges

Imagine you're a squirrel in a magical forest. You're building a tree house with 8 rooms, each room being a vertex. How many bridges (edges) would you need to connect all the rooms?

• 6

• 7

• 9

• 10

Imagine you're a botanist exploring a magical forest! Which of these characteristics would you find in the enchanting trees around you? (Choose 2)

• They are free from any cycles

• They are not connected to each other

• They are connected in some way

• They contain mysterious cycles

Imagine you're a squirrel in a forest, hopping from branch to branch. If you hop across 9 branches (edges), how many trees (vertices) will you have visited?

• 8

• 9

• 10

• 7