DRAFT SCHEME

0200MAT236072301

Total Pages:
Scheme of Valuation/Answer Key
(Scheme of evaluation (marks in brackets) and answers of problems/key)
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
Fourth Semester B.Tech Degree (S, FE) Examination January 2024 (2019 Scheme)
Course Code: MAT236
Course Name: MATHEMATICS FOR ARTIFICIAL INTELLIGENCE
Max. Marks: 100 Duration: 3 Hours

PART A
(Answer all questions; each question carries 3 marks) Marks

1 w is closed under vector addition and scalar multiplication So it is a 3

subspace (1+1+1) (𝑥 + 𝑦 ∈ 𝑤, 𝑎𝑛𝑑 𝛼𝑥 ∈ 𝑤)
2 No. They are not linearly independent. so they not form the basis (1+1+1) 3
3 Characteristic equation is |𝐴 − 𝜆𝐼| = 0, 𝜆 + 𝜆 − 6 = 0, 𝜆 = 2, −3 3
Spectrum {2, −3} (1+1+1)
4 Angle 𝜃 = 𝑐𝑜𝑠
,
= 𝑐𝑜𝑠 (1+1+1) 3
‖ ‖‖ ‖ √ √

5 Formula (1) derivatives (1) 𝑇 = 1 + 𝑥 − − + + − ⋯ … … … … (1) 3

! ! ! !

6 J= = [𝑦 𝑥 ] ∈𝑅 × × ×
(1+1+1) 3

7 𝐸(𝑔(𝑋)) = 𝐸(3𝑋 + 1) = 3𝐸(𝑋 + 1) = (1+1+1) 3

8 P(A∪ 𝐵)= (1) (i ) 𝑃(𝐴 ∩ 𝐵) =

5
(ii) P(𝐴 ∩ 𝐵) =
1
(1 + 1) 3
12 12

9 H=
−4 −2
(1 mark) 3
−2 −4
𝐷 = −4 < 0, 𝐷 = 12 > 0 (1 mark)
f(x) is strictly concave (1 mark)
10 Any 3 advantages (1+1+1) 3
PART B
(Answer one full question from each module, each question carries 14 marks)

Module -1
11 a) 1 −1 0 0 3 3 7
Gauss elimination 0 1 0 1 −3 −1 𝑟 < 𝑛 infinite number of
0 0 0 1 −1 −1
0 0 0 0 0 0

Page 1 of 5
 DRAFT SCHEME
0200MAT236072301

solutions (3) 𝑥 = 3 + 𝑠 , 𝑥 = 2𝑠, 𝑥 = 𝑡 , 𝑥 = −1 + 𝑠 , 𝑥 = 𝑠 (4)

b) 23 2 7
(i) 𝐴∅ = 11 1 (2) (𝑖𝑖) 𝑟𝑎𝑛𝑘 = 3 (3) (𝑖𝑖𝑖)𝑘𝑒𝑟∅ = 0 (1) 𝐼𝑚 ∅ =
−31 0
32 1
{(3𝑥 + 2𝑥 + 𝑥 ) , (𝑥 + 𝑥 + 𝑥 ), (𝑥 − 3𝑥 ), (2𝑥 + 3𝑥 + 𝑥 )} (1)
12 a) 1 0 0 0 7
𝐴 0 1
= −3 0 0
1 3 0
−3 0 1 1
b) 𝑇=
1 1 0
(2 marks) 7
−1 0 2
Ker T={(2, −2,1)} (2 mark)
1 1
Range of T= , (1 mark)
−1 0
Dim Ker T=1 and dim ImT =2 (1 mark)
Rank Nullity theorem verification (1 mark)

Module -2
13 a) 7/5 4
Projection 𝑝(𝑥) = 0 (4 marks)
14/5
b) 1⎤ 10
⎡√
⎢ ⎥ 0 0
A=𝑈Ʃ𝑉 (1) 𝑤ℎ𝑒𝑟𝑒 𝑈 = ⎢√ −1⎥ (3) Ʃ = √8 (3)
√ 0 √2 0
⎢ ⎥
⎣√ 1⎦

⎡√ √ √ ⎤
⎢ 0 ⎥
V=⎢√ ⎥ (3)
⎢ √ ⎥
⎣√ √ ⎦
14 a) 2 0 1 2 0 7
⎡0 −1 −1 −1 1⎤
A=⎢⎢0 0 1 0 3⎥
⎥
(3) |𝐴| = 2 ∗ −1 ∗ 𝑑𝑒𝑡𝑒𝑟𝑚𝑖𝑛𝑎𝑛𝑡 𝑜𝑓 𝑙𝑜𝑤𝑒𝑟 𝑟𝑖𝑔ℎ𝑡 3 ×
⎢0 0 3 1 2⎥
⎣0 0 −1 −1 2⎦
3 𝑚𝑎𝑡𝑟𝑖𝑥 (2) |𝐴|=6 (2)

