M

Madhu • 12.07K Points
Tutor II

Q. Which of the following are true for the algorithms Beam Stack Search (BSS)and Divide-and-Conquer Beam Stack Search (DCBSS).

  • (A) bss finds the optimal path while dcbss does not.
  • (B) dcbss finds the optimal path while bss does not.
  • (C) both bss and dcbss find the optimal path
  • (D) neither bss and dcbss find the optimal path
Share

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. The CIA triad is often represented by which of the following?

Q. The actions which are played in the order while recording it is called history.

Q. The last field in the packet is

Q. Consider a project with a first cost (investment) of $250,000, an annual O&M cost of $50,000, annual revenue of $160,000, and a salvage value of

Q. Which of the following is the fastest logic?

Q. The complexity of a linear search algorithm is

Q. Client server architecture

Q. Fact 1: All chickens are birds. Fact 2: Some chickens are hens. Fact 3: Female birds lay eggs. If the first three statements are facts, which of the f

Q. The ..................... is essentially used to search for patterns in target string.

Q. The result of the fractional knapsack is greater than or equal to 0/1 knapsack.

Question analytics