Course Code ESC-CSE-101G
Category Engineering Science Course
Course title Programming for Problem Solving
L T P Credits
Scheme and Credits
3 0 0 1.5
Pre-requisites (if any) -
Course Outcomes:
The course will enable the students:
• To formulate simple algorithms for arithmetic and logical problems.
• To translate the algorithms to programs (in C language).
• To test and execute the programs and correct syntax and logical errors.
• To implement conditional ranching, iteration and recursion.
• To decompose a problem into functions
• To use arrays, pointers and structures to formulate algorithms and programs.
• To apply programming to solve matrix addition and multiplication problems
• To apply programming to solve simple numerical method problems, namely differentiation of
function and simple integration.
Note: Examiner will set nine questions in total. Question one will be compulsory. Question one will
have 10 parts of 2.5 marks from all units and remaining eight questions of 12.5 marks each to be set by
taking two questions from each unit. The students have to attempt five questions in total, first being
compulsory and selecting one from each Unit.
Unit 1
Introduction to Programming:
Idea of Algorithm: Steps to solve logical and numerical problems. Representation of
Algorithm: Flowchart/Pseudocode with examples.
C Programming: Keywords, Variables and Data Types: basic, derived and user defined, Type
Conversions, Header Files, Basic Input and Output Functions and Statements, Compilation, Syntax and
Logical Errors in compilation, Object and Executable Code, Storage Classes, Arithmetic Expressions
and Precedence.
Unit 2
Preprocessors, Conditional and Branching Statements, Loops/ Iterative Statements, Writing and
evaluation of conditionals and consequent branching.
Unit 3
Arrays (1-D, 2-D), Character Arrays and Strings, Arrays with Pointers, Functions (including using built
in libraries), Parameter passing in functions, Call by Value, Call by Reference, Passing arrays to
functions, Recursion, as a different way of solving problems. Example programs, such as Finding
Factorial, Fibonacci series, Ackerman function etc.
Unit 4
Idea of pointers, Defining pointers, Use of Pointers in self-referential structures, Introduction to
Dynamic Memory Allocation and its Methods, Structures, Union, Defining Structures and Array of
Structures, File Handling.
Suggested Text Books:
Ajay Mittal, Programming in C, ‘A Practical Approach’, Pearson Education.
Byron Gottfried, Schaum's Outline of Programming with C, McGraw-Hill
E. Balaguruswamy, Programming in ANSI C, Tata McGraw-Hill
Yashavant Kanetkar, Let Us C, BPB Publication.
Suggested Reference Books
Brian W. Kernighan and Dennis M. Ritchie, The C Programming Language, Prentice Hall of
India
