In many problems the path to goal is irrelevant, this class of problems can be solved using, a) Informed Search Techniques b) Uninformed Search Techniques c) Local Search Techniques d) Only a and b

0 Answers  

---

What is travelling salesman problem?

0 Answers  

---

A complete, local search algorithm always finds goal if one exists, an optimal algorithm always finds a global minimum/maximum. State whether True or False. a) True b) False

0 Answers  

---

How many successors are generated in backtracking search? a) 1 b) 2 c) 3 d) 4

0 Answers  

---

What is the pneumatic system in the robotics?

0 Answers  

---

Is intelligence inherited?

0 Answers  

---

 What among the following constitutes to the incremental formulation of CSP? a) Path cost b) Goal cost c) Successor function d) Objective function e) Initial state

0 Answers  

---

___________ algorithm keeps track of k states rather than just one. a) Hill-Climbing search b) Local Beam search c) Stochastic hill-climbing search d) Random restart hill-climbing search

0 Answers  

---

What is the use of the function (copy-list <list>) in lisp?

0 Answers  

---

An agent is composed of, a) Architecture b) Agent Function c) Perception Sequence d) Architecture and Program

2 Answers  

---

What is the heuristic function of greedy best-first search? a) f(n) != h(n) b) f(n) < h(n) c) f(n) = h(n) d) f(n) > h(n)

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  

---