In BFS, how many times a node is visited?(a) Once(b) Twice(c) Equivalent to number of indegree of the node(d) ThriceThis question was posed to me during an interview.This key question is from Breadth First Search topic in section Graph Search of Data Structures & Algorithms II

In BFS, how many times a node is visited?(a) Once(b) Twice(c) Equivale

1.	In BFS, how many times a node is visited?(a) Once(b) Twice(c) Equivalent to number of indegree of the node(d) ThriceThis question was posed to me during an interview.This key question is from Breadth First Search topic in section Graph Search of Data Structures & Algorithms II
Answer» The correct answer is (c) Equivalent to number of INDEGREE of the node Easiest EXPLANATION - In BREADTH FIRST Search, we have to see whether the node is visited or not by it’s ancestor. If it is visited, we won’t let it enter it in the queue.

Discussion

No Comment Found

Related InterviewSolutions

Which of the following can traverse the state space tree only in DFS manner?(a) branch and bound(b) dynamic programming(c) greedy algorithm(d) backtrackingI got this question during a job interview.I would like to ask this question from Graph Search in chapter Graph Search of Data Structures & Algorithms II
Choose the correct statement from the following.(a) branch and bound is more efficient than backtracking(b) branch and bound is not suitable where a greedy algorithm is not applicable(c) branch and bound divides a problem into at least 2 new restricted sub problems(d) backtracking divides a problem into at least 2 new restricted sub problemsI have been asked this question in final exam.My doubt stems from Graph Search in division Graph Search of Data Structures & Algorithms II
Both LIFO branch and bound strategy and backtracking leads to depth first search.(a) true(b) falseThis question was addressed to me in my homework.I would like to ask this question from Graph Search in chapter Graph Search of Data Structures & Algorithms II
Both FIFO branch and bound strategy and backtracking leads to depth first search.(a) true(b) falseThe question was asked in an interview.The above asked question is from Graph Search in chapter Graph Search of Data Structures & Algorithms II
Which of the following branch and bound strategy leads to depth first search?(a) LIFO branch and bound(b) FIFO branch and bound(c) Lowest cost branch and bound(d) Highest cost branch and boundI got this question in an online interview.Question is taken from Graph Search in division Graph Search of Data Structures & Algorithms II
Which of the following branch and bound strategy leads to breadth first search?(a) LIFO branch and bound(b) FIFO branch and bound(c) Lowest cost branch and bound(d) Highest cost branch and boundThis question was addressed to me in an interview for job.My question comes from Graph Search topic in portion Graph Search of Data Structures & Algorithms II
Which data structure is most suitable for implementing best first branch and bound strategy?(a) stack(b) queue(c) priority queue(d) linked listThis question was posed to me in my homework.Question is from Graph Search in division Graph Search of Data Structures & Algorithms II
Which data structure is used for implementing a FIFO branch and bound strategy?(a) stack(b) queue(c) array(d) linked listI got this question in an online quiz.This intriguing question comes from Graph Search topic in section Graph Search of Data Structures & Algorithms II
Which data structure is used for implementing a LIFO branch and bound strategy?(a) stack(b) queue(c) array(d) linked listThe question was asked in examination.I need to ask this question from Graph Search in chapter Graph Search of Data Structures & Algorithms II
Which of the following is not a branch and bound strategy to generate branches?(a) LIFO branch and bound(b) FIFO branch and bound(c) Lowest cost branch and bound(d) Highest cost branch and boundI have been asked this question during a job interview.I'd like to ask this question from Graph Search in division Graph Search of Data Structures & Algorithms II

In BFS, how many times a node is visited?(a) Once(b) Twice(c) Equivalent to number of indegree of the node(d) ThriceThis question was posed to me during an interview.This key question is from Breadth First Search topic in section Graph Search of Data Structures & Algorithms II

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment