A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

21. What is meant by consistent in state-space search?
a. Change in the desired literals
b. Not any change in the literals
c. No change in goal state
d. None of the mentioned
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).Not any change in the literals

22. What will happen if a predecessor description is generated that is satisfied by the initial state of the planning problem?
a. Success
b. Error
c. Compilation
d. Termination
View Answer Report Discuss Too Difficult! Search Google
Answer: (d).Termination

23. Which approach is to pretend that a pure divide and conquer algorithm will work?
a. Goal independence
b. Sub-goal independence
c. Both a & b
d. None of the mentioned
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).Sub-goal independence

24. In 1985, the famous chess player David Levy beat a world champion chess program in four straight games by using orthodox moves that confused the program. What was the name of the chess program?
a. Kaissa
b. CRAY BLITZ
c. Golf
d. DIGDUG
View Answer Report Discuss Too Difficult!
Answer: (b).CRAY BLITZ

Page 3 of 3