Exploring Depth First Traversal

Which of the following is a common way to represent a graph in computer science?

• Binary Tree

• Adjacency List

• Linked List

• Stack

In Depth First Traversal, which data structure is commonly used to keep track of the nodes?

• Queue

• Stack

• Priority Queue

• Hash Table

What is the primary purpose of backtracking in algorithms?

• To find the shortest path

• To explore all possible solutions

• To sort data

• To optimise memory usage

Which of the following is a tree traversal method?

• Breadth First Search

• Depth First Search

• Inorder Traversal

• Dijkstra's Algorithm

Which of the following is NOT a characteristic of Depth First Search?

• It uses a stack data structure

• It can be implemented using recursion

• It always finds the shortest path

• It explores as far as possible along each branch before backtracking

In backtracking, what is the term used for returning to a previous state to try a different path?

• Forwarding

• Reversing

• Backtracking

• Looping

Which of the following is a correct sequence of operations in a Depth First Search?

• Visit node, enqueue children, visit next node

• Visit node, push children to stack, visit next node

• Visit node, dequeue children, visit next node

• Visit node, pop children from stack, visit next node

Which of the following is a disadvantage of using an adjacency matrix for graph representation?

• It is difficult to implement

• It uses more space for sparse graphs

• It is not suitable for directed graphs

• It cannot represent weighted graphs