Practice Exam
Questions
1. In what way does forward modeling link to both psychology and cognitive robotics?
2. How would an algorithm find the maximum in a set of numbers?
3. How are computers represented as Weak AI’s in the Chinese Room experiment?
4. What was the difference between ELIZA and PARRY, and what were their
similarities?
5. How does MYCIN emulate the decision-making ability of a human expert?
6. What does the parallel distributed processing model of human memory address?
7. What are the three different types of machine learning and what are each of their
characteristics?
8. A knowledge base and inference engine work together in expert systems. However,
what are the two main ways to control the use of knowledge when solving problems
and what are the differences between them?
9. A form of a specific type of algorithm is shown in the figure below. What type of
usage of inference engine is this? How can you see this?
10. How does depth-first search in basic search minimize the number of examined
paths? When would you use this type of algorithm?
Questions
1. In what way does forward modeling link to both psychology and cognitive robotics?
2. How would an algorithm find the maximum in a set of numbers?
3. How are computers represented as Weak AI’s in the Chinese Room experiment?
4. What was the difference between ELIZA and PARRY, and what were their
similarities?
5. How does MYCIN emulate the decision-making ability of a human expert?
6. What does the parallel distributed processing model of human memory address?
7. What are the three different types of machine learning and what are each of their
characteristics?
8. A knowledge base and inference engine work together in expert systems. However,
what are the two main ways to control the use of knowledge when solving problems
and what are the differences between them?
9. A form of a specific type of algorithm is shown in the figure below. What type of
usage of inference engine is this? How can you see this?
10. How does depth-first search in basic search minimize the number of examined
paths? When would you use this type of algorithm?
