Answer / chaitanya

The hash table data structure denotes a collection of key and value pairs which are arranged based on the hash code of the key. Each item in the hash table has key/value pair and is used to access the items in the collection. When you want to access elements by using a key a hash table is used.

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  

---

 What is the output of the given statement  in LISP? * (setf part (make-array ‘(8 8))) a) 8 b) 0 0 0 0 0 0 0 0 c) 0 0 0 0 d) 8 rows of 0

1 Answers  

---

Which is present in the writer procedure for arrays in LISP? a) Setf b) Aref c) Fref d) Both a & b

1 Answers  

---

 Mention what are the two pre-defined packages used in LISP?

1 Answers  

---

 Which notation facilitates uniformity in lisp? a) Prefix b) Postfix c) Infix 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  

---

 Which can be represented in bytes in LISP? a) Boxes and pointers b) Lists c) Lisp d) None 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  

---

 Which primitive removes all but the last element from the list? a) Last b) First c) Remove d) Revoke

1 Answers  

---

Why LISP is used for Artificial Intelligence?

1 Answers  

---

What are the variables that are bound and that have values assigned to them? a) Data b) Variable c) Parameters d) None of the mentioned

1 Answers  

---

 Which class can help to select a method? a) Nonoptional argument b) Class c) Method d) None of the method

1 Answers  

---