1. Single choice ( 3 marks per question) 1. Which of the following is false( ) a. The knowledge engineer and human expert discuss the knowledge required of the expert system. b. The knowledge engineer makes all of the key decisions on which knowledge to put into the expert system. c. The knowledge engineer encodes the knowledge in the Expert System d. The expert evaluates the expert system to ensure that it is correct 2. Artificial Intelligence is a subject of ( ) a. Mathematics and Physiology b. Psychology and Physiology c. Linguistics d. Comprehensive interdisciplinary and marginal disciplines 3. Which of the following is not an area of artificial intelligence research ( ) a. Machine learning b. Image processing c. Natural Language processing d. Principles of compilation 4. Which of the following is a Turing test? ( ) a. When A machine talks to a human and the two ask each other and the human cannot tell whether the machine is a human or a machine, then we can sat it passes the Turing test. b. A machine passes the Turing test when it tricks the tester so that the questioner cannot tell whether it is a human or a machine c. When one person has more intelligence than the other in a conversation, then we can say the more intelligent person has passed the Turing Test d. When two machines talk and one machine is more intelligent than the other, then we can say the more intelligent machine passes the Turing Test 5. Machine translation belongs to which of the following fields of application? ( ) a. Natural language system b. Machine learning c. Expert system d. Human sensory 6. In addition to knowledge base, the main components of expert system include ( ) a. Interpretation Module b. Man-machine interface c. Knowledge acquisition module d. Inference machine 7. Which of the following search algorithms is complete ( ) a. Breadth First search b. Depth first search c. Deletion policy d. Linear input strategy 8. For the training data, the greater its information entropy is, the more information it contains.( ) a. No b. Yes 9. If we want to carry out UCS, which of the tool we'd better use( ) a. Stack b. Queue c. Priority queue d. All of the above 10. When using the A algorithm, for f(x)=g(x)+h(x), if g(x)=0, then this algorithm becomes () a. UCS b. Greedy search c. DFS d. BFS