Page 136 - CatalogNEP-LS

Comp.221 Computer Programming 2+1

LEARNING OBJECTIVES:

The primary objective of this course is:
 To provide exposure to basic problem-solving techniques with computers
 To develop logical thinking abilities and to propose novel solutions for real world
problems through programming language constructs.

LEARNING OUTCOMES:

This course will enable the students:
 to interpret the basic representation of the data and sequential programming
 to choose appropriate programming paradigms, interrupt and handle data and propose
solutions through programming.
 to implement exemplary applications on real-world problems.

THEORY (30 Hours)

UNIT I (6 Hours)

Introduction to Problem Solving through programs. Variables and Data Types, Arithmetic
expressions.
UNIT II (8 Hours)
Relational Operations, Logical expressions; Introduction to Conditional Branching, Conditional
Branching and Iterative Loops

UNIT III (8 Hours)
Arranging things: Arrays, 2-D arrays, Character Arrays and Strings

UNIT IV (4 Hours)
Functions and Parameter Passing by Value, Passing Arrays to Functions, Call by Reference,
Recursion.
UNIT V (4 Hours)

Structures and Pointers, Self-Referential Structures and Introduction to Lists

PRACTICAL (30Hours)

1. Simple Programs
2. Decision making
3. Programs of Loops
4. Array processing
5. Functions and subprograms

SUGGESTED READINGS:

1. E. Balaguruswamy, Programming in ANSI C, Tata McGraw-Hill
2. Byron Gottfried, Schaum's Outline of Programming with C, McGraw-Hill
3. Brian W. Kernighan and Dennis M. Ritchie, The C Programming Language, Prentice
Hall of India

121