AI Robotics Interview Questions
Questions Answers Views Company eMail

Which is used to compressed gasses to drive (power) the robot ?

121

Which is not the commonly used programming language for AI? a) PROLOG b) Java c) LISP d) Perl e) Java script

167

a) PROLOG b) Java c) LISP d) Perl e) Java script

225

Artificial Intelligence has its expansion in the following application. (Mark all that apply) a) Planning and Scheduling b) Game Playing c) Diagnosis d) Robotics e) All of the above

1 531

Agents behavior can be best described by a) Perception sequence b) Agent function c) Sensors and Actuators d) Environment in which agent is performing

1 646

Rational agent is the one who always does the right thing. State true or false a) True b) False

118

Performance Measures are fixed for all agents. State true or false a) True b) False

195

An omniscient agent knows the actual outcome of its actions and can act accordingly; but omniscience is impossible in reality. Rational Agent always does the right thing; but Rationality is possible in reality. State true or false a) True b) False

162

The Task Environment of an agent consists of a) Sensors b) Actuators c) Performance Measures d) Environment

217

How many types of agents are there in artificial intelligence? a) 1 b) 2 c) 3 d) 4

1 257

 Categorize Crossword puzzle in Fully Observable / Partially Observable. a) Fully Observable b) partially Observable

177

The game of Poker is a single agent. a) True b) False

435

Satellite Image Analysis System is (Choose the one that is not applicable). a) Episodic b) Semi-Static c) Single agent d) Partially Observable

1 228

What is the rule of simple reflex agent? a) Simple-action rule b) Condition-action rule c) Both a & b d) None of the mentioned

136

An agent is composed of, a) Architecture b) Agent Function c) Perception Sequence d) Architecture and Program

403


Post New AI Robotics Questions


Un-Answered Questions { AI Robotics }

 Categorize Crossword puzzle in Fully Observable / Partially Observable. a) Fully Observable b) partially Observable

177


What kind of behavior does the stochastic environment posses? a) Local b) Deterministic c) Ratioanl d) Primary

154


_______________ Is an algorithm, a loop that continually moves in the direction of increasing value – that is uphill a) Up-Hill Search b) Hill-Climbing c) Hill algorithm d) Reverse-Down-Hill search

138


Which of the Following problems can be modeled as CSP? a) 8-Puzzle problem b) 8-Queen problem c) Map coloring problem d) Sudoku

260


The game of Poker is a single agent. a) True b) False

435


 A problem solving approach works well for a) 8-Puzzle problem b) 8-queen problem c) Finding a optimal path from a given source to a destination d) Mars Hover (Robot Navigation)

116


 A problem in a search space Is defined by, a) Initial state b) Goal test c) Intermediate states d) All of the above

97


What can operate over the joint state space? a) Decision-making algorithm b) Learning algorithm c) Complex algorithm d) Both a & b

120


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

227


 Which is used to improve the performance of heuristic search? a) Quality of nodes b) Quality of heuristic function c) Simple form of nodes d) None of the mentioned

212


Specify the agent architecture name that is used to capture all kinds of actions. a) Complex b) Relational c) Hybrid d) None of the mentioned

120


Rational agent is the one who always does the right thing. State true or false a) True b) False

118


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)

99


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

260


Consider a problem of preparing a schedule for a class of student. This problem is a type of a) Search Problem b) Backtrack Problem c) CSP d) Planning Problem

438