Answer Posted / m. s. wara

Perception sequence

What are the basic aspects of the robotics?

883

---

Which search uses only the linear space for searching? a) Best-first search b) Recursive best-first search c) Depth-first search d) None of the mentioned

2996

---

 A problem in a search space Is defined by, a) Initial state b) Goal test c) Intermediate states d) All of the above

4069

---

Explain the various types of industrial robots?

984

---

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

3849

---

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

1414

---

Why do we need technology intelligence?

981

---

What is computer vision?

848

---

 What kind of observing environments are present in artificial intelligence? a) Partial b) Fully c) Learning d) Both a & b

2258

---

Solving a constraint satisfaction problem on a finite domain is an/a ___________ problem with respect to the domain size. a) P complete b) NP complete c) NP hard d) Domain dependent

2260

---

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

1845

---

What is the other name of informed search strategy? a) Simple search b) Heuristic search c) Online search d) None of the mentioned

5155

---

What is “generality” in ai ?

938

---

Stochastic hill climbing chooses at random from among the uphill moves; the probability of selection can vary with the steepness of the uphil1 move. a) True b) False

1858

---

 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

2711

---