Artificial Intelligence Interview Questions
Questions Answers Views Company eMail

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

1 656

 Which is the primitive that creates new structure types in LISP? a) Defnum b) Deftype c) Defstruct d) None of the mentioned

1 550

 What should be used with structure names with a combination? a) Make- b) Make c) Create d) Deploy

1 553




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

1 487

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

1 550

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)) a) Person :sex female :personality nice b) Person :sex c) Sex:Female d) None of the mentioned

1 667

 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)) * (person-personality person-instance-2) a) Female b) Nice c) Person d) Both a & b

1 543

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)) * (person-p ‘(this is a list — not a person instance)) a) Female b) Nice c) T d) Nil

1 624

 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 981

. What is the output of the given statement? * (defstruct employee (length-of-service 0) (payment ‘salary)) * (setf employee-example (make-employee)) * (employee-length-of-service employee-example) a) T b) NIL c) 0 d) Error

1 609

What is a data type in which expressions are stored in places identified by integer indexes in LISP? a) Structure b) List c) Array d) None of the mentioned

1 682

 Which symbol holds the first element and also an index in LISP? a) Nail b) Tail c) Initial d) All of the mentioned

1 724

 Which keyword is used to construct an array in LISP? a) Array b) Make-array c) Bins d) Make

1 555

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

1 703

 Which keyword embeds the initial element in an array in LISP? a) Initial b) Initial-content c) Initial-element d) None of the mentioned

1 818







Un-Answered Questions { Artificial Intelligence }

is this artificial intelligence lives over the other software programes and their flexiblity

1255


The room temperature is hot. Here the hot (use of linguistic variable is used) can be represented by _______ . a) Fuzzy Set b) Crisp Set

1357


Though local search algorithms are not systematic, key advantages would include a) Less memory b) More time c) Finds a solution in large infinite space d) No optimum solution

706


Are Bots and Intelligent Agents personal search engines?

1779


Which search uses only the linear space for searching? a) Best-first search b) Recursive best-first search c) Depth-first search d) None of the mentioned

522






To overcome the need to backtrack in constraint satisfaction problem can be eliminated by a) Forward Searching b) Constraint Propagation c) Backtrack after a forward search d) Omitting the constraints and focusing only on goals

858


perform para-a,is true?it's perform or not?

1307


Stochastic hill climbing chooses at random from among the uphill moves; the probability of selection can vary with the steepness of the uphil1 move. a) True b) False

459


Briefly describe 5 ways to do a "table lookup" in SAS.

1069


Solving a constraint satisfaction problem on a finite domain is an/a ___________ problem with respect to the domain size. a) P complete b) NP complete c) NP hard d) Domain dependent

702


Which functions are used as preferences over state history? a) Award b) Reward c) Explicit d) Implicit

445


What is the heuristic function of greedy best-first search? a) f(n) != h(n) b) f(n) < h(n) c) f(n) = h(n) d) f(n) > h(n)

339


Consider the following algorithm: for ( i = 2 ; i <= n ; i++) { for ( j = 0 ; j <= n) { cout << i << j ; j = j + floor(n/4) ; } } (a) What is the output when n = 4 (b) What is the time complexity T(n). You may assume that n is divisible 4.

551


Hill-Climbing algorithm terminates when, a) Stopping criterion met b) Global Min/Max is achieved c) No neighbor has higher value d) Local Min/Max is achieved

1233


Where does the performance measure is included? a) Rational agent b) Task environment c) Actuators d) Sensor

425