0% found this document useful (0 votes)
12 views

ML Model-1

This document is a model question paper for the Machine Learning subject for IV B.Tech - I semester students at Malla Reddy Engineering College. It includes a variety of questions across five modules, covering topics such as file processing in Python, decision tree learning, back propagation algorithm, and KNN algorithm. The paper is designed for a duration of 3 hours with a maximum score of 70 marks, requiring students to answer all questions.

Uploaded by

sravani16.2003
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
12 views

ML Model-1

This document is a model question paper for the Machine Learning subject for IV B.Tech - I semester students at Malla Reddy Engineering College. It includes a variety of questions across five modules, covering topics such as file processing in Python, decision tree learning, back propagation algorithm, and KNN algorithm. The paper is designed for a duration of 3 hours with a maximum score of 70 marks, requiring students to answer all questions.

Uploaded by

sravani16.2003
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

MALLA REDDY ENGINEERING COLLEGE (AUTONOMOUS)

(Affiliated to JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD)


Gundlapochampally (H), Maisammaguda (V), Medchal (M), Medchal-Malkajgiri (Dist), Hyderabad

IV B.TECH - I SEM (MR 21) MODEL QUESTION PAPER


Name of the Subject:Machine Learning(B1210) BRANCH: CSE
Duration: 3 Hours Max Marks:70
Answer all the questions.
All the questions Carries equal marks.

Q.
Questions MARKS BT levels CO
No
1 Module –I 14 L2 1
Explain file processing in Python with examples?
OR
2 a) Differentiate sets and dictionaries. 7+7 L4 1
b) Explain candidate elimination algorithm.
L2

3 Module –II 14 2
a) Determine decision tree learning algorithm.with example L4

OR
4 a) Explain back propagation algorithm. 7+7 L2 2
b).Explain sample theory in neural networks.
L2

5 Module –III 7+7 L2 3


a) Explain maximum likelihood and Least Squared Error
Hypothesis. L4
b) Determine parallelizing Genetic Algorithms.
OR
6 Write KNN algorithm and the importance of IBL(instance 14 L1 3
based learning)
7 Module –IV 7+7 L2 4
a) Explain inverting resolution.
b) Describe explanation-Based Learning of Search Control L2
Knowledge.
OR
8 a) List the remarks of lazy and eager learning. 7+7 L1 4
b) Explain inductive and analytical problems. L2
9 Module –V 7+7 L1 5
a) State KBANN algorithm
b) Explain Inductive-Analytical Approaches to Learning. L2

OR
10 a).Define the relationship to dynamic programming in 7+7 L1 5
reinforcement learning.
L2
b). Explain Q-learning.

Signature of the Faculty HOD-CSE

You might also like