Programming for problem solving syllabus

 

ETCS103A	PROGRAMMING FOR PROBLEM SOLVING	C
4

 

UNIT I

Introduction to Programming: Introduction to components of a computer system (disks, memory, processor, where a program is stored and executed, operating system, compilers etc.)

Idea of Algorithm: steps to solve logical and numerical problems. Representation of Algorithm:

Flowchart / Pseudocode with examples. From algorithms to programs; source code, variables (with data types) variables and memory locations, Syntax and Logical Errors in compilation, object and executable code- Arithmetic expressions and precedence

UNIT II

Conditional Branching and Loops, Writing and evaluation of conditionals and consequent branching, Iteration and loops. Arrays: Arrays (1-D, 2-D), Character arrays and Strings

UNIT III

Basic Algorithms: Searching, Basic Sorting Algorithms (Bubble, Insertion and Selection), Finding roots of equations, notion of order of complexity through example programs (no formal definition required)

Function: Functions (including using built in libraries), Parameter passing in functions, call by value, passing arrays to functions: idea of call by reference.

Recursion: Recursion, as a different way of solving problems. Example programs, such as Finding Factorial, Fibonacci series, Ackerman function, Quick sort or Merge sort.

UNIT IV

Structure: Structures, Defining structures and Array of Structures

Pointers: Idea of pointers, Defining pointers, Use of Pointers in self-referential structures, notion of linked list (no implementation)

Suggested Text Books

1. Byron Gottfried, Schaum’s Outline of Programming with C, McGraw-Hill

2. E. Balaguruswamy, Programming in ANSI C, Tata McGraw-Hill