Untitled Quiz

DFS explores as far down a branch as possible before backtracking, while BFS explores all neighbors at the present depth prior to moving on. (correct)

DFS is faster than BFS in all situations.

DFS explores nodes layer by layer while BFS goes deep into nodes.

DFS uses a queue while BFS uses a stack.

A graph can only represent one type of relationship at a time.

A graph is a linear data structure with an ordered sequence of elements.

A graph is made up of vertices connected by edges, representing relationships between entities. (correct)

A graph consists of a single node with no connections.

It has no cycles and each node can be reached uniquely.

It can only be traversed using Depth First Search.

It contains at least one cycle, allowing a node to connect back to itself. (correct)

It is structured linearly with all nodes connected in a single path.

<p>A square matrix that denotes connection presence between nodes.</p> Signup and view all the answers

<p>They may lead to infinite loops if cycles are not detected.</p> Signup and view all the answers

<p>A construct that allows for repetitive execution until a condition is met.</p> Signup and view all the answers

<p>Edges in directed graphs have a specific direction, whereas edges in undirected graphs do not.</p> Signup and view all the answers

<p>Acyclic graphs can simplify search algorithms due to unique paths.</p> Signup and view all the answers