RTU Kota B.Tech CSE 3rd Semester Advanced Engineering Mathematics Question Paper 2019

RTU Computer Science Advanced Engineering Mathematics 2019 Paper Review

Preparing for the Rajasthan Technical University B.Tech Advanced Engineering Mathematics exam requires exact mathematical execution and absolute command over statistical algorithms. For Computer Science Engineering students, this specific paper sets the foundational standard for computational modeling and algorithmic processing. The 2019 paper tests your ability to compute numerical iterations up to multi-decimal accuracy, apply continuous probability distributions to theoretical datasets, and perform linear optimization under rigid constraints. Reviewing this paper reveals how examiners construct problems and distribute the 70 marks across the core mathematical modules. This systematic preparation helps you build the tactical approach needed to score high marks in your university examination.

Understanding the CSE Exam Pattern

The RTU theory examination is a three-hour paper worth 70 marks. The paper divides into three distinct sections that balance basic recall with extensive mathematical computation.

• Part A: This section contains ten compulsory questions worth two marks each. You must provide short mathematical definitions, write specific formulas, or complete basic arithmetic steps under 30 words.
• Part B: You will find seven questions here, and you must answer five of them. Each question is worth four marks. Your answers require multi-step calculations, system setup, or applying targeted statistical distributions to engineering scenarios.
• Part C: This section offers five major questions, and you need to answer three. Each question carries ten marks. These require lengthy numerical iterations, extensive probability calculations, or complete step-by-step optimization using tables.

Core Topics Evaluated in the CSE Paper

The 2019 question paper tests several critical modules that form the mathematical basis of computer science and data analysis. Focus your study time on these specific areas to maximize your score.

Numerical Methods for Equation Solving

This module tests your ability to approximate numerical roots using iterative algorithms. You must know how to locate roots for algebraic and transcendental equations. Practice the Bisection method, Regula Falsi method, and the Newton-Raphson method thoroughly. The 2019 paper evaluates your speed and accuracy with the Newton-Raphson method, requiring you to iterate until your values match up to three decimal places. You also need to solve simultaneous linear equations using the Gauss-Seidel iterative method, which serves as a core algorithm for parallel data processing.

Probability Distributions and Statistical Mechanics

This section carries major weightage and links directly to machine learning logic. You must master conditional probability and Bayes Theorem, which drives automated classification engines. Memorize the exact probability mass and density functions for the Binomial, Poisson, and Normal distributions. Expect questions asking you to find the mean, variance, or specific probability boundaries for a given population sample. Additionally, study curve fitting using the method of least squares to fit a straight line or a second-degree parabola to a set of data points, which serves as the physical math behind regression analysis.

Optimization and Linear Programming

This module evaluates your capacity to maximize an objective function or minimize operational costs under strict inequality constraints. You must know how to formulate a real-world word problem into a standard linear programming model. Practice solving two-variable models using the graphical method. For high-dimensional problems involving three or more variables, you must master the Simplex method. Examiners require you to construct the initial simplex table, identify pivot elements, and perform row operations to reach the optimal solution.

Numerical Differentiation and Integration

You must know how to calculate derivatives and integrals from discrete data points when analytical functions are missing. Practice using Newton forward and backward interpolation formulas to compute missing entries in a data grid. For numerical integration, memorize the rules and step constraints for the Trapezoidal rule, Simpson 1/3 rule, and Simpson 3/8 rule. The paper contains questions requiring you to compute a definite integral using these rules and determine the absolute error by comparing your result with the actual analytical value.

Numerical Solution of Ordinary Differential Equations

This module provides high-value ten-mark questions in Part C. You must master the methods for solving first-order ordinary differential equations numerically. Practice Euler method and the modified Euler method. The primary focus remains on the Runge-Kutta fourth-order method. You will face problems asking you to determine a functional value at a specific step size, which requires processing the four intermediate constants with absolute arithmetic precision.

Answer Writing Strategy for High Marks

RTU evaluators check for explicit intermediate steps, correct formula declarations, and accurate final values in your answer book. Use a blue pen for standard text and math steps, and use a black pen for writing final numerical answers, drawing table grids, and defining formula structures.

In Part A, write the answer directly. If a question asks for the formula of the Poisson distribution, state the exact equation and define the parameter variable clearly without adding unnecessary text.

In Part B, document your variable assignments before starting calculations. If you are applying a Normal distribution formula, state the mean and standard deviation values explicitly. This clear layout lets the examiner follow your calculation path easily.

In Part C, tabular formatting is mandatory. When executing the Gauss-Seidel method or the Simplex method, use a ruler to draw clean, spacious tables. Write out every single iteration step clearly inside the table layout. The university grading criteria uses step-by-step marking, which ensures you receive partial credit even if a minor calculation error happens near the end of a long problem. Draw a prominent box around your final numeric answers to ensure they stand out to the evaluator.

Time Management During the Exam

Divide your time strictly to avoid leaving high-weightage questions unfinished. Spend 20 minutes on Part A and 40 minutes on Part B. Reserve the remaining 120 minutes for the three long-answer questions in Part C. Running multiple iterations of the Runge-Kutta method or processing multi-stage Simplex tables consumes significant time and requires intensive use of your scientific calculator. This structure gives you 40 minutes per major problem, allowing you to build your calculation matrices carefully and double-check your arithmetic. Use the final 10 minutes to verify your data copies, ensure your calculator was in the correct mode, and confirm all decimal points are clearly visible.