Scribd
Upload
245 views

CE306 Computer Programming and Computational Techniques

This document describes a computer programming and computational techniques course offered at the university. The course introduces students to programming in C++, including control structures, object-oriented concepts, and input/output streams. It also covers numerical techniques like root finding, interpolation, integration, and solving systems of linear equations. The goal is for students to be able to develop C++ programs to solve basic engineering problems using these computational methods. The course involves lectures, assignments, and exams. Textbooks cover C++ programming, numerical analysis, and object-oriented programming.

Uploaded by

Eldho P JAMES
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
245 views

CE306 Computer Programming and Computational Techniques

This document describes a computer programming and computational techniques course offered at the university. The course introduces students to programming in C++, including control structures, object-oriented concepts, and input/output streams. It also covers numerical techniques like root finding, interpolation, integration, and solving systems of linear equations. The goal is for students to be able to develop C++ programs to solve basic engineering problems using these computational methods. The course involves lectures, assignments, and exams. Textbooks cover C++ programming, numerical analysis, and object-oriented programming.

Uploaded by

Eldho P JAMES
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/ 2

Course L-T-P- Year of

Course Name
Code Credits Introduction
COMPUTER PROGRAMMING AND
CE306 3-0-0-3 2016
COMPUTATIONAL TECHNIQUES
Pre-requisites : Nil
Course Objectives:
 To provide adequate knowledge for coding in C++ language
 To give awareness about the different computational methods and their
implementation to analyze basic Engineering problems
Syllabus
Computer programming - Elements of C++ programming language - control statements -
Basic concepts of object oriented programming
Computational Techniques – Roots of transcendental equation- Interpolation -Functional
approximation- Numerical Integration, Solution of simultaneous linear equations.
Expected Outcome:
 The students will be able to develop computer programs and implement numerical
techniques for solving basic engineering problems using C++ language.
Text Books:
1. Balaguruswamy, Object Oriented programming with C++. Tata Mcgraw Hill., 2008
2. Gerald C. F. and P. O. Wheatley, Applied Numerical Analysis, Pearson Edu., 2004
3. Robert Lafore ., C++ Programming., Sams publishers.,4th Edition, 2001

Reference Books:
1. Barkakati N., Object Oriented Programming in C++, SAMS, 1991.
2. Kamthane A. M., Object Oriented Programming with ANSI & Turbo C++, Pearson
Education, 2009.
3. Lippman S. B. and J. Lajoie, C++ Primer, Pearson Education, 2005.
4. Maria Litvin.and Gary Litvin, C++ for You++, Skylight Publishing, 1998.
5. Ravichandran D., Programming with C++, Tata McGraw Hill, 2007.
COURSE PLAN
Sem.
Exam
Modules Contents Hours
Marks
%
Introduction to C++: Structure of C++ program; Character
set; Keywords; Identifiers; Data types – integer, real,
character, string, Boolean, Enumerated data types, Constants
and Variables; Operators – assignment, arithmetic,
I 7 15
relational, logical, increment, decrement and conditional
operators; Statements – simple & compound, declaration
statements. Input and output streams.
Selection statements: if, if-else, switch statements
Looping statements - for, while, do-while statements, Jump
statements – break, continue, goto, exit (). Arrays - single
II and multi-dimensional arrays, initializing array elements, 6 15
pointers & arrays, Character arrays, string functions,
Unformatted console I/O functions, Unformatted Stream I/O
functions.
Preparation of programs for evaluation of factorial of a
number, Infinite series, Sorting, Searching and Matrix
manipulations.
FIRST INTERNAL TEST
User defined functions – Arguments, return values, call by
value, call by reference, functions calling functions,
III 6 15
functions and arrays - Global variables, automatic, static and
register variables, recursive functions.
Structures - functions and structures - Arrays of structures -
structures within structures, Structures containing arrays.
Files - Input & Output, sequential & random access.
IV 7 15
Basic concepts of object oriented programming - class,
objects, constructors and destructors, inheritance (Programs
not required)
SECOND INTERNAL TEST
Roots of Transcendental equations - Successive
V approximations, Regula - Falsi, Newton Raphson Methods, 8 20
Interpolation-Lagrange interpolation method.
Functional approximation - Fitting straight line & parabola,
Numerical Integration - Trapezoidal, Simpson’s rule &
VI Gauss quadrature Method. Solution of simultaneous linear 8 20
algebraic equations – Gauss elimination method. Solution of
Partial differential Equation - Finite Difference Method
END SEMESTER EXAMINATION

QUESTION PAPER PATTERN (End semester examination)


Maximum Marks :100 Exam Duration: 3 Hrs

Part A -Module I & II : 2 questions out of 3 questions carrying 15 marks each

Part B - Module III & IV: 2 questions out of 3 questions carrying 15 marks each

Part C - Module V & VI : 2 questions out of 3 questions carrying 20 marks each

Note : 1.Each part should have at least one question from each module

2.Each question can have a maximum of 4 subdivisions (a,b,c,d)

You might also like