In A* approach evaluation function is a) Heuristic function b) Path cost from start node to current node c) Path cost from start node to current node + Heuristic cost d) Average of Path cost from start node to current node and Heuristic cost

0 Answers  

---

What are the components of a robot?

0 Answers  

---

Suppose I have gmail account, I want to delete all the mails in my inbox having the same name(for eg., Orkut). I have thousands of mails like that. So, how can I delete all the mails having single name. Is there any option provided in gmail?

0 Answers  

---

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

1 Answers  

---

Differentiate between the iqbot, metabot and a taskbot?

0 Answers  

---

List the name of the areas where the robotics can be applied?

0 Answers  

---

What types of motors used in industrial robots?

0 Answers  

---

What is not represented by using propositional logic? a) Objects b) Relations c) Both a & b d) None of the mentioned

0 Answers  

---

What does a hybrid bayesian network contain?

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  

---

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  

---

How logical inference can be solved in propositional logic?

0 Answers  

---