93. OCR A Level (H446) SLR14 – 1.4 Data structures part 2 – Grap

What data structure is the focus of the video?

• Graph

• Array

• Queue

• Binary Tree

Answer explanation

The focus of the video is on the data structure 'Graph', as mentioned in the correct answers section.

Which programming paradigms can be used to traverse a graph?

• Object-oriented programming

• Procedural programming

• Both A and B

• Functional programming

Answer explanation

Both object-oriented programming and procedural programming can be used to traverse a graph, making the correct answer choice 'Both A and B'.

What is NOT a method for traversing a graph?

• Breadth-first search

• Depth-first search

• None of the above

• Height-first search

Answer explanation

Height-first search is NOT a method for traversing a graph, making it the correct choice among the options provided.

What data structure does a breadth-first search use?

• Stack

• Queue

• Array

• Linked List

Answer explanation

Breadth-first search uses a Queue data structure to traverse through nodes level by level, ensuring all nodes at the current level are visited before moving to the next level.

What is a binary tree considered as?

• A type of array

• A type of graph

• A type of queue

• A type of stack

Answer explanation

A binary tree is considered as a type of graph because it consists of nodes connected by edges, similar to how graphs are structured.

What is essential for adding or removing an item from a graph?

• A predetermined set of steps

• A specific data structure

• Efficient traversal algorithms

• A single algorithm

Answer explanation

Efficient traversal algorithms are essential for adding or removing an item from a graph as they allow for effective navigation through the graph structure.

What is the first step in a breadth-first search?

• Visit the root node

• Enqueue the root node

• Mark the root node as visited

• Add the root node to the visited list

Answer explanation

The correct first step in a breadth-first search is to add the root node to the visited list.

What does a depth-first search primarily use?

• Queue

• Array

• Stack

• Linked List

Answer explanation

A depth-first search primarily uses a Stack to keep track of nodes to visit, as it follows a LIFO (Last In, First Out) approach for traversal.

Which of the following is true about adding an item to a graph?

• Only binary trees allow adding items

• You must follow a predetermined set of steps

• It depends on the graph and the item

• There is a single algorithm for all graphs

Answer explanation

The correct choice is 'It depends on the graph and the item' because the process of adding an item to a graph can vary based on the specific graph structure and the item being added.

What is NOT a valid output from a depth-first search?

• A B C D E F G

• A B E D G C F

• A D F G E C B

• All are valid outputs

Answer explanation

The correct choice is 'A D F G E C B' as it follows the correct order of a depth-first search traversal, visiting nodes in the order of A, D, F, G, E, C, B.