###### Digital-Logic-Design

October 14, 2023###### Boolean-Algebra

October 14, 2023# Nielit Scientist-B IT 22-07-2017

Question 5 |

In a given following graph among the following sequences:

i)abeghf

ii)abfehg

iii)abfhge

iv)afghbe

Which are depth first traversals of the above graph?

i)abeghf

ii)abfehg

iii)abfhge

iv)afghbe

Which are depth first traversals of the above graph?

I,II and IV only | |

I and IV only | |

II,III and IV only | |

I,III and IV only |

Question 5 Explanation:

The basic idea of DFS is

● Pick a starting node and push all its adjacent nodes into a stack.

● Pop a node from stack to select the next node to visit and push all its adjacent nodes into a stack.

● Repeat this process until the stack is empty. However, ensure that the nodes that are visited are marked.

● This will prevent you from visiting the same node more than once. If you do not mark the nodes that are visited and you visit the same node more than once, you may end up in an infinite loop.

● Pick a starting node and push all its adjacent nodes into a stack.

● Pop a node from stack to select the next node to visit and push all its adjacent nodes into a stack.

● Repeat this process until the stack is empty. However, ensure that the nodes that are visited are marked.

● This will prevent you from visiting the same node more than once. If you do not mark the nodes that are visited and you visit the same node more than once, you may end up in an infinite loop.

Correct Answer: D

Question 5 Explanation:

The basic idea of DFS is

● Pick a starting node and push all its adjacent nodes into a stack.

● Pop a node from stack to select the next node to visit and push all its adjacent nodes into a stack.

● Repeat this process until the stack is empty. However, ensure that the nodes that are visited are marked.

● This will prevent you from visiting the same node more than once. If you do not mark the nodes that are visited and you visit the same node more than once, you may end up in an infinite loop.

● Pick a starting node and push all its adjacent nodes into a stack.

● Pop a node from stack to select the next node to visit and push all its adjacent nodes into a stack.

● Repeat this process until the stack is empty. However, ensure that the nodes that are visited are marked.

● This will prevent you from visiting the same node more than once. If you do not mark the nodes that are visited and you visit the same node more than once, you may end up in an infinite loop.

Subscribe

Login

0 Comments