Seat No.: ________ Enrolment No.

___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER–VII (NEW) EXAMINATION – WINTER 2021
Subject Code:3170716 Date:13/12/2021
Subject Name:Artificial Intelligence
Time:10:30 AM TO 01:00 PM Total Marks: 70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.
4. Simple and non-programmable scientific calculators are allowed.

Q.1 (a) What is a “control strategy” and what are its characteristics? 03
(b) Describe in brief how Min-Max search procedure works. 04
(c) Enlist and discuss major task domains of Artificial Intelligence. 07
Q.2 (a) Discuss briefly backward reasoning with example. 03
(b) Explain with example how recursive predicate is defined in Prolog? 04
(c) State Water Jug problem. Give its state space representation 07
OR
(c) Explain A* algorithm. What happens if h’ underestimates h and 07
overestimates h?
Q.3 (a) Explain local maxima, plateau and ridge in brief 03
(b) Discuss the approaches to knowledge representation 04
(c) Demonstrate briefly the steps to convert given wff into clause form 07
OR
Q.3 (a) Differentiate Informed & Uninformed search. Give examples. 03
(b) Explain best first search algorithm. 04
(c) Consider the following facts: 07
* Hemant only likes easy courses.
* Science courses are hard.
* All the courses in basketweaving department are
easy.
* BK301 is a basketweaving course.
Use resolution to answer the question,”What course would Hemant
like?”
Q.4 (a) What is certainty factor? 03
(b) Discuss Bayesian network and its application. 04
(c) Explain connectionist models. What is perceptron? What is the concept 07
of back propagation for ANNs?
OR
Q.4 (a) What do you mean by Expert Systems? List out its four applications. 03

(b) Discuss Goal Stack planning 04

(c) Write about various defuzzification methods 07
Q.5 (a) Discuss cut and fail predicate in prolog 03
(b) Describe working principle of Genetic Algorithm 04
(c) What is nonmonotonic reasoning? Explain logics for nonmonotonic 07
reasoning.
OR
Q.5 (a) Write a prolog program to append two given lists into third 03
(b) List out the genetic operators. Describe them briefly 04
(c) Write a note on Natural Language Processing 07

1
Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER–VII (NEW) EXAMINATION – SUMMER 2022
Subject Code:3170716 Date:03/06/2022
Subject Name:Artificial Intelligence
Time:02:30 PM TO 05:00 PM Total Marks: 70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.
4. Simple and non-programmable scientific calculators are allowed.

Q.1 (a) Define AI. What are the task domains of AI? 03
(b) Explain Water Jug problem with Sate Space Search method. 04
(c) Explain Best First Search with suitable example. 07

Q.2 (a) Define the following. 03

1. Modus Ponens 2. Horn Clause 3. Existential Quantifier
(b) Explain Semantic Net with example. 04
(c) Consider the following sentences: 07
 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?”
OR
(c) Explain Forward Reasoning and Backward Reasoning with example. 07

Q.3 (a) Explain Expert System Shell with example. 03

(b) Explain MiniMax search procedure. 04
(c) Explain Artificial Neural Network. 07
OR
Q.3 (a) Draw and explain architecture of Expert System. 03
(b) Show the use of Alpha-Beta pruning. 04
(c) Explain Backpropagation algorithm in Neural Network. 07

Q.4 (a) Briefly explain any one application of Natural Language Processing. 03
(b) A bag I contains 4 white and 6 black balls while another Bag II contains 4 04
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.
(c) Explain Roulette-Wheel selection method of genetic algorithm. 07
OR
Q.4 (a) Enlist and describe different phases involved in Natural Language 03
Processing.
(b) The task is to recognize English alphabetical characters (F, E, X, Y, I, T) 04
in an image processing system. Define two fuzzy sets 𝐼̃ and 𝐹̃ to represent
the identification of characters I and F.
𝐼̃={(F, 0.4), (E, 0.3), (X, 0.1), (Y, 0.1), (I, 0.9), (T, 0.8)}
𝐹̃ ={(F, 0.99), (E, 0.8), (X, 0.1), (Y, 0.2), (I, 0.5), (T, 0.5)}
1
 Find the following.
1. 𝐼̃ ∪ 𝐹̃
2. 𝐼̃ − 𝐹̃
(c) Describe the phases of genetic algorithm. 07

Q.5 (a) Explain planning problem. 03

(b) Explain limitations of Hill Climbing algorithm. 04
(c) Explain Cut and Fail predicates in Prolog. 07
OR
Q.5 (a) Explain how planning is different from search procedure? 03
(b) Compare DFS and BFS. 04
(c) Write a Prolog program to merge two sequentially ordered (ascending) lists 07
into one ordered list.

*************

