The document provides a question bank for a mid-semester AI examination containing 16 questions. The questions cover a range of topics in AI including heuristics for the Blocks world problem, AI problem characteristics, predicate logic, resolution, limitations of hill climbing search, Bayesian networks, fuzzy logic, scripts, semantic nets, property inheritance, frames, Prolog programs for sum calculations, natural language processing steps and techniques like semantic and syntactic analysis, and a game tree problem involving mini-max search and alpha-beta pruning.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0 ratings0% found this document useful (0 votes)
571 views
AI Question Bank
The document provides a question bank for a mid-semester AI examination containing 16 questions. The questions cover a range of topics in AI including heuristics for the Blocks world problem, AI problem characteristics, predicate logic, resolution, limitations of hill climbing search, Bayesian networks, fuzzy logic, scripts, semantic nets, property inheritance, frames, Prolog programs for sum calculations, natural language processing steps and techniques like semantic and syntactic analysis, and a game tree problem involving mini-max search and alpha-beta pruning.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1
Question Bank for Mid Semester Examination
1. Describe different heuristics for the Blocks world problem.
2. Discuss with examples: AI Problem Characteristic. 3. Consider the following sentences: • Raj likes all kinds of food. • Apples are food. • Anything anyone eats and isn’t killed by is food. • Sachin eats peanuts and is still alive. • Vinod eats everything Sachin eats. Now, attempt following: i. Translate these sentences into formulas in predicate logic ii. Use resolution to answer the question, “What food does Vinod eat?” 4. Discuss limitations of Hill climbing search method. 5. Explain Bayesian networks with example. 6. Discuss the following: Fuzzy Logic 7. Define Scripts. Write conceptual dependency for following statements. a) John flew to New York. b) John shot Mary. c) John ate eggs. 8. Describe the components of a semantic net. 9. Explain property inheritance algorithm with example. 10. Define Frames. Draw Semantic Net for following statements. a) Every kid likes candy. b) Every school going kid likes candy. 11. Write following prolog programs: i. To find the sum of first n natural numbers. ii. To append List2 to List1 and bind the result to List3. 12. Write a prolog program to find sum of all the numbers of a list. 13. Write a Prolog program to find factorial of a given number. 14. Describe the various steps of Natural language Processing. 15. Explain Semantic and Syntactic analysis in NLP. 16. Consider the game tree of Fig. 1 in which the static scores are from first player’s point of view. Suppose the first player is maximizing player. Applying mini-max search, show the backed-up values in the tree. What move will the MAX choose? If the nodes are expanded from left to right, what nodes would not be visited using alpha-beta pruning.