COURSE OBJECTIVES

The course aims to explore structural and procedural programming concepts and software code organization. The course enables the learners to build mathematical and algorithmic logics to develop programs/applications of medium complexity using C language.

COURSE DURATION: 4 Weeks
COURSE OUTCOMES:

By the end of this course, the learners will be able to
    • Write programs using a core portion of the C run-time library including: input/output, string manipulations and recursion
    • Program effectively with pointers, arrays, structures, and dynamically allocated memory and describe their internal representations.
    • Develop C programs with optimal time and space complexity
    • Select appropriate problem-solving technique to provide solutions for the given problem

COURSE CONTENTS:

Module 1: Programming constructs:
Structured Programming Languages – Data types – Operators – Conditional Constructs – Looping Constructs – Functions - Recursion – ScopeRules
Module 2: Arrays:
1D Array – 2D Array – Multi Dimensional Array – Arrays and Functions - Strings – String Functions
Module 3: Structures and Pointers:
Structures – Array of Structures – Pointers –– Pointers and Arrays – Pointers and Functions - Pointers and Structures – Dynamic Memory Allocation - – Unions - Enumerators - Bit Fields – Files – Preprocessor – Command Line Arguments
Module 4: Algorithm Analysis:
Time Complexity Analysis - Big Oh Notation – Searching and Sorting – Palindrome - kth Smallest Element – Array Rotations – Matrix Problems - Backtracking

COURSE INSTRUCTORS:

1. Dr.A.M.Abirami, abiramiam@tce.edu
2. Dr.P.Karthikeyan, karthikit@tce.edu
3. Dr.C.Jeyamala, jeyamala@tce.edu