RTU Kota B.Tech 6th Semester Machine Learning Question Paper 2023 (CSE/AI/IT)

RTU Machine Learning 2023 Paper Review

The Machine Learning course in the 6th semester at Rajasthan Technical University focuses on the transition from traditional programming to algorithmic learning. For students in CSE, AI, and IT, the 2023 examination emphasized the mathematical foundations of model training, the trade-offs in algorithm selection, and the practical application of supervised and unsupervised learning techniques.

The 2023 paper challenged students to demonstrate not just knowledge of definitions, but the ability to trace algorithms and analyze model performance under different constraints. This review highlights the critical modules and exam strategies to help you master this curriculum.

Understanding the Exam Pattern

The RTU theory examination is a three-hour paper worth 70 marks, organized into three parts:

• Part A: Ten compulsory questions, two marks each. Expect definitions covering the bias-variance tradeoff, over-fitting vs. under-fitting, feature selection, and basic probability concepts like Bayes' Theorem. Keep answers under 30 words.
• Part B: Seven questions; answer five. Each is worth four marks. These are analytical questions. Prepare to compare different algorithms (e.g., K-means vs. Hierarchical Clustering), explain the mechanics of a Decision Tree split, or write the pseudocode for a simple perceptron.
• Part C: Five major questions; answer three. Each is worth ten marks. These require long-form explanations and derivations. Expect problems involving entropy calculation for decision trees, the K-nearest neighbor algorithm, the mathematical derivation of backpropagation, or solving a Markov Decision Process (MDP).

Core Topics Evaluated in the Paper

Focus your study time on these specific modules to maximize your score:

Supervised Learning Algorithms

This module carries significant weight. Master the intuition behind Linear and Logistic Regression, Naive Bayes, and SVM. You should be able to perform manual calculations for decision tree construction using Gini Impurity and Information Gain, as these are staple 10-mark questions.

Unsupervised Learning and Clustering

Learn to group unlabelled data effectively. Focus on the K-means algorithm—you should be able to manually trace the steps of centroid initialization and cluster assignment. Also, review Association Rule Mining (Apriori Algorithm) and Gaussian Mixture Models.

Statistical Learning and Feature Engineering

Understand the "why" behind model selection. Study Principal Component Analysis (PCA) for dimensionality reduction and be prepared to explain filter, wrapper, and embedded feature selection methods.

Reinforcement Learning and Neural Networks

Reinforcement learning often appears in Part C. Focus on the Markov Decision Process (MDP), Bellman equations, and the difference between Q-Learning and SARSA. For neural networks, understand the perceptron architecture and the backpropagation algorithm, which is essential for deep learning introductory questions.

Answer Writing Strategy for High Marks

RTU evaluators prioritize logical rigor and clear, structured technical content.

• Diagrams: AI is a visual subject. Always use a ruler to draw flowcharts for algorithms. For Decision Trees, clearly draw the nodes and branches. For K-means, draw simple scatter plots representing the clusters.
• Formatting: Use a black pen for algorithm names, formulas, and diagrams. Use a blue pen for your explanatory text. Use bullet points for features, advantages, and limitations to make your answers scannable.
• Precision: If the question asks for an algorithm, define the objective, the mathematical basis, and provide a step-by-step procedure. When calculating probabilities or weights, show your intermediate arithmetic steps clearly.
• Comparative Tables: Whenever the paper asks to compare two concepts—like "Supervised vs. Unsupervised Learning" or "K-nearest neighbor vs. Decision Tree"—always use a table to clearly delineate their differences.

Time Management During the Exam

• Part A (20 minutes): Finish these first to secure a solid foundation.
• Part B (40 minutes): Spend approximately eight minutes per question. If a derivation or algorithm feels complex, outline the main logic clearly and move on.
• Part C (120 minutes): Devote 40 minutes to each of your three chosen long-answer questions. This provides sufficient time to derive formulas, draw clean diagrams, and verify the logic for complex processes like backpropagation or cluster analysis.