CS-14 Intelligent Systems July- 2004
Question Paper Of CS-14 Intelligent Systems July- 2004
Q.l(a) Can a system engaged in purely numeric computation be called an intelligent system? Explain with suitable arguments.
(b) What is the output of the following LISP code?
(setq A ‘(BCD))
(car( cdr (cons *A A)))
© What is the output of the following function when invoked with n = 5, and n = 6?
(defun myfun (n)
(cond (( zerop n) -1)
(t
(*(-0 n)
(myfun)
(-n 1)))
)))
(d) Use a truth table to check whether P→Q and ~ P u Q are equivalent formulas or not.
(e) Using an example, show how the technic of “means"-end analysis” helps in achieving a goal state in a problem space.
(f) Given two strings A and B of length n and m, respectively, (M < N). Write an algorithm to find whether B is a substring of A.
(g) Distinguish between “Inductive” and “abductive” forms of reasoning with respect to knowledge-based computing. Give an example of abductive reasoning. Clearly showing why it is not inducthe reasoning