Page 2 of 5
 DRAFT SCHEME
0200MAT236072301

b) 7
𝐴 = 𝐿𝐿 matrix (2) 𝑙 = √𝑎 𝑙 = 𝑙 = 𝑎 −𝑙
√

𝑙 = 𝑎 − 𝑙 +𝑙 𝑙 = (𝑎 − 𝑙 𝑙 ) (5)

Module -3
15 a) 𝑑𝑓 𝜕𝑓 𝜕𝑔 𝜕ℎ ×
𝜕𝑓 1 −1 7
= ∈𝑅 (1) = − exp 𝑧
𝑑𝑥 𝜕𝑧 𝜕𝑦 𝜕𝑥 𝜕𝑧 2 2

= 2𝑦 𝑆 , =𝐼 (1 + 1 + 1)

= −exp (− 𝑥 − 𝜇) 𝑆 (𝑥 − 𝜇) (𝑥 − 𝜇) 𝑆 (3)

b) Formula (2) derivatives (3) 7

𝑓(𝑥, 𝑦) = −15 + 6𝑥 + 7𝑦 + 3(𝑥 − 1) + 2(𝑥 − 1)(𝑦 − 3) + (𝑦 − 3) (2)
16 a) Split the function into small functions and by back propagation find the output 7
b) 𝑓(𝑥, 𝑦) = 5 + (𝑥 − 2)4 + (𝑦 − 3)1 𝑓(2.1,2.99) = 5.39 7
Module -4
17 a) 𝑃(𝐴) = 2/36 𝑃(𝐵) = 6/36 𝑃(𝐶) = 11/36 (3) 7
(𝑖)𝑃(𝐴/𝐶) = (𝑖𝑖)𝑃(𝐵/𝐶) = (1+1)

A and C not independent B and C not independent (2)

b) The marginal distribution p(x)=0.16,0.17,0.11,0.12,0.34 (2) and 7
p(y)=0.26,0.47,0.27 (2)
. . . . . . . .
(i)ans= .
, .
, .
, .
, .
(ii) ans= .
, .
, .
(3)

18 a) 7

Where µ is the mean and σ is the standard deviation.

(4 marks)

Page 3 of 5
 DRAFT SCHEME
0200MAT236072301

Graph of both distributions (3 marks)

b) (i)k=3 (ii) 𝑃( < 𝑋 < ).=26/64 7

𝑖𝑖𝑖. 𝑃(𝑋 > ).=19/27

iv. Mean=3/4 and variance of X=3/80

Module -5
19 a) Drawing graph and finding corner points (4) solution 7
∗ ∗
𝑥 =2 𝑥 = 3 max 𝑧 ∗ = 27 (3)
b) = 2𝑥 − 2𝑥 and = 2𝑥 + 2 − 4𝑥 (1 mark) 7

∇𝑓(0,0) = (0,2) (1 mark)

𝑥 = 0 + 𝑡(0) = 0 𝑎𝑛𝑑 𝑥 = 0 + 𝑡(2) = 2𝑡
𝑓 𝑥 + 𝑡∇𝑓(𝑥 ) = 𝑓(0,2𝑡) = 4𝑡 − 8𝑡

𝑡∗ = 1 4 (1 mark)

∴ 𝑅𝑒𝑠𝑒𝑡 𝑥 = (0, 1 2). (1 mark)

Then ∇𝑓 0, 1 2 = (1,0) (1 mark)

𝑡∗ = 1 2 (1 mark)

𝑥 = ( , 1/2) (1 mark)

20 a) Gradient descent algorithm-formula and explanation 7

b) 𝐿(𝑥, 𝜆) = 2𝑥 −24𝑥 + 2𝑥 −8𝑥 + 200 + 𝜆(𝑥 + 𝑥 − 11) 7
(1 marks)
= 0 𝑖𝑚𝑝𝑙𝑖𝑒𝑠 4𝑥 − 24 + 𝜆 = 0

(1 marks)
= 0 𝑖𝑚𝑝𝑙𝑖𝑒𝑠 4𝑥 − 8 + 𝜆 = 0

(1 marks)
𝑥 + 𝑥 − 11 = 0
(1 marks)
Hence 𝑥 = 15/2 and 𝑥 = 7/2
(2 marks)

Page 4 of 5
 DRAFT SCHEME
0200MAT236072301

Minimum value
(1 mark)

*********

Page 5 of 5