MA9214 APPLIED MATHEMATICS FOR ENGINEERING DESIGN SYLLABUS | ANNA UNIVERSITY ME CAD COMPUTER AIDED DESIGN 1ST SEM SYLLABUS REGULATION 2009 2011 2012-2013 BELOW IS THE ANNA UNIVERSITY FIRST SEMESTER ME CAD COMPUTER AIDED DESIGN DEPARTMENT SYLLABUS, TEXTBOOKS, REFERENCE BOOKS,EXAM PORTIONS,QUESTION BANK,PREVIOUS YEAR QUESTION PAPERS,MODEL QUESTION PAPERS, CLASS NOTES, IMPORTANT 2 MARKS, 8 MARKS, 16 MARKS TOPICS. IT IS APPLICABLE FOR ALL STUDENTS ADMITTED IN THE YEAR 2011 2012-2013 (ANNA UNIVERSITY CHENNAI,TRICHY,MADURAI,TIRUNELVELI,COIMBATORE), 2009 REGULATION OF ANNA UNIVERSITY CHENNAI AND STUDENTS ADMITTED IN ANNA UNIVERSITY CHENNAI DURING 2009
MA9214 APPLIED MATHEMATICS FOR ENGINEERING DESIGN L T P C
Common to M.E. (Engg. Design)/M.E. (CAD)/M.E. (PDD) 3 1 0 4
UNIT I 2 – D RANDOM VARIABLES 12
Joint distributions – Marginal and Conditional distributions – functions of two –
dimensional random variables – Regression curve - Correlation.
UNIT II COMPUTATIONAL METHODS IN ENGINEERING 12
Boundary value problems for ODE – Finite difference methods – Numerical solution
of PDE – Solution of Laplace's and Poisson equation – Liebmann's iteration process
– Solution of heat conduction equation by Schmidt explicit formula and Crank-
Nicolson implicit scheme – Solution of wave equation
UNIT III TENSOR ANALYSIS 12
Summation convention – Contravariant and covariant vectors – contraction of tensors
– inner product – quotient law – metric tensor – Christoffel symbols – covariant
differentiation – gradient, divergence and curl
UNIT IV CALCULUS OF VARIATION 12
Variation and its properties – Euler's equation – functionals dependent on first and
higher order derivatives – functionals dependent on functions of several independent
variables – problems with moving boundaries – direct methods – Ritz and
Kantorovich methods
UNIT V FAST FOURIER TRANSFORM 12
Discrete Fourier transform – linearity and periodicity – inverse N-point DFT – DFT
approximation of Fourier coefficients – sampled Fourier series – Approximation of
Fourier transform by an N-point DFT – FFT – Computational efficiency of FFT
L: 45 + T: 15 , TOTAL: 60 PERIODS
REFERENCES :
1. James, G., Advanced Modern Engineering Mathematics, 3rd edition, Pearson
Education, 2004.
2. Grewal, B.S., Numerical methods in Engineering and Science, 7th edition, Khanna
Publishers, 2005.
3. Grewal, B.S., Higher Engineering Mathematics, 40th edition, Khanna Publishers,
2007.
4. Gupta, A.S., Calculus of variations with applications, Prentice-Hall of India, New
Delhi, 1997.
5. O'Neil, P.V., Advanced Engineering Mathematics, Thomson Asia Pvt. Ltd.,
Singapore, 2003.
6. Andrews, L.C. and Philips, R. L. Mathematical Techniques for Engineers and
Scientists, Prentice Hall of India, 2006.
MA9214 APPLIED MATHEMATICS FOR ENGINEERING DESIGN L T P C
Common to M.E. (Engg. Design)/M.E. (CAD)/M.E. (PDD) 3 1 0 4
UNIT I 2 – D RANDOM VARIABLES 12
Joint distributions – Marginal and Conditional distributions – functions of two –
dimensional random variables – Regression curve - Correlation.
UNIT II COMPUTATIONAL METHODS IN ENGINEERING 12
Boundary value problems for ODE – Finite difference methods – Numerical solution
of PDE – Solution of Laplace's and Poisson equation – Liebmann's iteration process
– Solution of heat conduction equation by Schmidt explicit formula and Crank-
Nicolson implicit scheme – Solution of wave equation
UNIT III TENSOR ANALYSIS 12
Summation convention – Contravariant and covariant vectors – contraction of tensors
– inner product – quotient law – metric tensor – Christoffel symbols – covariant
differentiation – gradient, divergence and curl
UNIT IV CALCULUS OF VARIATION 12
Variation and its properties – Euler's equation – functionals dependent on first and
higher order derivatives – functionals dependent on functions of several independent
variables – problems with moving boundaries – direct methods – Ritz and
Kantorovich methods
UNIT V FAST FOURIER TRANSFORM 12
Discrete Fourier transform – linearity and periodicity – inverse N-point DFT – DFT
approximation of Fourier coefficients – sampled Fourier series – Approximation of
Fourier transform by an N-point DFT – FFT – Computational efficiency of FFT
L: 45 + T: 15 , TOTAL: 60 PERIODS
REFERENCES :
1. James, G., Advanced Modern Engineering Mathematics, 3rd edition, Pearson
Education, 2004.
2. Grewal, B.S., Numerical methods in Engineering and Science, 7th edition, Khanna
Publishers, 2005.
3. Grewal, B.S., Higher Engineering Mathematics, 40th edition, Khanna Publishers,
2007.
4. Gupta, A.S., Calculus of variations with applications, Prentice-Hall of India, New
Delhi, 1997.
5. O'Neil, P.V., Advanced Engineering Mathematics, Thomson Asia Pvt. Ltd.,
Singapore, 2003.
6. Andrews, L.C. and Philips, R. L. Mathematical Techniques for Engineers and
Scientists, Prentice Hall of India, 2006.
No comments:
Post a Comment
Any doubt ??? Just throw it Here...