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

What data structure is the focus of the video?

• Queue

• Stack

• Array

• Graph

Which of the following is NOT a method mentioned for implementing a graph?

• Using an array

• Procedural programming

• Object-oriented techniques

• Using a dictionary

What is essential for traversing a graph to find a specific node?

• Graph traversal algorithms

• A powerful computer

• A large database

• Internet access

What type of graph has a specific algorithm for adding an item?

• Binary tree

• Directed graph

• Undirected graph

• Weighted graph

Which search method uses a queue data structure?

• Depth-first search

• Linear search

• Breadth-first search

• Binary search

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

• Enqueue the root node

• Pop the stack

• Dequeue the front of the queue

• Push onto the stack

In a depth-first search, what data structure is used?

• Array

• Stack

• Queue

• Graph

What is a key difference between breadth-first and depth-first search?

• The type of data structures they use

• The type of graphs they can traverse

• The programming language required

• The speed of the algorithm

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

• A stack of nodes

• A list of all nodes in a specific order

• The shortest path between two nodes

• A list of visited nodes

Which of the following is true about implementing graph traversal algorithms?

• They cannot be implemented using recursion

• There is only one correct way to implement them

• They require an internet connection to work

• Different implementations can produce different valid outputs