0% found this document useful (0 votes)
0 views

syllabus

The document outlines the syllabus for the B.E. Mechanical Engineering program at The Maharaja Sayajirao University of Baroda for the academic year 2022-23, specifically focusing on the Computer Programming course (MEC 1604). It details the course structure, including topics covered, course outcomes, and practical experiments, emphasizing programming languages, computational techniques, and numerical methods. Reference books for further study are also provided to support the curriculum.
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
0 views

syllabus

The document outlines the syllabus for the B.E. Mechanical Engineering program at The Maharaja Sayajirao University of Baroda for the academic year 2022-23, specifically focusing on the Computer Programming course (MEC 1604). It details the course structure, including topics covered, course outcomes, and practical experiments, emphasizing programming languages, computational techniques, and numerical methods. Reference books for further study are also provided to support the curriculum.
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Syllabus of Courses

The Maharaja Sayajirao University of


Baroda
Academic Year 2022-23
Faculty Technology and Engineering
Department of Mechanical Engineering
B. E. (Mechanical Engineering): Regular Programme
Core
I Lectures: 03
Year MEC 1604 :Computer Credits / Hours per week
MECH Practical-: 02
Programming
Theory:
Year of Introduction: 1960
100
Semester II Year of Syllabus Revision:2006 Maximum Marks / Grade
PR/TW/VIVA
Shifted from SSBEIII to SSBEI
: 50
Mode of Transaction: Lectures and Practical

Unit No. Topic Con Weight BT CO PO Eleme Relev Relation to


tact age Le nts of ance Gender
Hou (%) vel Employ to (G),
rs ability Local Environme
(Emp)/ (L)/ nt and
Entrepr Nation Sustainabili
eneursh al (N)/ ty (ES),
ip Regio Human
(Ent)/ nal(R)/ Values
Skill Global (HV)and
Develo (G) Professiona
pment l Ethics
(SD) (PE)
1 Programming Languages: Digital computers
Architecture, Types of Input & Output
devices, operating systems - Single & Multi- 1,2 Co1 Po1
user. Flow charts and Pseudo code are in 4 10
,3 Co2 Po2
programming. Concepts in machine code and
higher-level languages.
2 Syntax C and Python for constants, variable,
Arithmetic operations, Functions, Inputs, 3,4 Co1 Po2
4 10
outputs, Dimensions and Arrays/Lists ,5 ,co2 po3

3 Repetitive computation procedures in C and Co1


Python. Transfer of control - conditional and ,co2 Emp, L,N,R, G, ES, HV,
4 10 1,2 Po3
unconditional loops and subroutines. ,co3 Ent, SD G PE
,co5
4 File input – output – sequential and random 2,3
accesses files in C and Python 4 10 ,4, Co1 Po1
5
5 Computational Techniques: Algorithm –
Definition, classification and features, static 2,3 Co4 Po3,po
4 5
and dynamic complexities, stability of ,56 ,co5 4
algorithms.
6 Errors – sources of errors in computation,
sources of errors in Machine computations- 1,2 Co2
2 5 Po1
Effect of rounding and number systems used ,3 ,co3
in computing machines.
7 Linear simultaneous Algebraic Equations –
Exact solution Algorithm –Gaussian
Elimination, Choleskey Method, Croute
Procedure, Matrix inversion, Gauss Jordon 2,3 Co4
Po3,po
method, Approximate solution Algorithms – 4 10 ,45 ,co,c
4
Jacobi Method, Gauss Siedel method. Eigen ,6 o6
values problems, classification, algorithm for
largest and smallest Eigen value and
corresponding vector, Jacobi method.
8 Non linear equations – Roots of equation –
Bracketing Methods – Methods of halving,
Co4
Method of chord or linear interpolation open 2,1
4 10 ,co5 Po5
methods – Method of Tangent or Newton ,3
,co6
Raphson Method, Modified Newton Raphson
Method.
9 Lagranges interpolation, Richardson’s
extrapolation, Finite difference methods –
ordinary differential equations – Forward,
Backward and Central differences format for 3,4 Po4,
4 10 Co5
first, second and fourth order ordinary ,6 po5
differential equations. Partial differential
equations - finite differences for Laplace
biharmonic equations.
10 Numerical Differentiation and Integration –
Newton cotes formula, Waddle’s rule for
simple and double integration, Euler Method 4 5 4,6 Co7 Po6
– Runga - Kutta Methods.
11 Introduction to Finite Element Method – 1D
3,4
& 2D analysis for Field problems. 4 10 C03 Po3
,6
12 Optimization – Constrained and
1,2 Co7 Po3,
unconstrained 2 5
,6 ,co3 po6
44 100
Course Outcome (CO) MEC 1604
1604.01 Demonstrate the knowledge and skills to do advanced studies and research in computer science and related engineering
and scientific disciplines
1604.02 Implement computing solutions that consist of system and application software written in various programming
languages
1604.03 An ability to apply knowledge of computing and mathematics appropriate to the program’s
student outcomes and to the discipline
1604.04 Develop an algorithm for solving a problem
1604.05 Understand the process of compiling, linking, and running a program LIKE C and Python
1605.06 Understand linear and non linear equation solving methods.
1605.07 Understand Numerical Integration and Numerical differentiation with optimising techniques related to with
programming languages .

Experiments

1. Introduction to computer systems Co1


,co2
2 10 Po3
,co3
G,
,co5
L,N,R ES,
2. Operating systems Co1 Emp, Ent, SD
,G HV,
2 10 ,co2 Po3
PE
,co3
3. Number systems Co2
2 10 Po1
,co3
4. Translator programs Po3,po
2 10 Co4
4
5. Program logic representation Co4
2 10 Po5
,co5
6. Programming in c Co4
6 15 ,co5 Po5
,co6
8. Computational Techniques 6 20 C03 Po3
9. Programming in Python Co7 Po3,po
6 15
,co3 6
28 100
Course Outcome (CO) MEC 1604
1604.01 Demonstrate the knowledge and skills to do advanced studies and research in computer science and related engineering
and scientific disciplines
1604.02 Implement computing solutions that consist of system and application software written in various programming
languages
1604.03 An ability to apply knowledge of computing and mathematics appropriate to the program’s
student outcomes and to the discipline
1604.04 Develop an algorithm for solving a problem
1604.05 Understand the process of compiling, linking, and running a program LIKE C and Python
1605.06 Understand linear and non linear equation solving methods.
1605.07 Understand Numerical Integration and Numerical differentiation with optimising techniques related to with
programming languages .

Reference Books

1. Programming in ANSI C, by Balagurusamy, Publisher - Tata mcgraw Hill


2. C: The Complete Reference, by Herbert Schildt, Publisher – Tata mcgraw Hill.
3. Chapra S.C, Canale, R P, Numerical Methods for Engineers , Tata mcgraw Hill, 2003
4. E. Kreyszig, advanced engineering mathematics(8th edition), john wiley (1999)

You might also like