Numerical Methods and Graph Theory detail syllabus for Geoinformatics Engineering (Geo), 2017 regulation is taken from Anna University official website and presented for students of Anna University. The details of the course are: course code (MA8401), Category (BS), Contact Periods/week (4), Teaching hours/week (4), Practical Hours/week (0). The total course credits are given in combined syllabus.
For all other geo 4th sem syllabus for be 2017 regulation anna univ you can visit Geo 4th Sem syllabus for BE 2017 regulation Anna Univ Subjects. The detail syllabus for numerical methods and graph theory is as follows.”
Course Objective:
- To introduce the basic concepts of solving algebraic and transcendental equations.
- To introduce the numerical techniques of interpolation in various intervals in real life situations.
- To acquaint the student with understanding of numerical techniques of empirical laws and curve fitting which play an important role in engineering and technology disciplines.
- To introduce basic concepts of graph theory to apply in engineering disciplines.
- To understand some algorithms to apply in engineering applications.
Unit I
For complete syllabus and results, class timetable and more pls download iStudy. Its a light weight, easy to use, no images, no pdfs platform to make students life easier.
Unit II
Interpolation and Approximation
Interpolation with unequal intervals – Lagrange interpolation – Newtons divided difference interpolation – Cubic Splines – Interpolation with equal intervals – Newtons forward and backward difference formulae – Least square method – Linear curve fitting.
Unit III
Empirical Laws and Curve-Fitting
Graphical methods – Laws reducible to the linear law – Method of group averages – Laws containing three constants – Principle of least squares – Method of least squares – Fitting of other curves – Method of movements.
Unit IV
For complete syllabus and results, class timetable and more pls download iStudy. Its a light weight, easy to use, no images, no pdfs platform to make students life easier.
Unit V
Graph Algorithms
Rooted trees, trees and sorting, Dijkstras and Prims algorithm for minimum spanning trees, The Max-Flow Min-Cut theorem for network flows.
Course Outcome:
Upon successful completion of the course, students should be able to :
- Apply the basic concepts of solving algebraic and transcendental equations.
- Apply the numerical techniques of interpolation in various intervals in real life situations.
- Understand the numerical techniques of empirical laws and curve fitting which play an important role in engineering and technology disciplines.
- Apply the basic concepts of graph theory in engineering disciplines.
- Appreciate the importance of some algorithms in applying in engineering applications.
Text Books:
- Grewal, B.S. and Grewal,J.S., Numerical methods in Engineering and Science, Khanna Publishers, New Delhi, 9th Edition, 2007.
- Ralph P. Grimaldi, “Discrete and combinatorial Mathematics”, Pearson Education, Asia, 4th Edition, 2002.
References:
- Brian Bradie, A Friendly Introduction to Numerical Analysis, Pearson Education Asia, New Delhi, 1st Edition, 2007.
- Kenneth H.Rosen, Discrete Mathematics and its Applications, Tata McGraw Hill Pub. Co. Ltd., New Delhi, 7th Edition, Special Indian edition, 2011.
- Laurene V. Fausett, Applied Numerical Analysis using MATLAB, Pearson Education, New Delhi, 1st print, 2nd Edition, 2009.
- S. R. K. Iyengar, R. K. Jain, Mahinder Kumar Jain, “Numerical Methods for Scientific and Engineering Computation”, 6th Edition, New Age International Publishers, New Delhi, 2012.
- Tremblay J.P. and Manohar R, Discrete Mathematical Structures with Applications to Computer Science, Tata McGraw Hill Pub. Co. Ltd, New Delhi, 30th Reprint, 2011.
For detail syllabus of all other subjects of BE Geo, 2017 regulation do visit Geo 4th Sem syllabus for 2017 Regulation.
Dont forget to download iStudy for latest syllabus and results, class timetable and more.