Seat No.: ________ Enrolment No.

___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER–VII (NEW) EXAMINATION – SUMMER 2022
Subject Code:3171105 Date:06/06/2022
Subject Name:Introduction of Artificial Intelligence
Tim[Link] 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) What are Artificial Intelligence Problems? 03

(b) Give the difference between Artificial Intelligence and Machine Learning. 04
(c) Discuss the recent development of AI and its significance in brief. 07

Q.2 (a) Explain the concept of problem-Solving by searching. 03

(b) Explain the constraint satisfaction problem. 04
(c) Explain any one State-space Search technique. 07
OR
(c) Explain any one Heuristic Search technique. 07

Q.3 (a) Explain problem reduction. 03

(b) List advantages and disadvantages of brute force Problem-Solving method. 04
(c) Explain Algorithm A*, Admissibility of A*, and Iterative Deepening A* 07
OR
Q.3 (a) Explain Production Systems Characteristics. 03
(b) Explain the Recursive best-first search technique. 04
(c) Explain branch and bound algorithm techniques. 07

Q.4 (a) Enlist components of a planning system. 03

(b) Explain Forward state-space planning. 04
(c) Explain Goal stack planning. 07
OR
Q.4 (a) Explain Hierarchical planning. 03
(b) Explain Backward state-space planning. 04
(c) Explain Plan space Planning. 07

Q.5 (a) Explain the concept of text generation. 03

(b) Explain Parsing techniques. 04
(c) Explain the concept of Natural language processing systems. 07
OR
Q.5 (a) Explain the MIN MAX algorithm. 03
(b) Explain the alpha-beta technique. 04
(c) Explain the concept of Heuristics in-game tree search. 07

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

1
 Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE – SEMESTER- VII EXAMINATION-SUMMER 2023
Subject Code: 3171105 Date: 17/06/2023
Subject Name: Introduction of 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 Artificial Intelligence (AI)? Why we need AI? 03

(b) List and discuss the applications of AI. 04
(c) How an algorithm’s performance is evaluated? Compare different uninformed 07
search strategies in terms of the four evaluation criteria.

Q.2 (a) Discuss the concept of “Heuristic” with an example. 03

(b) What is the significance of the “Turing Test” in AI? Explain how it is performed. 04
(c) What is production system? Explain characteristics of production system. 07
OR
(c) Explain how a problem can be analyzed based on its characteristics. Analyze the 07
game of “8-Puzzle” based on these characteristics

Q.3 (a) Define agent. Explain how agents interact with environment. 03
(b) Explain why problem formulation must follow goal formulation. 04
(c) What do you understand by formulating problems? Explain the steps of problem 07
formulation using vacuum world example.
OR
Q.3 (a) Differentiate between depth-first search and depth-limited search. 03
(b) Explain use of route-finding algorithm for airline travel planning system. 04
(c) Describe Breadth First Search. Comment on the optimality of this method. 07

Q.4 (a) What is propositional logic? 03

(b) Briefly discuss Admissibility of A* searching algorithm. 04
(c) Using suitable example, explain the Brute Force problem-solving technique. 07
Also, write its advantages and disadvantages.
OR
Q.4 (a) Define refinement in planning problem. 03
(b) Describe differences and similarities between problem solving and planning. 04
(c) Explain branch and bound algorithm using suitable example. Also, write its 07
advantages and disadvantages.

Q.5 (a) Explain how Natural language generation will influence on content marketing. 03
(b) Briefly explain ABSTRIPS approach of problem solving. 04
(c) What do you mean by goal stack planning? Explain using suitable example. 07
OR
Q.5 (a) What do you mean by natural language processing? Why it is required? 03
(b) Briefly explain top-down parsing technique. 04
(c) Simulate the working of Tic-Tac-Toe problem with Mini-Max technique. 07

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

1
 Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER–VII (NEW) EXAMINATION – SUMMER 2024
Subject Code: 3171105 Date:30-05-2024
Subject Name: Introduction of Artificial Intelligence
Tim[Link] 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) What is an Artificial Intelligence (AI) technique? 03

(b) Discuss production systems. 04
(c) Explain how the components of agent programs work. 07

Q.2 (a) Define: (i) Intelligence (ii) Rationality (iii) Logical reasoning. 03
(b) What are problem solving agents? State their features? 04
(c) Explain breadth first strategy using suitable example. 07
OR
(c) Explain depth first strategy using suitable example. 07

Q.3 (a) When would best first search be worse than simple breadth first search? 03
(b) Show how means-ends analysis could be used to solve the problem of getting 04
from one place to another. Assume that the available operators are walk, drive,
take the bus, take a cab, and fly.
(c) Write short note on Hill Climbing search technique. 07
OR
Q.3 (a) List and explain things needed to build a system to solve a particular problem. 03
(b) What do you mean by constraint satisfaction? 04
(c) Write short note on Best-first search technique. 07

Q.4 (a) Define planning. Distinguish planning and doing with respect to computer 03
problem solving behavior.
(b) Discuss the components of planning system. 04
(c) What are heuristic functions? Explain the A* algorithm with an example? 07
OR
Q.4 (a) Write advantages and disadvantages of Brute force algorithm. 03
(b) Why does the search in game playing programs always proceed forward from 04
the current position rather than backward from a goal state?
(c) Explain goal stack planning using simple blocks world problem. 07

Q.5 (a) What do you mean by natural language processing? Why it is important? 03
(b) Enlist all spell checking techniques. Explain any one spell checking techniques 04
in brief.
(c) Using suitable example, explain the minimax search procedure. 07
OR
Q.5 (a) What is forward pruning? 03
(b) Briefly explain parsing technique. 04
(c) Explain semantic analysis using suitable example. 07

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

1
 Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER–VII (NEW) EXAMINATION – WINTER 2021
Subject Code:3171105 Date:27/12/2021
Subject Name: Introduction of Artificial Intelligence
Tim[Link] 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) Define Artificial Intelligence (AI). Why do we need AI? 03

(b) Discuss latest trends in the field of AI? 04
(c) Write short note on production systems. 07

Q.2 (a) How Artificial intelligence and Machine Learning differ from each other. 03
(b) Define the term “agent”. Explain how agent interacts with environments. 04
(c) List and explain applications of AI. 07

OR

(c) List and explain five components of problem definition. 07

Q.3 (a) What do you mean by optimal solution? 03

(b) Discuss difference between Breadth first search and depth first search techniques. 04
(c) What is difference between toy problem and real-world problem? Explain toy 07
problem with suitable example.

OR

Q.3 (a) What is the use of computer vision in AI? 03

(b) Discuss issues with hill climbing. 04
(c) Explain Breadth first search using suitable example. 07

Q.4 (a) What do you mean by topological sorting? 03

(b) Briefly explain constraint satisfaction problem. 04
(c) Explain Brute Force problem solving method using suitable example. 07

OR

Q.4 (a) What is a heuristic function? 03

(b) List advantages and disadvantages of Branch & bound algorithm. 04
(c) Consider the following graph (Figure-1), the numbers written on edges represent the 07
distance between the nodes and the numbers written on nodes represent the heuristic
value.
Find the most cost-effective path to reach from start state “A” to final state “J” using
A* Algorithm.

1
Q.5 (a) List out the component of a planning system. 03
(b) What is parsing techniques in AI? 04
(c) How alpha-beta pruning can improve MIN MAX algorithm? Explain using suitable 07
example.

OR

Q.5 (a) What is hierarchical AI planning? 03

(b) What is difference between Forward state space planning and Backward state space 04
planning?
(c) List and explain Components of Natural Language processing in AI 07

Figure-1

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

2
Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER–VII (NEW) EXAMINATION – WINTER 2022
Subject Code:3171105 Date:07-01-2023
Subject Name:Introduction of Artificial Intelligence
Tim[Link] 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) List-out different techniques in AI. 03
(b) List-out generated problems in AI. Explain in Detail. 04
(c) What is AI in technical terms? Explain its historical background. 07

Q.2 (a) List-out Heuristic Search Techniques of AI. 03

(b) What is Iterative deepening? Explain in detail. 04
(c) What is breath first search? Explain in detail. 07
OR
(c) What is depth first search? Explain in detail. 07

Q.3 (a) What is Branch and Bound? 03

(b) Explain Refinement Search in detail. 04
(c) Explain Algorithm A* with suitable example. 07
OR
Q.3 (a) What is Admissibility of A*. 03
(b) Explain Interactive Deepening A*. 04
(c) Short Note: Recursive best first search. 07

Q.4 (a) What is mini-max in game theory? 03

(b) Short note: Heuristics in game tree search. 04
(c) Explain in detail: Forward State Space Planning. 07
OR
Q.4 (a) What is Alpha bita in game tree search? 03
(b) Write down the components of Planning Systems. Explain shortly. 04
(c) Explain in detail: Backward State Space Planning. 07
Q.5 (a) What is Plan Space Planning? Explain Shortly. 03
(b) Explain Goal Stack Planning In detail. 04
(c) Draw a flowchart of Text generation of Neural Network and Explain in 07
detail.
OR
Q.5 (a) What is Hierarchical planning? Explain Shortly. 03
(b) How mechanical translation accrue in neural network? 04
(c) Short note: Grammars, Parsing Techniques 07

1
 Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER–VII (NEW) EXAMINATION – WINTER 2023
Subject Code:3171105 Date:16-12-2023
Subject Name: Introduction of 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) Define Artificial Intelligence (AI). Explain the need of AI. 03
(b) Discuss latest trends in the field of AI. 04
(c) List and explain the applications of AI in detail. 07

Q.2 (a) What are the advantages of AI? 03

(b) Explain using appropriate diagram: How agent interacts with environment. 04
(c) What is problem solving by searching? Explain using suitable example. 07
OR
(c) List uninformed search techniques. Explain any one uninformed search 07
techniques using example.

Q.3 (a) List and explain applications of breadth first search. 03

(b) Briefly discuss admissibility of A* algorithm. 04
(c) Write short note on Brute Force problem solving technique. 07
OR
Q.3 (a) What is meaning of finding optimal path? Explain in brief. 03
(b) Explain working steps of A* searching algorithm. 04
(c) Write short note on Branch and Bound algorithm. 07

Q.4 (a) What do you mean by optimal path? Why it is important? 03

(b) Explain the disadvantages of forward state space planning. 04
(c) Explain in detail: Recursive best first search. 07
OR
Q.4 (a) What is Game Theory? 03
(b) Explain components of planning system. 04
(c) Write short note on back ward state space planning. 07

Q.5 (a) What is the difference Between Natural Language Processing (NLP) and Text 03
Mining?
(b) What is Natural Language Processing in AI? Explain. 04
(c) Explain working of Mini-max algorithm using suitable example. 07
OR
Q.5 (a) Define Parsing in the context of Natural Language Processing. 03
(b) What is transfer model? What is its use in machine translation systems? 04
(c) Explain Alpha-Beta pruning using suitable example. 07

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