Answer / chaitanya

In any language, a function that can call itself until the goal has been succeed is referred as recursion.  In Prolog, recursion happens when a predicate contains a goal that refers to itself.

 What is the output of the given statement? * (evenp (* 10 8 6 4 2)) a) T b) F c) NIL d) All of the mentioned

1 Answers  

---

 Explain what is setq is used for in LISP?

1 Answers  

---

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

1 Answers  

---

Explain what is LISP? Give an example of some of the popular applications built in LISP?

1 Answers  

---

Which is used to construct new lists by linking the right pointers? a) Links b) List c) Variables d) Right pointers

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 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)) a) Person :sex female :personality nice b) Person :sex c) Sex:Female d) None of the mentioned

1 Answers  

---

 Mention who is referred as a Member in Prolog?

1 Answers  

---

Explain what is backtracking in Prolog?

1 Answers  

---

Which is used to represent the prompt in lisp? a) # b) $ c) & d) *

1 Answers  

---

 Which is the primitive that creates new structure types in LISP? a) Defnum b) Deftype c) Defstruct d) None of the mentioned

1 Answers  

---

Which checks the evaluated key form against the unevaluated keys using EQL? a) COND b) CASE c) NIL d) SETF

1 Answers  

---