In LISP, the function assigns . the value of a to b is (setq a b) (setq b a ) None of these (set b = a) (b = a) TRUE ANSWER : ? YOUR ANSWER : ?
In LISP, the function X (x). (2x+l) would be rendered as (lambda (x) (+1 (* 2x) (* lambda(x) (+2x1) None of these (lambda (x) (+(*2 x)l)) (+ lambda (x) 1 (*2x)) TRUE ANSWER : ? YOUR ANSWER : ?
The new organization established to implement the Fifth Generation Project is called: MCC (Microelectronics and Computer Technology Corporation) None of these MITI (Ministry of International Trade and Industry) ICOT (Institute for New Generation Computer Technology) SCP (Stategic Computing Program) TRUE ANSWER : ? YOUR ANSWER : ?
When a top-level function is entered, the LISP processor do(es) It reads the function entered None of these It evaluates the function and the function's operands It prints the results returned by the function. All of these TRUE ANSWER : ? YOUR ANSWER : ?
In AI programming, a list may contain: None of these pointers fields cells All of these TRUE ANSWER : ? YOUR ANSWER : ?
A computer vision technique that relies on image templates is: binocular vision edge detection None of these model-based vision robot vision TRUE ANSWER : ? YOUR ANSWER : ?
A heuristic is a way of trying __________ To compare two nodes in a search tree to see if one is better than the other is To search and measure how far a node in a search tree seems to be from a goal All of the mentioned To discover something or an idea embedded in a program TRUE ANSWER : ? YOUR ANSWER : ?
Best-First search can be implemented using the following data structure Stack Circular Queue Queue Priority Queue TRUE ANSWER : ? YOUR ANSWER : ?
ART (Automatic Reasoning Tool) is designed to be used on: LISP machines microcomputers All of these None of these personal computers TRUE ANSWER : ? YOUR ANSWER : ?
A network with named nodes and labeled arcs that can be used to represent certain natural language grammars to facilitate parsing. Star Network Transition Network None of these Tree Network Complete Network TRUE ANSWER : ? YOUR ANSWER : ?