+1-315-636-4485
+91 98151-74050 
This is a computer science engineering quiz on Artificial Intelligence, which includes questions on problem-solving to find desirable solutions.
What is the general term of Blind searching?
Strategies that know whether one non-goal state is “more promising” than another are called ___________
Which of the following is/are Uninformed Search technique/techniques?
Which data structure conveniently used to implement BFS?
Which data structure conveniently used to implement DFS?
Optimality of BFS is ___________
LIFO is ______ where as FIFO is ________
Breadth-first search always expands the ______ node in the current fringe of the search tree.
Depth-first search always expands the ______ node in the current fringe of the search tree.
What was originally called the imitation game by its creator?
Which of the search method takes less memory?
Uniform-cost search expands the node n with the __________
Lowest path cost
Heuristic cost
Highest path cost
Average path cost
To invoke the LISP system, you must enter_____________.
AI
LISP
CL (Common LISP)
Both (B and C)
Programming a robot by physically moving it through the trajectory you want it to follow is called:
Robot vision control
Pick-and-place control
Continuous-path control
Contact sensing control
A heuristic is a way of trying:
To discover something or an idea embedded in a program
To search and measure how far a node in a search tree seems to be from a goal
To compare two nodes in a search tree to see if one is better than the other
All of the above