2
Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER–VII (NEW) EXAMINATION – WINTER 2022
Subject Code:3170716 Date:05-01-2023
Subject Name:Artificial Intelligence
Time:10:30 AM TO 01:00 PM Total Marks:70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.
4. Simple and non-programmable scientific calculators are allowed.
Marks
Q.1 (a) Explain Turing test. 03
(b) What is production system? Discuss the component of production system. 04
(c) What is artificial intelligence? Explain application of AI. 07

Q.2 (a) Write an algorithm for the breadth first search. 03

(b) Why hill climbing is better than generate and test? Write algorithm for 04
simple hill climbing.
(c) Explain the state space search with the use of 8 Puzzle Problem 07
OR
(c) Explain AI Problem characteristics in detail. 07

Q.3 (a) What is heuristic search? Discuss with an example. 03

(b) Explain Problem Reduction using “AND-OR” graph. 04
(c) What do you mean by constraint satisfaction problems? Explain constraint 07
propagation algorithm using suitable example.
OR
Q.3 (a) Differentiate procedural and declarative knowledge. 03
(b) Write a short note on non monotonic reasoning. 04
(c) Write and explain algorithm for resolution in propositional logic with 07
suitable example.

Q.4 (a) Explain forward and backward reasoning. 03

(b) Demonstrate the use of Repeat Predicate in Prolog with example. 04
(c) Explain the various method of knowledge representation with suitable 07
example.
OR
Q.4 (a) Briefly explain perceptron. 03
(b) Explain morphological and syntax analysis phases of NLP. 04
(c) Explain the architecture of expert system with suitable sketch. 07

Q.5 (a) Explain Probability and Bay’s Theorem. 03

(b) Explain the components of planning system. 04
(c) Explain the MiniMax search procedure for Game Playing. Also explain 07
alpha and Beta cut-offs to improve the performance of MinMax procedure.
OR
Q.5 (a) Explain supervised and unsupervised learning. 03
(b) Explain about the basic operators in genetic algorithms. 04
(c) Write following prolog programs: 07
1) To find factorial of a given number.
2) To find the nth element of a given list.
***************
1
Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE – SEMESTER- VII EXAMINATION-SUMMER 2023
Subject Code: 3170716 Date: 28/06/2023
Subject Name: Artificial Intelligence
Time: 10:30 AM TO 01:00 PM Total Marks: 70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.
4. Simple and non-programmable scientific calculators are allowed.

MARKS
Q.1 (a) Explain the “Turing test”. 03
(b) Explain the different issues in Knowledge representation. 04
(c) Enlist and discuss major task domains of Artificial Intelligence. 07

Q.2 (a) Define i) Local Maximum ii) Plateau iii) Ridge 03

(b) Explain Best First Search method. 04
(c) Discuss and Analyze Tower of Hanoi problem with respect to the 07
seven problem characteristics
OR
(c) Explain Water Jug Problem With Example. 07
Q.3 (a) Explain the Backward Reasoning. 03
(b) Discuss with example: Constraint Satisfaction Problem. 04
(c) Explain Semantic Net & Frame with suitable example. 07
OR
Q.3 (a) List out the property of Non monotonic reasoning. 03
(b) Explain the steps of unification in predicate logic. 04
(c) State the Bayes theorem. Illustrate how a Bayesian Network can 07
be used to represent causality relationship among attributes.

Q.4 (a) What is State Space of a Problem? 03

(b) What are the limitations of Propositional Logic? 04
(c) Consider the following sentences: 07
• 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?”
OR
Q.4 (a) Compare Fuzzy Vs Crisp Logic. 03
(b) Explain alpha-beta cut off search with and example 04
(c) Simulate the working of Tic-tac-toe problem with Minimax 07
technique.

Q.5 (a) Explain Hopfield Network. 03

(b) Explain Steps of Natural Language Processing. 04
(c) Write a prolog program to find minimum number from the given 07
input list.
1
 OR
Q.5 (a) Explain Expert System Shells. 03
(b) Explain Cut and Fail Predicate With Example. 04
(c) Explain Various Types of Cross Over Operators in Genetic 07
Algorithm.
*************

2
Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER–VII (NEW) EXAMINATION – WINTER 2023
Subject Code:3170716 Date:14-12-2023
Subject Name: Artificial Intelligence
Time: 10:30 AM TO 01:00 PM Total Marks:70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.
4. Simple and non-programmable scientific calculators are allowed.

Marks
Q.1 (a) What is “Artificial Intelligence and Artificial Intelligence Technique”? 03
(b) Explain the algorithm for steepest hill climbing. 04
(c) Enumerate Classical “Water jug Problem”. Describe the state space for this 07
problem and also give the solution.
Q.2 (a) Differentiate prepositional & predicate logic. 03
(b) What is clausal form? How is it useful? 04
(c) What is A* search? Explain various stages of A* search with an example. 07
OR
(c) Define constraint satisfaction problem (CSP). How CSP is formulated as a 07
search problem?

