Answer / ahsan habib

Abstraction

___________ 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  

---

Which is not the commonly used programming language for AI? a) PROLOG b) Java c) LISP d) Perl e) Java script

1 Answers  

---

Specify the agent architecture name that is used to capture all kinds of actions. a) Complex b) Relational c) Hybrid d) None of the mentioned

0 Answers  

---

What are applications of expert system?

0 Answers  

---

for online search in ‘artificial intelligence’ which search agent operates by interleaving computation and action?

0 Answers  

---

Hill-Climbing approach stuck for the following reasons a) Local maxima b) Ridges c) Plateaux d) All of above

0 Answers  

---

 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 the use of the function (copy-list <list>) in lisp?

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 do you understand by the term, the robotics?

0 Answers  

---

Which is used to provide the feedback to the learning element? a) Critic b) Actuators c) Sensor d) None of the mentioned

1 Answers  

---

The BACKTRACKING-SEARCH algorithm in Figure 5.3 has a very simple policy for what to do when a branch of the search fails: back up to the preceding variable and try a different value for it. This is called chronological-backtracking. It is also possible to go all the way to set of variable that caused failure. State whether True or False. a) True b) False

0 Answers  

---