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? * (setf thing ‘point r 1) * (case thing (circle (*pi r r))(sphere (* 4 pi r r))) a) 1 b) 12.56637 c) NIL d) T

1 Answers  

---

Which enables storage in procedurally indexed places in LISP? a) Defstruct b) Object c) Structure d) None of the mentioned

1 Answers  

---

 Which is a procedures supplied by user in terms of primitives? a) Custom b) User-defined c) Definite d) All of the mentioned

1 Answers  

---

Which is used to seperate the abstraction layers? a) Abstraction boundaries b) Data c) Procedure d) All of the mentioned

1 Answers  

---

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

1 Answers  

---

Explain List of programming languages for artificial intelligence?

0 Answers  

---

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

1 Answers  

---

Explain what is slot and what are the most commonly used slot options?

1 Answers  

---

 What is a symbol thought of as a name for a place to store value? a) Data b) Variable c) Parameters d) None of the mentioned

1 Answers  

---

What is the output of the following statement? * (defun (input-list) (if (endp input-list) nil (cons ( (first input-list)) ( (rest input-list))))) a) Procedure b) Transforming c) Input d) Error

1 Answers  

---

Which creates reader procedures for getting things out of an instance fields? a) Structure in LISP b) Defstruct c) Class d) Object

1 Answers  

---

 Mention who is referred as a Member in Prolog?

1 Answers  

---