Department of Computer science and engineering

3170716
Artificial Intelligence
Question Bank
==================================================================
Unit 1:

Summer 2022:
• Define AI. What are the task domains of AI?

Winter 2022:
• What is artificial intelligence? Explain application of AI.
• Explain AI Problem characteristics in detail.

Summer 2023:
• Enlist and discuss major task domains of Artificial Intelligence.

Winter 2023:
• What is “Artificial Intelligence and Artificial Intelligence Technique”?

Unit 2:

Summer 2022:
• Explain Water Jug problem with Sate Space Search method.
• Explain Best First Search with suitable example
• Explain limitations of Hill Climbing algorithm
• Compare DFS and BFS.

Winter 2022:
• What is production system? Discuss the component of production system.
• Write an algorithm for the breadth first search
• Why hill climbing is better than generate and test? Write algorithm for simple hill
climbing
• Explain the state space search with the use of 8 Puzzle Problem
• What is heuristic search? Discuss with an example.

Summer 2023:
• Define i) Local Maximum ii) Plateau iii) Ridge
 • Explain Best First Search method.
• Explain Water Jug Problem With Example.
• Discuss with example: Constraint Satisfaction Problem
• What is State Space of a Problem?

Winter 2023:
• Explain the algorithm for steepest hill climbing.
• Enumerate Classical “Water jug Problem”. Describe the state space for this problem
and also give the solution.
• What is A* search? Explain various stages of A* search with an example
• Define constraint satisfaction problem (CSP). How CSP is formulated as a search
problem?
• Explain local maxima, plateau, and ridge in detail
• Explain mean-end analysis approach to solve AI problems.

Unit 3:
Summer 2022:
Explain cut and Fail predicate

Winter 2022
Differentiate procedural and declarative knowledge

Summer 23:
 Explain the different issues in Knowledge representation
 Explain the Backward Reasoning.
Winter 2023
 Differentiate prepositional & predicate logic
 Write unification algorithm and explain resolution in predicate logic
 Differentiate forward chaining and backward chaining with suitable example
 Demonstrate the use of Cut and Fail Predicates in Prolog with example
Unit 4:
Summer 22:
1. Consider the following sentences:
Rita likes all kinds of food.
Apples are food.
Anything anyone eats and isn’t killed by is food.
Rahi eats peanuts and is still alive.
Tanvi eats everything Rahi eats.
i. Translate these sentences into formulas in predicate logic.
ii. Use resolution to answer the question, “What food does Tanvi eat?”
 a. bag I contains 4 white and 6 black balls while another Bag II contains 4 white
and 3 black balls. One ball is drawn at random from one of the bags, and it is
found to be black. Find the probability that it was drawn from Bag I.
Winter 2022:
 Differentiate procedural and declarative knowledge
 Write a short note on non monotonic reasoning
 Explain forward and backward reasoning.
 Explain the various method of knowledge representation with suitable
 Example

Summer 2023:

List out the property of Non monotonic reasoning.

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?”

Winter 2023
Define Non monotonic reasoning.

Unit 5:

Winter 2022:
Explain Probability and Bay’s Theorem

Summer 2023
 State the Bayes theorem. Illustrate how a Bayesian Network can be used to
represent causality relationship among attributes.
 Compare Fuzzy Vs Crisp Logic
 Describe Bayes theorem
 Explain different defuzzification methods

Unit 6:
 SUMMER 2022
• Explain MiniMax search procedure.
• Show the use of Alpha-Beta pruning.

WINTER 2022
• Explain the MiniMax search procedure for Game Playing. Also explain alpha and
Beta cut-offs to improve the performance of MinMax procedure.

SUMMER 2023
• Explain alpha-beta cut off search with and example
• Simulate the working of Tic-tac-toe problem with Minimax technique.

WINTER 2023
• Explain the Alpha-Beta Cutoffs Procedure in Game Playing.
Explain Inference Rules in Propositional Calculus

Unit 7:

SUMMER 2022
• Explain planning problem.
• Explain how planning is different from search procedure?

WINTER 2022
• Explain the components of planning system.

Unit 8:

SUMMER 2022
• Briefly explain any one application of Natural Language Processing.
• Enlist and describe different phases involved in Natural Language Processing.

WINTER 2022
• Explain morphological and syntax analysis phases of NLP.

SUMMER 2023
• Explain Steps of Natural Language Processing.

WINTER 2023
• Explain morphological and syntax analysis phases of NLP.
 • Describe the various steps of Natural language Processing.

Unit 9:

SUMMER 2022
• Explain Artificial Neural Network.
• Explain Backpropagation algorithm in Neural Network

WINTER 2022
• Briefly explain perceptron.
• Explain supervised and unsupervised learning

SUMMER 2023
• Explain Hopfield Network.

WINTER 2023
• Explain connectionist models. What is perceptron?
• Explain the algorithm for Backpropagation in Neural Networks.

Unit 10:

SUMMER 2022
● Explain Expert System Shell with example..
● Draw and explain architecture of Expert System.

WINTER 2022
● Explain the architecture of expert system with suitable sketch.

SUMMER 2023
● Explain Expert System Shells.

WINTER 2023
● Describe the Expert System Development Procedure.

Unit 11:

SUMMER 2022
● Explain Roulette-Wheel selection method of genetic algorithm.
 ● Describe the phases of genetic algorithm.

WINTER 2022
● Explain about the basic operators in genetic algorithms.

SUMMER 2023
● Explain Various Types of Cross Over Operators in Genetic Algorithm.

WINTER 2023
● Explain about the basic operators in genetic algorithms.

Unit 12:

SUMMER 2022
● Explain Cut and Fail predicates in Prolog.
● Write a Prolog program to merge two sequentially ordered (ascending) lists into one
ordered list.

WINTER 2022
● Write following prolog programs: 1) To find factorial of a given number. 2) To find the
nth element of a given list.

SUMMER 2023
● Write a prolog program to find minimum number from the given input list.
● Explain Cut and Fail Predicate With Example.

WINTER 2023
● Demonstrate the use of Cut and Fail Predicates in Prolog with example.
● What are the Applications, Features and Limitations of Prolog?