Explain where you use + operator in Prolog?
Answer / chaitanya
Operator + can be used to negate goals; these are either sub-goals in the body of a rule or sub-goals of a query. We cannot negate facts or the heads of rules.
Is This Answer Correct ? | 0 Yes | 0 No |
Mention what is the difference between = and = = in Prolog?
What is the output of the given statement in LISP? * (Setf part-bins (make-array ‘(4))) a) #Done b) #4 c) #(0 0 0 0) d) None of the mentioned
What is the output of the given statement? * (defclass article() ((title :accessor article-title :initarg :title) (author :accessor article-author :initarg :author))) * (defclass computer-article (article) ()) * (defclass business-article (article) ()) * (defclass political-article (article) ()) * (setf articles (list (make-instance ‘business-article :title “Memory Prices down”))) a) Business article b) Political article c) Business article
What should be used with structure names with a combination? a) Make- b) Make c) Create d) Deploy
What is the output of the given statement in LISP? * (Setf part-bins (make-array ‘(4))) * (setf (aref part-bins 0) ‘nails); * (setf (aref part-bins 1) ‘nuts); * (setf (aref part-bins 2) ‘bolts) * (setf (aref part-bins 3) ‘bike) * (aref part-bins 2) * (setf (aref part-bins 4) ‘car) a) Nails b) Nuts c) 2 d) Error
What is the output of the following statement? * (setf x ‘outside) * (let ((x ‘inside) (y x)) (list x y)) a) Outside b) Inside c) Inside Outside d) Outside Inside
Which hides details behind abstraction boundaries? a) Procedures b) Procedure abstraction c) Recursion d) Both a & b
Explain List of programming languages for artificial intelligence?
What is the process of reserving a place in computer memory to store a value for a symbol? a) Storing b) Ranging c) Binding d) None of the mentioned
What is the other name of boxes in LISP? a) Cons cells b) Conses c) Both a & b d) None of the mentioned
Explain List of artificial intelligence projects?
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