C Programming Syllabus First Year

 Chapter 1 Problem Solving Aspects 5 Hours 

1.1. Introduction to problem solving using computers. 

1.2. Problem solving steps. 

1.3 Algorithms-definition, characteristics , examples ,advantages and limitations. 

1.4 Flowcharts - definition, notations , examples , advantages and limitations, Comparison with algorithms. 

1.5 Pseudo codes - notations, examples, advantages and limitations. 

1.6 Programming Languages as tools, programming paradigms, types of languages 

1.7 Converting pseudo-code to programs. 

1.8 Compilation process (compilers , interpreters), linking and loading, syntax and semantic errors, testing a program 

1.9 Good Programming Practices (naming conventions , documentation, indentation).

Chapter 2 ‘C’ Fundamentals 7 Hours 

2.1 History of ‘C’ language. 

2.2 Application areas. 

2.2 Structure of a ‘C’ program. 

2.3 ‘C’ Program development life cycle

2.4 Function as building blocks. 

2.5 ‘C’ tokens 2.6 Character set, Keywords , Identifiers 

2.7 Variables, Constants (character, integer, float, string, escape sequences, enumeration constant). 

2.8 Data Types (Built-in and user defined data types). 

2.9 Operators, Expressions, types of operators, Operator precedence and Order of evaluation. 

 2.10 Character input and output. 

2.11 String input and output.

2.12 Formatted input and output.

Chapter 3 Control Structures 6 Hours 

3.1 Decision making structures:- if ,if-else, switch and conditional operator. 

3.2 Loop control structures:- while ,do while, for. 

3.3 Use of break and continue. 

3.4 Nested structures. 

3.5 Unconditional branching (goto statement). 

Chapter 4 Functions 6 Hours 

4.1 Concept of function, Advantages of Modular design.

 4.2 Standard library functions. 

4.3 User defined functions:- declaration , definition, function call, parameter passing (by value), return statement. 

4.4 Recursive functions.

 4.5 Scope of variables and Storage classes.

Chapter 5 Arrays 6 Hours 

5.1 Concept of array. 

5.2 Types of Arrays – One , Two and Multidimensional array. 

5.3 Array Operations - declaration, initialization, accessing array elements. 

 5.4 Memory representation of two-dimensional array (row major and column major) 

5.5 Passing arrays to function. 

5.6 Array applications - Finding maximum and minimum, Counting occurrences, Linear search, Sorting an array (Simple exchange sort, bubble sort), Merging two sorted arrays, Matrix operations (trace of matrix, addition, transpose, multiplication, symmetric, upper/ lower triangular matrix )