To overcome the need to backtrack in constraint satisfaction problem can be eliminated by a) Forward Searching b) Constraint Propagation c) Backtrack after a forward search d) Omitting the constraints and focusing only on goals

0 Answers  

---

One of the main cons of hill-climbing search is, a) Terminates at local optimum b) Terminates at global optimum c) Does not find optimum solution d) Fail to find a solution

0 Answers  

---

What kind of environment is crossword puzzle? a) Static b) Dynamic c) Semidynamic d) None of the mentioned

2 Answers  

---

Which functions are used as preferences over state history? a) Award b) Reward c) Explicit d) Implicit

0 Answers  

---

What is the degree of freedom in the robotics?

0 Answers  

---

Though local search algorithms are not systematic, key advantages would include a) Less memory b) More time c) Finds a solution in large infinite space d) No optimum solution

0 Answers  

---

What do you understand by 'humanoid robot'?

0 Answers  

---

What do you understand by the term, the robotics?

0 Answers  

---

Which kind of agent architecture should an agent an use? a) Relaxed b) Logic c) Relational d) All of the mentioned

0 Answers  

---

What is the space complexity of Greedy search? a) O(b) b) O(bl) c) O(m) d) O(bm)

1 Answers  

---

How the new states are generated in genetic algorithm? a) Composition b) Mutation c) Cross-over d) Both b & c

0 Answers  

---

In hmm’s, what are the possible values of the variable?

0 Answers  

---