Which of the following is not the commonly used programming language for Artificial Intelligence?
a) Perl
b) Java
c) PROLOG
d) LISP
Explanation: Perl is a scripting language. Whereas other programming languages are used to program AI machines.
What is the name of the Artificial Intelligence system
developed by Daniel Bobrow?
a) program known as BACON
b) system known as STUDENT
c) program known as SHRDLU
d) system known as SIMD
Explanation: STUDENT is the name of the Artificial Intelligence system developed by Daniel Bobrow in 1964. Daniel Bobrow had used LISP programming language to write this AI program for his PhD thesis.
What is the function of the system Student?
a) program that can read algebra word problems only
b) system which can solve algebra word problems but not read
c) system which can read and solve algebra word problems
d) None of the mentioned
Explanation: The system STUDENT developed by Daniel Bobrow was written in LISP to read and solve algebra word problems of high school books. This is referred as the achievement in the field of Natural Language Processing.
Which of the following is not an application of artificial intelligence?
a) Face recognition system
b) Chatbots
c) LIDAR
d) DBMS
Explanation: Face recognition system, Chatbots, and LIDAR are the various applications of AI in various fields like security system, business, automobiles etc. DBMS is used to store and manipulate data.
Which of the following machine requires input from the humans but can interpret the outputs themselves?
a) Actuators
b) Sensor
c) Agents
d) AI system
Explanation: Actuators are used in machines to convert energy from one form to another to perform a physical function. The sensor is a device that receives signals from the physical environment to detect the changes. Systems receive input from humans and interpret the outputs.
……number of informed search method are there in
Artificial Intelligence.
a) 4
b) 3
c) 2
d) 1
Explanation: There are four types of informed search methods. The four types of informed search method are best-first search, Greedy best-first search, A* search and memory bounded heuristic search.
