0

CB
2

EC
20
9F
9C
Paper / Subject Code: 37474 / Machine Learining

00
A7

30
2B
24

EC
1T01876 - T.E. Computer Science and Engineering (Artificial Intelligence and Machine Learning) (Choice Based) (R-19-

20
9F
9C
FF

C
00
A7
'C' Scheme)SEMESTER - VI / 37474 - Machine Learining QP CODE: 10038169 DATE: 18/12/2023

30
2B
D7

24

EC
0
9F
C
F
AF

72
7F

0
2B
24

3
1F

0
F
9C
FF
F

2
9
0F
Time: 3 Hours Max. Marks: 80

7
A

2B
D7

24

A
25

1F

0
F
9C
F
F

72
CB

B9
F

7F
FA
0

24
Instructions:

A
25

2
D
00

9F
1

9C
F
F
 Figures to the right indicate max marks.

CB

0F

F
EC

FA

2B
D7

24
25
0
 Draw appropriate diagram whenever applicable.

30

F1

9C
FF
0

F
B
EC
20

A
0
C
 Assume suitable data wherever applicable. State your assumptions clearly.

24
5

FD
00
A7

30

F1

9C
F
B
 Question number 1 is compulsory.

7F
C
0

FA
9F

50
0C

24
72

FD
0
 Attempt any Three questions from remaining questions 2B

B2

F1

FF
C0
A

0 3

A
F
9C

50
0C

7
2

E
9

FD
7

0
B

F1
24

C0
A

B
Q.1 Solve any Four 2

FA
9F
9C
FF

50
0C
2

0E

FD
A7
B

F1
D7

24

A. Explain SVD and its applications? [05]

0
03

CB
2

EC

FA
F
9C
F

50
AF

72
B9
B. Differentiate between supervised and unsupervised learning. [05]
F

00
0

B2

F1
7

24

FA

3
1F

C2
D

C
C. Explain Hebbian Learning rule [05]

0
FF

50
0C
F

72

0E
B9
0F

49
A

B2
D. Explain Perceptron model with Bias. [05]
7

0
FA

03
25

1F

2
D

F2

EC
C

0C
F

72
E. Differentiate between Ridge and Lasso Regression [05]
CB

9
0F

49
A

30
B
7

C0
A
25

1F

2
FD

F2
00

20
9F
9C

0E
CB

0F

7F
EC

A7
A

2B
Q.2 Solve the following
4

03
5

F2
00
30

9F
2

F1

9C
AF

A. Draw a block diagram of the Error Back Propagation Algorithm and explain with the flow

72
B

7F
EC
20

2B
0
C

24

FA
5

chart the Error Back Propagation Concept. [10]

00
A7

30

B2

F1

9C
FF
AF

B9
C
20
9F

B. Find a linear regression equation for the following two sets of data: [10]
50
0C

24
E

C2
FD
A7

30
2B

B2

FF
0

0F
C

49
20

X Y
9F
9C

0C

7
0E

25

1F

FD

F2
A7
2B
24

C0
03

CB

0F

7F
FA
9F
9C
FF

3 12
72

25

FD
00
0
2B

F1
7

24

CB
FD

EC
0

FA
F
9C
FF

0
72

5 18
9

5
00
FA

0
2B

B2

F1
7

24

FA

03
FD

C
F1

9C
FF

50
0C
72

E
9

7 24
FA

0
B
50

B2
D7

24

C0
A

3
2

0
F
F1

C
FF

0C
AF

0E
9
49

A7

9 30
B
50

D7

C0
3
1F

2
F2

20
9F
B2

C
AF

0E
0F

7F

49

7
2B
0C

FA

03
25

1F

FD

Q.3 Solve the following

9C
F
0

72
CB

B9
0F

F
EC

FA

24

A. Diagonalize the matrix A [05]

FA
25

2
D
00

F1

9C
FF
AF
CB

B9
EC

50

1 5
7

24
F

C2
D
00
30

B2

F
AF
F

F
EC

49
20

50
0C

7
1F

FD

F2
A7

30

B2

4 2
C0

0F

7F
20

FA
9F

0C
0E

FD
A7

F1
0
03

CB
EC

FA
9F

0
72

5
0
30
2B

B2

B. Write short note on overfitting and underfitting of model [05]

F1
0
FA

EC
20
9C

50
0C
B9

C. What are activation functions? Explain Binary, Bipolar, Continuous, and Ramp activation
A7

30

B2
24

C0
C2

