Artificial Intelligence — Summer 2025

Differentiate between strong AI and weak AI.

What is Artificial Intelligence? List the various applications of Artificial Intelligence.

Trace the constraint satisfaction procedure solving the following cryptarithmetic problem. R I N G + D O O R ----------------------------- B E L L

What is A* search? Describe the different stages of A* search with an example.

Discuss forward reasoning in brief.

Consider following sentences: • John likes all kinds of food. • Apples are food. • Chicken is food. • Anything anyone eats and isn’t killed by is food. • Bill eats peanuts and is still alive. • John eats everything Bill eats. (1)Translate these sentences into formulas in predicate logic. (2)Prove that John likes peanuts using Backward chaining.

Explain Hill Climbing method in brief.

Differentiate propositional logic and predicate logic.

Explain non-monotonic reasoning in detail.

Explain Minimax search procedure with suitable example.1

Describe the steps involved in unification in predicate logic.

Explain expert systems architecture in brief.

State the Bayes’ theorem. Illustrate how a Bayesian Network can be used to represent causality relationship among attributes.

Explain Hierarchical planning in brief.

Explain syntax and semantic analysis phases of Natural Language Processing.

Discuss the termination parameters used in genetic algorithms in detail.

What is Natural Language Processing? Discuss applications of NLP in brief.

Discuss goal stack planning in brief.

Explain various genetic operators used in genetic algorithms in brief.

Differentiate between DFS and BFS.

What is Artificial neural network? Explain with example.

Write a prolog program to demonstrate the use of cut and fail predicates.

Differentiating between breadth-first search and best-first search algorithm.

Discuss Hopfield network in brief.

Write a prolog program to find minimum number from the given input list.2