Which of the problems cannot be solved by backtracking method?(a) n-queen problem(b) subset sum problem(c) hamiltonian circuit problem(d) travelling salesman problemI had been asked this question at a job interview.This question is from Backtracking in division Backtracking of Data Structures & Algorithms II

Which of the problems cannot be solved by backtracking method?(a) n-qu

1.	Which of the problems cannot be solved by backtracking method?(a) n-queen problem(b) subset sum problem(c) hamiltonian circuit problem(d) travelling salesman problemI had been asked this question at a job interview.This question is from Backtracking in division Backtracking of Data Structures & Algorithms II
Answer» Right option is (d) travelling salesman PROBLEM The best explanation: N-queen problem, SUBSET SUM problem, Hamiltonian circuit problems can be solved by BACKTRACKING METHOD whereas travelling salesman problem is solved by Branch and bound method.

Discussion

No Comment Found

Related InterviewSolutions

Of the following given options, which one of the following does not provides an optimal solution for 8-queens problem?(a) (5,3,8,4,7,1,6,2)(b) (1,6,3,8,3,2,4,7)(c) (4,1,5,8,6,3,7,2)(d) (6,2,7,1,4,8,5,3)I got this question by my school principal while I was bunking the class.My question is based upon Backtracking in portion Backtracking of Data Structures & Algorithms II
What is the domination number for 8-queen’s problem?(a) 8(b) 7(c) 6(d) 5The question was posed to me in an international level competition.This intriguing question originated from Backtracking topic in chapter Backtracking of Data Structures & Algorithms II
If n=1, an imaginary solution for the problem exists.(a) true(b) falseI have been asked this question in an online interview.This interesting question is from Backtracking in portion Backtracking of Data Structures & Algorithms II
How many possible solutions occur for a 10-queen problem?(a) 850(b) 742(c) 842(d) 724This question was addressed to me during an interview.I want to ask this question from Backtracking topic in portion Backtracking of Data Structures & Algorithms II
How many possible solutions exist for an 8-queen problem?(a) 100(b) 98(c) 92(d) 88The question was asked in examination.I'm obligated to ask this question of Backtracking in portion Backtracking of Data Structures & Algorithms II
Of the following given options, which one of the following is a correct option that provides an optimal solution for 4-queens problem?(a) (3,1,4,2)(b) (2,3,1,4)(c) (4,3,2,1)(d) (4,2,3,1)I got this question in quiz.The above asked question is from Backtracking in chapter Backtracking of Data Structures & Algorithms II
Which of the following methods can be used to solve n-queen’s problem?(a) greedy algorithm(b) divide and conquer(c) iterative improvement(d) backtrackingI got this question by my school teacher while I was bunking the class.The question is from Backtracking in chapter Backtracking of Data Structures & Algorithms II
In n-queen problem, how many values of n does not provide an optimal solution?(a) 1(b) 2(c) 3(d) 4The question was posed to me by my college director while I was bunking the class.I'm obligated to ask this question of Backtracking in portion Backtracking of Data Structures & Algorithms II
Not more than 2 queens can occur in an n-queens problem.(a) true(b) falseThis question was posed to me in final exam.This key question is from Backtracking in chapter Backtracking of Data Structures & Algorithms II
Where is the n-queens problem implemented?(a) carom(b) chess(c) ludo(d) cardsThis question was addressed to me in examination.The query is from Backtracking in division Backtracking of Data Structures & Algorithms II

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment