0% found this document useful (0 votes)
24 views3 pages

Cst401-Draft Scheme Dec 202

Uploaded by

tkm21cs036
Copyright
© © All Rights Reserved
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% found this document useful (0 votes)
24 views3 pages

Cst401-Draft Scheme Dec 202

Uploaded by

tkm21cs036
Copyright
© © All Rights Reserved
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/ 3

DRAFT SCHEME

1000CST401122205

Scheme of Valuation/Answer Key


(Scheme of evaluation (marks in brackets) and answers of problems/key)
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
B.Tech Degree S7 (R, S) / S7 (PT) (R) Examination December 2023 (2019 Scheme)
Course Code: CST401
Course Name: ARTIFICIAL INTELLIGENCE
Max. Marks: 100 Duration: 3 Hours

PART A
Answer all questions, each carries 3 marks. Marks

1 Definition of PEAS – 1.5 marks (3)


PEAS description of self driving car – 1.5 marks
2 Definitions of episodic and sequential environment with example – 3 marks (3)
3 State space representation of 8- queens problem – 3 marks (3)
4 Infrastructure for solving a problem- State, parent, Action, Path cost – 3 marks (3)
5 Properties of min max algorithm – 3 marks (3)
6 Definition of CSP – 1.5 marks (3)
Example – 1.5 marks
7 Modus ponens and modus tollens with example – 1.5 marks each (3)
8 Disadvantages of propositional logic – 3 marks (3)
9 Definition of cross validation in learning – 3 marks (3)
10 Differences between supervised and unsupervised learning with example – 3 (3)
marks
PART B
Answer one full question from each module, each carries 14 marks.
Module I
11 a) Learning agent explanation – 4 marks, diagram – 4 marks (8)
b) Different important stages in history of AI – 6 marks (6)
OR
12 a) Model based reflex agent explanation – 4 marks (8)
Diagram – 4 marks
b) Four aspects of AI – 1.5 marks each (6)
Module II

Page 1of 3
DRAFT SCHEME
1000CST401122205

13 a) BFS Algorithm – 8 marks (14)

Expand the nodes of S and put in the CLOSED list

Initialization: Open [A, B], Closed [S]

Iteration 1: Open [A], Closed [S, B]

Iteration2: Open[E,F,A],Closed[S,B]
: Open [E, A], Closed [S, B, F]

Iteration3: Open[I,G,E,A],Closed[S,B,F]
: Open [I, E, A], Closed [S, B, F, G]

Hence the final solution path will be: S----> B----->F----> G

Solution with steps – 6 marks


OR
14 a) Depth Limited Search algorithm – 4 marks (8)
Example – 4 marks
b) Admissibility and optimality explanation – 6 marks (6)
Module III
15 a) SEND + MORE = 9567 + 1085 = 10652 – Solution with steps – 14 marks (14)
OR
16 a) Tree after pruning at each step using alpha beta pruning – 14 marks (14)
Module IV
17 a) Syntax and semantics of predicate logic with examples – 10 marks (10)
b) Definition of entailment with example – 4 marks (4)
OR
18 a) Covert the sentences into predicate logic - 2 marks (8)
Convert into CNF – 3 marks
Prove by contradiction with resolution graph – 3 marks
b) Difference between forward and backward chaining – 4 marks (6)
Module V
19 a) Linear regression explanation – 6 marks (14)
Solution with steps – 8 marks
Alpha – 76.665, beta = -1.548

Page 2of 3
DRAFT SCHEME
1000CST401122205

Y = 76.665 – 1.558X
OR
20 a) Working of decision tree- 6 marks (14)
Entropy – 1
Gain of age = 0.6, competition=0.1656, type = 0
Age is the root node
Solution with steps – 8 marks
****

Page 3of 3

You might also like