20
9F
FF

0C
E

functions. [10]
49

A7

30
2B

C0
F2

20
9F
9C

0E
7F

7
2B
24

FA

03
FD

9C
FF

72
B9

38169 Page 1 of 2
FA

D7

24

FA
C2
F1

FF
AF

B9
49
D7
1F

C2
F2
AF

50F1FAFD7FF249C2B9FA72030EC00CB2
0F

7F

49
 F1 FF 9F EC 50
FA 24
9C A7 0 0C
F1
FA
FD 2B 20 B2
0F 7F 30 FD
1F F2 9F
A7
EC 50
F1 7 FF
AF 49 00 FA 24
D7 C2 20 CB 9C
B9 30 25 FD
FF
24 FA EC 0F 7 FF
2B
9F
AF 9C 72 00 1F 24 A7
CB

Q. 6.
D7 2B 03 AF 9C 20
FF 9F 0E 25 D7 2B 30
0F

38169
24 A7 C0 1F FF 9F EC
9C 20 0C AF 24 A7 00
7F 2B 30 B2 9C 20 CB

detail.
F2 9F EC 50 D7 2B 30 25
49 A7 0 0C
F1
FA
FF
24
9F
A7
EC 0F
C2 20 B2 1F
9C 00
B9 30 FD 2BAF 20 CB
50 30
4. Solve the following

7F EC 25
FA F 1 0 9 F E C
D7
49 7 0 F F2 A 0F
Q. 5 Solve the following
C2 20 CB AF 49 00 1F FF
C 72 C A 24
B9 30
E 2 5 D 2 03 B F 9C
FA 0F 7 F B 9 0E 2 5 D
72
C0 1F F 2 FA C 0F 7 F
2B
03
0C AF 49 72 0 0C 1F F 24
9F
B2
5 D C 2 0 A F
A7
0E
0 7 B 3 0 B2 D
9C
2 20
C0 F1 FF 9 F E 5 0 7 B 30
0C FA 24 A C0 F1 FF 9 F EC
B2 FD 9C 72
03
0C F A 24 A 72 00
50 7 2B B2 9C
F1 F F 9F 0 EC 50
FD
7 2 B 0 30
CB
FA 24 F1 F 9F EC 25
B. Explain the Perceptron Neural Network

A7 00 F2 0F
9C 2 F A 0

B. Write a short note on LMS-Widrow Hoff

FD 2 0 3
CB AF 49 7 2 0 1F
7F B9 0 E 25 D C2 0 3
CB AF
F2 FA C 0F 7F B9 0 E 25 D7
49 7 00 1 F F2 F A7 C 0 F FF
C2 20 CB AF 49 00 1F
3 2 C

Page 2 of 2
C A 24
B9 0E 25 D 2 0 3 B F
C. Explain the Maximization algorithm for clustering.
9C

*************
0 D
A. Explain Least-Squares Regression for classification.

FA C0 0F 7F B9 E 25 2
72 0C 1F F2 FA C0 0F 7F
03 B2 A 4 9C 72 0C 1 FA F 24
FD 2 B
5 03 F

50F1FAFD7FF249C2B9FA72030EC00CB2
0E 7 B 2 9C
C0 0 FF 9 0E 5 D7 2B
0C
F1
FA 24 FA C0 0 F1 FF 9F
B2 FD 9C 72
0
0C FA 24
9 A
7 2B 3 F C
Paper / Subject Code: 37474 / Machine Learining

50 0 B2 D
F1 FF 9F EC 50 7F 2B
FA 24 A 0 F1 F 9F
FD 9C 72 0C F A 24 A7
2B 03 B 2 F 9C
A. How to calculate Performance Measures by Measuring Quality of model.

A. Discuss the various steps of developing a Machine Learning Application.

7F 20
F2 9F 0E
C 50 D7
F
2B 3
49 A7 00 F1
FA F 24
9F
A7
C2 20 CB 9C
B9 30 2 FD 20
FA EC 50 7 2B
9
30
72 0 F1
F
FF F A
EC
0C A 24 0
[05]
[05]
[10]
[10]
[10]
[10]

[10]

03 B2 9C 72
0E 50
FD
7F 2 B9 0 30
C0 F1 F F
B. What is the curse of dimensionality? Explain PCA dimensionality reduction technique in

EC
0C FA 24 A7 00
B2 FD 9C 2 0 CB
50 7 FF
2B 3 0
F1 9F EC
FA 24 A 72 00
FD 9C
0 C