Submitted by: Submitted by mink
Views: 245
Words: 6661
Pages: 27
Category: Business and Industry
Date Submitted: 12/16/2012 08:16 AM
Rajasthan Technical University, Kota
Detailed Syllabus for B.Tech. (Computer Engineering)
Session 2009-10 (Main Examination)
Class: III Sem. B.Tech.
Branch: Computer Engg.
Schedule per Week
Lectures: 3, Tutorial: 1
Evaluation
Examination Time = Three (3) Hours
Maximum Marks = 100
[Mid-term (20) & End-term (80)]
3CS1 MATHEMATICS III (Common to Comp. Engg. & Info. Tech)
Units
Contents of the subject
I
Introduction: Engineering application of optimization, Statement and classification
of optimization problem, single variable and multivariable optimization with and
without constraints.
II
Linear Programming: Formulation of Linear Programming problem, Graphical
Approach, General Linear Programming problem, Simple Method. Duality in Linear
Programming and Transportation Problems.
Project Scheduling: Project Scheduling by PERT and CPM Network Analysis.
III
IV
Sequencing Theory: General Sequencing problem n-jobs through 2 machines & 3
machines and 2-jobs through m machines.
LAPLACE TRANSFORM: Laplace transform with its simple properties. Inverse
Laplace transform, convolution theorem (without proof), solution of ordinary
differential equation with constant coefficient, solution of partial differential
equation having constant coefficient with special reference to diffusion, Heat
conduction and wave equation. Boundary value problems
NUMERICAL ANALYSIS: Difference operators forward, backward, control, shift
and average operators and relation between them. Newton’s and Gauss forward and
backward interpolation formula for equal interval, Sterling & formula for control
difference. Lagrange’s Interpolation formula. Inverse Interpolation.
V
Numerical differentiation by Newton’s, Gauss and Sterling’s formula. Numerical
Integration by Simpson’s one third and there eight rule. Numerical Integration of
ordinary differential equation of first order by Picard’s method, Euler’s and modified
Euler’s method, Milure’s method...