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 following statement? * (+ 3.14 2.71) a) 3.14 b) 2.71 c) 5.84 d) 5.85

1 Answers  

---

Explain what is a predicate in LISP?

1 Answers  

---

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

1 Answers  

---

Mention how many types of variables available is LISP? Explain what are the variables that are bound, and that have values assigned to them?

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)) * (setf (person-surname person-instance-1) ‘winston) a) Winston b) Nil c) T d) Error

1 Answers  

---

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

1 Answers  

---

 Explain what is setq is used for in LISP?

1 Answers  

---

 How the clause is called if it contains a test, as well as zero or more additional forms in LISP? a) Conditional b) Consequents c) Clause d) None of the mentioned

1 Answers  

---

 What is the output of the given statement? * (setf day-or-date ‘monday) * (if (symbolp day-or-date) ‘day ‘date) a) Monday b) Day c) Date d) None of the mentioned

1 Answers  

---

Explain what is LISP constants?

1 Answers  

---

 What is the process of creating new data types in lisp? a) List b) Structures c) Procedures d) None of the mentioned

1 Answers  

---

 What is the output of the following statement? * (setf meals ‘(breakfast lunch tea dinner)) * (first meals) a) Breakfast b) Lunch c) Tea d) Dinner

1 Answers  

---