ARTIFICIAL INTELLIGENCE QUIZ

In LISP, the function (list-length )

All of these

returns a new list that is equal to by copying the top-level element of

returns t if is empty.

returns the length of

None of these

TRUE ANSWER : ?
YOUR ANSWER : ?

The traditional way to exit and LISP system is to enter

None of these

quit

ok

exit

bye

TRUE ANSWER : ?
YOUR ANSWER : ?

A problem is first connected to its proposed solution during the _____ stage.

identification

formalization

conceptualization

testing

implementation.

TRUE ANSWER : ?
YOUR ANSWER : ?

The area of AI that investigates methods of facilitating communication between people and computers is:

robotics

symbolic processing

decision support

None of these

natural language processing

TRUE ANSWER : ?
YOUR ANSWER : ?

LISP machines also are known as:

AI workstations

None of these

All of these

super mini computers

time-sharing terminals

TRUE ANSWER : ?
YOUR ANSWER : ?

Which is true regarding BFS (Breadth First Search)?

BFS will get trapped exploring a single path

BFS is not guaranteed to find a solution if exists

BFS is nothing but Binary First Search

The entire tree so far been generated must be stored in BFS

TRUE ANSWER : ?
YOUR ANSWER : ?

One definition of AI focuses on problem-solving methods that process:

symbols

smell

algorithms

None of these

touch

TRUE ANSWER : ?
YOUR ANSWER : ?

An algorithm A is admissible if ___________

It is not guaranteed to return an optimal solution when one exists

It is guaranteed to return an optimal solution when one exists

It guarantees to return more optimal solutions

It returns more solutions, but not an optimal one

TRUE ANSWER : ?
YOUR ANSWER : ?

Language/Languages used for programming Constraint Programming includes ____________

C

Fortran

C#

Prolog

TRUE ANSWER : ?
YOUR ANSWER : ?

DEC advertises that it helped to create "the world's first expert system routinely used in an industrial environment," called XCON or:

VAX

MAGNOM

PDP-11

None of these

Rl

TRUE ANSWER : ?
YOUR ANSWER : ?