Q.3 (a) Define Non monotonic reasoning. 03

(b) What is learning? Explain various learning techniques. 04
(c) Write unification algorithm and explain resolution in predicate logic. 07
OR
Q.3 (a) Describe Bayes theorem. 03
(b) Explain local maxima, plateau, and ridge in detail. 04
(c) Differentiate forward chaining and backward chaining with suitable example. 07

Q.4 (a) Explain connectionist models. What is perceptron? 03

(b) Explain mean-end analysis approach to solve AI problems. 04
(c) Describe the Expert System Development Procedure. 07
OR
Q.4 (a) Explain different defuzzification methods. 03
(b) Explain Inference Rules in Propositional Calculus. 04
(c) Explain the Alpha-Beta Cutoffs Procedure in Game Playing. 07

Q.5 (a) Explain morphological and syntax analysis phases of NLP. 03

(b) Explain the algorithm for Backpropagation in Neural Networks. 04
(c) Demonstrate the use of Cut and Fail Predicates in Prolog with example. 07
OR
Q.5 (a) Explain about the basic operators in genetic algorithms. 03
(b) Describe the various steps of Natural language Processing. 04
(c) What are the Applications, Features and Limitations of Prolog? 07
*************

1
 Enrolment No./Seat No_____________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER–VII (NEW) EXAMINATION – SUMMER 2024
Subject Code:3170716 Date:28-05-2024
Subject Name:Artificial Intelligence
Time:02:30 PM TO 05:00 PM Total Marks:70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.
4. Simple and non-programmable scientific calculators are allowed.

MARKS

Q.1 (a) Define the term: Artificial Intelligence. State various applications of 03
Artificial Intelligence.
(b) Enlist and briefly discuss the major task domains of Artificial Intelligence. 04
(c) Explain AI problem characteristics in detail. 07

Q.2 (a) What is meant by control strategy? State the requirements of a good control 03
strategy.
(b) Explain the nonmonotonic reasoning. 04
(c) Consider the water jug problem stated below: 07
You are given two jugs, a 5-litre one and a 4-litre one. Neither has any
measuring marker on it. There is a pump that can be used to fill the jugs
with water. How can you get exactly 2-litre of water into the 4-litre jug?

Explain how this problem can be solved using State Space Search. Also,
give the production rules to solve this problem and derive a feasible
solution using the same.
OR
(c) In the missionaries and cannibals problem, three missionaries and three 07
cannibals must cross a river using a boat which can carry at most two
people, under the constraint that, number of cannibals should be lesser
than or equal to the missionaries on either side. The boat cannot cross the
river by itself with no people on board.

For the above mentioned problem, describe state space representation,

actions, start and end state.

Q.3 (a) Translate these sentences into formulas in predicate logic. 03

1. John likes all kinds of food.
2. Apples are food.
3. Chicken is food.
4. Anything anyone eats and isn’t killed-by is food.
5. Bill eats peanuts and is still alive.
6. Sue eats everything Bill eats.
(b) Discuss the following terms with respect to fuzzy logic theory: 04
- Membership function
- Linguistic variable
(c) Write an objective of hill climbing method. Discuss any one type of hill 07
climbing in detail with its algorithm.

OR
1
Q.3 (a) Write the proposed solution(s) for the problems occurred in hill climbing. 03
(b) Explain the natural language processing steps in brief. 04
(c) Explain forward and backward reasoning with suitable example(s). 07

Q.4 (a) Explain problem reduction using “AND-OR” graph. 03

(b) Discuss goal stack planning in brief. 04
(c) Consider the following facts: 07
(1) Steve only likes easy courses.
(2) Science courses are hard.
(3) All the courses in the HaveFun department are easy.
(4) BK301 is a HaveFun department course.
Use resolution to answer the question “What course would Steve like?”

OR
Q.4 (a) Write the basic differences between declarative and procedural knowledge. 03

(b) Solve the following cryptarithmetic problem using constraint 04

satisfaction.
LEO + LEE = ALL
(c) Explain the minimax search procedure for game playing using suitable 07
example. What is the significance of alpha-beta cut-offs?

Q.5 (a) Write a brief note on best-first Search. 03

(b) Write a prolog program to count the number of elements present in the 04
given list.
(c) Discuss different types of learning in artificial neural networks. Also write 07
the differences between/among them.
OR
Q.5 (a) State the factors which may make understanding of natural language 03
difficult for a computer.

(b) Write a prolog program to demonstrate the use of cut and fail predicates. 04

(c) Explain Hopfield networks. 07

*************