AI Robotics Interview Questions
Questions Answers Views Company eMail

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

175

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

343

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

1 362




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 943

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 1358

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

173

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

355

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

367




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

487

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

1 466

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

349

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

665

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

1 668

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

229

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

1 888


Post New AI Robotics Questions






Un-Answered Questions { AI Robotics }

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

229


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

434


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

210


Which technology uses miniaturized accelerometers and gyroscopes? a) Sensors b) Actuators c) MEMS d) None of the mentioned

353


What is not represented by using propositional logic? a) Objects b) Relations c) Both a & b d) None of the mentioned

181


Which are necessary for an agent to solve an online search problem? a) Actions b) Step-cost function c) Goal-test d) All of the mentioned

399


Hill climbing sometimes called ____________ because it grabs a good neighbor state without thinking ahead about where to go next. a) Needy local search b) Heuristic local search c) Greedy local search d) Optimal local search

478


he process of removing detail from a given state representation is called______. a) Extraction b) Abstraction c) Information Retrieval d) Mining of data

319


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

343


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

300


Stochastic hill climbing chooses at random from among the uphill moves; the probability of selection can vary with the steepness of the uphil1 move. a) True b) False

300


Though local search algorithms are not systematic, key advantages would include a) Less memory b) More time c) Finds a solution in large infinite space d) No optimum solution

227


How the new states are generated in genetic algorithm? a) Composition b) Mutation c) Cross-over d) Both b & c

628


Which environment is called as semidynamic? a) Environment does not change with the passage of time b) Agent performance changes c) Environment will be changed d) Both a & b

207


The BACKTRACKING-SEARCH algorithm in Figure 5.3 has a very simple policy for what to do when a branch of the search fails: back up to the preceding variable and try a different value for it. This is called chronological-backtracking. It is also possible to go all the way to set of variable that caused failure. State whether True or False. a) True b) False

438