COURSE CODE: ITR-101 COURSE DURATION: 6 Weeks COURSE OBJECTIVE:

1. Provide complete understanding on the need and importance of ‘C’ programming language and problem
2. solving methodologies with examples.
3. Implementation of pointers and memory management concepts to resolve the memory access issues.
4. Implementation of preprocessors and different header file directives to write the Header Files.
5. Help understand the implementation of code reusability with the help of user defined functions
6. Help understand to Create their own data types.
7. Study the complications in file organization and the implementation of file systems.
8. Implementation of the Make Utility and creating a make file for compiling the larger C program which are divided into different several C files and creating a single object file.

COURSE CONTENTS

CHAPTER 1: GETTING STARTED

1. Why C Programming Language
2. Background, History & Features of C
3. Compilation Model
4.  Edit-Compile-Link-Execute Process
5.  Strategy of Designing a Program

CHAPTER 2: FUNDAMENTALS OF C PROGRAMMING

1. Variables & Constants
2. Pre-processor Directives
3. Keywords & Data Types
4. Identifiers & Rules
5. I/O Functions
6. Order of Precedence

CHAPTER 3: OPERATORS AND CLASSIFICATIONS

1. Arithmetic Operators
2. Bitwise Operators
3. Logical Operators
4. Increment Operators
5. Decrement Operators
6. Relational Operators

CHAPTER 4: CONTROL FLOW STATEMENTS

1. Sequential statements
2. Decision making statements
3. if, if-else, else, nested-if, break, continue & switch statement

CHAPTER 5: LOOPING STATEMENTS

1. The for statement
2. The while statement
3. The do-while statement
4. Endless loops statement

CHAPTER 6: C PRE-PROCESSOR

1. #define
2. Macros
3. #include
4. Conditional Compilation
5. #ifdef
6. #ifndef

CHAPTER 7: ARRAYS AND STRING

1. Definition and Declaration of Array
2. Definition and Declaration of String
3. Memory Layout & accessing Array Elements
4. String Functions
5. Two dimensional Arrays

CHAPTER 8: POINTERS [PART 1]

1. Definition & Declaration of Pointer
2. Indirect Access using Pointers
3. Pass by Reference
4. Relation b/w Arrays and Pointers
5. Type Casting
6. Pointer to an Array
7. Array of Pointers

CHAPTER 9: FUNCTIONS

1. Why Functions ?
2. Function Declarations
3. Function Prototypes
4. Returning a Value or Not
5. Arguments and Parameters
6. Function Pointers
7. Storage classes
8. Recursion

CHAPTER 10: SCOPE OF VARIABLES

1. Block Scope
2. Function Scope
3. File Scope
4. Program Scope
5. The auto Specifier
6. The static Specifier
7. The register Specifier
8. The extern Specifier
9. The Constant Modifier
10. The Volatile Modifier

CHAPTER 11: POINTERS [PART 2]

1. Dynamic Storage Allocation –
2. malloc(), calloc(), realloc(), free()
3. Functions Returning a Pointer
4. An Array of character Pointers
5. Two Dimension Arrays vs. Array of Pointers
6. Command Line Arguments
7. Pointers to Pointers
8. Function Pointers

CHAPTER 12: SERCHAPTERING & SORTING

1. Linear Search & Binary Search
2. Bubble sort & Selection Sort

CHAPTER 13: STRUCTURES

1. Fundamental Concepts
2. Describing a Structure
3. Creating Structures
4. Operations on Structures
5. Functions Returning Structures
6. Passing Structures to Functions
7. Pointers to Structures
8. Array of Structures
9. Functions Returning a Pointer to a Structure
10. Structure Padding
11. # pragma Definition

CHAPTER 14: STRUCTURE RELATED ITEMS(UNION)

1. Typedef – New Name for an Existing Type
2. Bit Fields
3. Enumerations
4. Unions

CHAPTER 15: FILE I/O

1. Why files
2. System Calls vs. Library Calls
3. I/O Library Functions
4. fopen(), fread(), fwrite(), fclose()
5. Copying a File
6. character Input vs. Line Input
7. fscanf(), fprintf(), fclose()

CHAPTER 16: DATA STRUCTURE USING C

1. Why data structure?
2. Definition and Classification
3. Stack using Array and Pointer
4. Queue using Array and Pointer
5. Linked Lists:
6. Singly link list
7. Circular link list
8. Double link list
9. Introduction to Tree & Binary Tree