Answer / chaitanya

In Prolog, backtracking is a process adopted by Prolog.  When a sub-goal fails in Prolog, the Prolog system moves its steps backwards to the previous goal and tries to re-satisfy it. Backtracking enables Prolog to find all alternative solutions to a given query.

Explain with an example what is “Setof” predicate in Prolog?

1 Answers  

---

 Which keyword is used to construct an array in LISP? a) Array b) Make-array c) Bins d) Make

1 Answers  

---

 What is the output of the given statement? * (defstruct person (sex nil) (personality ‘nice)) * (setf person-instance-1 (make-person)) * (setf person-instance-2 (make-person :sex ‘female)) * (person-personality person-instance-2) a) Female b) Nice c) Person d) Both a & b

1 Answers  

---

What is a data type in which expressions are stored in places identified by integer indexes in LISP? a) Structure b) List c) Array d) None of the mentioned

1 Answers  

---

 What is the other name of boxes in LISP? a) Cons cells b) Conses c) Both a & b d) None of the mentioned

1 Answers  

---

Mention why you have to use “is” instead of “=” in Prolog when it comes to applying calculation logic?

1 Answers  

---

 What is the output of the given statement in LISP? * (Setf part-bins (make-array ‘(4))) a) #Done b) #4 c) #(0 0 0 0) d) None of the mentioned

1 Answers  

---

Explain List of artificial intelligence projects?

0 Answers  

---

Explain what is CLOS in LISP? What are the goals of the common lisp object system?

1 Answers  

---

Which keyword is used to define the method? a) Defun b) Destruct c) Demake d) Defmethod

1 Answers  

---

 Explain what is the property list in LISP?

1 Answers  

---

 What is the output of the given statement in LISP? * (Setf part-bins (make-array ‘(4))) * (setf (aref part-bins 0) ‘nails); * (setf (aref part-bins 1) ‘nuts); * (setf (aref part-bins 2) ‘bolts) * (setf (aref part-bins 3) ‘bike) * (aref part-bins 2) * (setf (aref part-bins 4) ‘car) a) Nails b) Nuts c) 2 d) Error

1 Answers  

---