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.

 Mention what is the difference between = and = = in Prolog?

1 Answers  

---

What is the output of the given statement in LISP? * (setf fact1 ‘(big computers are nice)) * (setf (first fact1) ‘fast) a) Big computers b) Fast c) Big computers are fast d) None of the mentioned

1 Answers  

---

Explain what is Local Variables?

1 Answers  

---

Which has a template that calls for particularly peculiar argument evaluation? a) COND b) Consequent c) Trigger d) Sphere

1 Answers  

---

 What is the output of the given statement? * (setf pressure -3) * (when-plusp pressure (print ‘alarm)); a) T b) Nil c) Alarm d) None of the mentioned

1 Answers  

---

 Which require sophisticated precedence compputation? a) Superclass b) Multiple Superclass c) Subclass d) None of the mentioned

1 Answers  

---

Which makes it easy to identify the first entry encountered that satisfies a given predicate? a) Reusing b) Revoking c) Template d) Filtering

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  

---

Explain what is the difference between bagof/3 and setof/3 predicate in Prolog?

1 Answers  

---

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

1 Answers  

---

 Explain what is SWI-Prolog?

1 Answers  

---

 Which can be represented in bytes in LISP? a) Boxes and pointers b) Lists c) Lisp d) None of the mentioned

1 Answers  

---