Scribd
Upload
17 views

CM question paper MUJ

Computation Maths BTech first year QP

Uploaded by

Aarush Dayal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
17 views

CM question paper MUJ

Computation Maths BTech first year QP

Uploaded by

Aarush Dayal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

MA1002-COMPUTATIONAL MATHEMATICS: [2 1 0 3]

Numerical Methods: Finite difference and interpolation for equal and unequal intervals,
Numerical differentiation, and integration. Solution of algebraic and transcendental equations,
solutions of ordinary differential equations. Graphs: Definition and terminology,
Representation of graphs, Multigraphs, Bipartite graphs, Planar graphs, Isomorphism of
graphs, Euler and Hamiltonian paths, Graph coloring. Recurrence Relation & Generating
function: Recursive definition of functions, Recursive algorithms, Method of solving
recurrences.

Module wise Syllabus


Module 1
Numerical Methods I: Finite difference (Operators, relation between operators, missing value
problems) and interpolation for equal interval (Newton Gregory forward and Backward
interpolation formula, Stirling Formula) and unequal intervals (Lagrange’s Interpolation
formula and inverse interpolation formula).

Module 2
Numerical Methods II: Numerical differentiation (order one and two), Numerical Integration
(Trapezoidal rule, Simpson’s 1/3 and 3/8 rule), Solution of algebraic and transcendental
equations (Bisection method, Regula Falsi Method, Newton Raphson Method).

Module 3
Numerical Methods III: Solutions of ordinary differential equations (Picard’s Method,
Euler’s and Modified Euler’s Method, Classical Fourth order Runge - Kutta Method).

Module 4
Graphs I: Definition and terminology (edge, vertex, order, size, degree of a vertex, Simple
graph, degree sequence of a graph, Hand shaking theorem), Representation of graphs
(Undirected graph, Directed graph, Matrix representation (for undirected and simple graphs)),
Null graph, complete graph, regular graph, cyclic graph, Multigraphs, Bipartite graphs,
Complete bipartite graph, weighted graph.

Module 5
Graphs II: Complement of a graph, Isomorphism of graphs, Walk, Trail, Path, Cycle and
circuit, Euler and Hamiltonian paths, Euler and Hamiltonian graphs, Planar graphs, Graph
coloring, Chromatic number.

Module 6
Recurrence Relation & Generating function: Recursive definition of functions, Recursive
algorithms, Recurrence relation, generating functions, Method of solving recurrences (using
generating functions).

References:
1. Liu, Chung Laung, and Durga Prasad Mohapatra. "Elements of Discrete Mathematics A
Computer Oriented Approach." Tata McGraw Hill Education Private Limited, 2011.
2. Tremblay, Jean Paul, and Rampurkar Manohar. Discrete mathematical structures with
applications to computer science. McGraw-Hill, Inc., 2017.
3. Bernard Kolman, Robert C. Busby, and Sharon Ross, Discrete Mathematical Structures,
PHI Learning Private Limited, Delhi India, 2017.
4. Gerald, Curtis F. Applied numerical analysis. Pearson Education India, 2007.
5. Sastry, Shankar S. Introductory methods of numerical analysis. PHI Learning Pvt. Ltd.,
2012.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy