AKTU Machine Learning (KOE073) Question Paper 2024-25
| University | Dr. A.P.J. Abdul Kalam Technical University (AKTU), Lucknow |
|---|---|
| Course | B.Tech, Semester VII |
| Subject | Machine Learning (KOE073) |
| Exam | Theory Examination 2024-25 (odd semester) |
| Time · Marks | 3 hours · 100 marks |
| Source | AKTU question paper, from the ABESIT question paper bank |
Note: Attempt all Sections. In case of any missing data; choose suitably.
Section A
Q1. Attempt all questions in brief · 2 × 10 = 20 marks
- Describe the differences between well-defined and ill-defined learning problems.
- Describe the trade-off between bias and variance in machine learning.
- What is inductive bias in the context of decision tree learning?
- Explain how overfitting can affect decision tree performance.
- What is hypothesis accuracy in machine learning?
- What is Bayes theorem?
- Explain the relationship between sample size and generalization error for finite hypothesis spaces.
- What is the mistake bound model of learning?
- What is a hypothesis space in machine learning?
- Explain the process of general-to-specific beam search in hypothesis generation.
Section B
Q2. Attempt any three of the following · 10 × 3 = 20 marks
- Demonstrate an example of concept learning for a binary classification problem.
- Demonstrate how Adaline adjusts its weights during training.
- Describe the relationship between Bayes Optimal Classifier and posterior probabilities.
- Demonstrate the implementation of k-NN for a simple classification problem.
- Describe the advantages of FOIL over propositional rule learners.
Section C
Q3
Attempt any one part of the following · 10 × 1 = 10 marks
- Explain the working steps of the Find-S algorithm.
- Explain how the List-Then-Eliminate algorithm finds consistent hypotheses.
Q4
Attempt any one part of the following · 10 × 1 = 10 marks
- Demonstrate the training of a perceptron using the perceptron learning rule.
- Demonstrate how to update weights using the Delta rule.
Q5
Attempt any one part of the following · 10 × 1 = 10 marks
- Explain the steps of the EM algorithm: Expectation step and Maximization step.
- Describe how conditional probabilities are represented in Bayesian Belief Networks
Q6
Attempt any one part of the following · 10 × 1 = 10 marks
- Demonstrate the application of the mistake bound model to the Perceptron learning algorithm.
- Demonstrate the application of LWR to a simple regression dataset.
Q7
Attempt any one part of the following · 10 × 1 = 10 marks
- Explain the key components of a reinforcement learning framework: states, actions, rewards.
- Describe the significance of the learning rate and discount factor in Q-learning.
Short on time? See the most repeated AKTU Machine Learning (Open Elective) questions across all years.
Other years
More AKTU Machine Learning papers on LearnAIFast.
This paper is reproduced for study purposes only. Copyright belongs to AKTU. Source: the question paper bank of ABES Institute of Technology, an AKTU-affiliated college. If you own the copyright and want it removed, email learnwithskillnest@gmail.com and we will take it down.