1. Which search method takes less memory ?

a) Depth-First Search
b) Breadth-First search
c) Linear Search
d) Optimal search

Answer. Depth-First Search



2. A heuristic is a way of trying ?

Answer.
• To compare two nodes in a search tree to see if one is better than the other
• 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



3. How do you represent "All dogs have tails" ?

Answer. x: dog(x) ahastail(x)



4. Which is not a property of representation of knowledge ?

a) Representational Verification
b) Representational Adequacy
c) Inferential Adequacy
d) Inferential Efficiency

Answer. Representational Verification



5. A series of Artificial Intelligence systems, developed by Pat Langley to explore the role of heuristics in scientific discovery is ?

Answer. BACON



6. What kind of behavior does the stochastic environment posses ?

Answer. Local



7. Which is used to select the particular environment to run the agent ?

a) Environment creator
b) Environment Generator
c) Both Environment creator & Generator
d) None of the mentioned

Answer. Environment Generator



8. Which environment is called as semi dynamic ?

a) Environment does not change with the passage of time
b) Agent performance changes
c) Environment will be changed
d) Environment does not change with the passage of time, but Agent performance changes

Answer. Environment does not change with the passage of time, but Agent performance changes



9. Where does the performance measure is included ?

Answer. Task environment



10. Which is used to provide the feedback to the learning element ?

a) Critic
b) Actuators
c) Sensor
d) None of the mentioned

Answer. Critic