A2 Graphs Quiz

Graph is implemented by

• Adjacency Matrix

• Adjacency List

• Arrays and Pointers

• Array of Pointers

When BFS is done in the given graph with start node as A,

• Traversal starts with A, B

• Traversal starts with A, D

• BFS is not possible in Directed Graph

• G is the last node visited, in whatever way the traversal is done

When BFS is done with start node as A, the traversal is (multiple options may be correct)

• A B D C F G E

• A D B F C E G

• A D B F C G E

• A B D C F E G

When DFS is done with A as the start node, the traversal is (multiple options may be correct)

• A D F B C G E

• A D F B C E G

• A B C G E F D

• A F B D E C G

When DFS is done with start Node as A, _______ (more than one option may be correct)

• F is visited after B

• F is visited after D

• F is visited after E

• A is visited after F