C Programming with Certification
    by Aravind Kumar N, B.Tech, M.Tech,(PhD)

This course is aimed at advancing concepts of programming and software code organization within the framework of structural and procedural programming paradigms and it is also aimed at the competitive programming and technical interviews . The course is oriented to those who want to advance structured and procedural programming understanding and to improve C programming skills. The major objective is to provide students with understanding of code organization and functional hierarchical decomposition with using primary and complex data types.

Code : CP

Recommended For : Who are interested to learn C Programming

After Learning this subject,you should be able to

  • Crack the solutions of coding competitions and technical interviews.
  • Define and manage data types based on problem subject domain.
  • Work with textual information, characters and strings
  • Work with arrays of complex objects.
  • Understand branching statements, loop statements and use them in problem solving
  • Understand procedural oriented programming using functions and solve large, complex applications.

Curriculum 22:58:45   units   |   5

  • 8:41:37

    UNIT 1
    Unit - 1: Introduction to Programming, Features of C Programming, Introduction to components of a computer system, disks, primary and secondary memory, Processor and Operating System, Compilers, Creating,compiling and executing a program etc, Structure of C Program Part - 1, Structure of C Program Part - 2, Number Systems Part - 1, Number Systems Part - 2, Binary To Decimal Program, Introduction to Algorithms, steps to solve logical and numerical problems, Representation of Algorithm, Flowchart with Examples, Pseudo code, Program design and structured programming, Introduction to C Programming Language:, C Tokens, Variables, Reading and Writing of Variables, Identifiers, Datatypes, Datatypes Program, Syntax and Logical Errors in compilation, Object and executable code, Operators, Binary Operators, Relational Operators Program, Logical Operators, Ternary Operator, Bitwise Operators, Bitwise operations: Bitwise AND, OR, XOR operators Part - 1, Bitwise operations: Bitwise AND, OR, XOR operators Part - 2, Bitwise operations: Bitwise Not Operators, expressions and precedence, Expression evaluation, Storage classes (auto, extern, static and register) Part - 1, Storage classes (auto, extern, static and register) Part - 2, Type Conversion, The main method and command line arguments, Conditional Branching and Loops, Writing and evaluation of conditionals and consequent branching with switch-case, goto, Conditionals and consequent branching with if, if-else Part - 1, Conditionals and consequent branching with if, if-else Part - 2, Conditionals and consequent branching with if, if-else Part - 3, Conditionals and consequent branching with if, if-else Part - 4, Switch Statement, Switch Statement program, Unconditional statements, Iterative statements, Iteration with for, while, dowhile loops Part 1, Iteration with for, while, do while loops Part 2, Iteration with for, while, do while loops Part 3, Iteration with for, while, do while loops Part 4, FOrmatted I/O , Simple input and output with scanf and printf and Introduction to stdin, stdout and stderr, Example Program Swapping, Example Program Square, Example Program Circle, Example Program ASCII, Armstrong number, Reverse of an Integer, Command line arguments

  • 6:07:48

    UNIT 2
    Arrays, Strings, Structures and Pointers: Arrays one dimensional arrays & It's Operations Part - 1, One Dimensional Array Program 1, One Dimensional Array Program 2, One Dimensional Array Program 3, One Dimensional Array Program 4, One Dimensional Array Program 5, Two Dimensional Arrays, Two Dimensional Arrays Program 1, Two Dimensional Arrays Program 2, Two Dimensional Arrays Program 3, Two Dimensional Arrays Program 4, Two Dimensional Arrays Program 5, Two Dimensional Arrays Program 6, Multidimensional Arrays, Creating of Arrays, accessing and manipulating elements of arrays, Strings Introduction to strings, Handling strings as array of characters, Basic string functions available in C (strlen, strcat, strcpy, strstr etc.), Basic Strings Program 1, Basic Strings Program 2, Basic Strings Program 3, Basic Strings Program 4, Basic Strings Program 5, Basic Strings Program 6, Arrays of Strings, Structures Defining and initializing structures, Structures Intilaization, Unions, Unions Program Typedef Structure, Array of Structures, Array of Structures Program, Pointers Idea of Pointers, Pointers Idea of Pointers Program, Defining pointers, Pointers to Arrays and Structures, Use of Pointers in self-referential structures, Usage of self referential structures in linked list (no implementation), Enumeration Data Type

  • 1:57:13

    UNIT 3
    Preprocessor and File handling in C: Preprocessor, Commonly used Preprocessor commands like include, define, undef, if, ifdef, ifndef, Files: Text and Binary files, Creating, Reading and writing text and binary files, To understand the write mode in files, Write Mode in files and usage of fprint and fputs, Read mode in files and usage of fscanf, Read Mode in Files, Write Mode in Getchar and putc, Read and write on "putc", Write the data on binary file, Copy the contents of one file to another file, To merge the contents of two files onto third file, To count number of characters,words and lines in a given text file, To Understand the usage of f seek and ftell functions, To understand the file positioning functions fseek and ftell, To understand the usage of include preprocessor directive, To Understand the usage of define, ifdef, else,endif, To Understand the usage of ifndef,else,endif, To understand the usage of undef, Appending data to existing files, Writing and reading structures using binary files, Random access using fseek, ftell and rewind functions

  • 2:48:05

    UNIT 4
    Function and Dynamic Memory Allocation: Designing structured programs, Declaring a function, Signature of a function, Parameters and return type of a function, passing parameters to functions, Using Void function without parameters, Using Non-void functions without parameters, Using Void functions with Parameters, Using Non-Void functions with parameters, Using non-recursion, Using recursion (if-eslse) function, To find GCD of two numbers us, To find GCD of three numbers using recursion, To print fibonacci series using recursion, To print fibonacci series using recursion Part- 2, To implement towers of hanoi using recursion, Using bit-wise operators and implement the concept of call by value, To swap two numbers using temporary variable and implement the concept of call-by-refrence, Lcm of two numbers using recursion, To implement Ackermann function using recursion, Sum of array elements by passing array to a function, Concept of passing pointers to functions, Different Standard math library functions, Malloc() memory allocation function, Calloc() dynamic memory allocation function, Calloc() dynamic memory allocation function part- 2, realloc() dynamic memory memory allocation function, The usage of Free() function, call by value, Passing arrays to functions, passing pointers to functions, idea of call by reference, Some C standard functions and libraries, Recursion, Finding Factorial, Fibonacci series etc, Limitations of Recursive functions, Dynamic memory allocation, Allocating and freeing memory, Allocating memory for arrays of different data types

  • 3:24:02

    UNIT 5
    Introduction to Algorithms: Introduction, Algorithms for finding roots of a quadratic equations, Finding Minimum and Maximum numbers of a given set, finding if a number is prime number, etc, Basic searching in an array of elements (linear and binary search techniques), Binary Search Program 1, Binary Search Program 2, Basic algorithms to sort array of elements, Selection Sort, Selection Sort Program 1, Bubble Sort, Bubble Sort Program, Insertion Sort Part - 1, Insertion Sort Part - 2, Merge Sort, Merge Sort Program 1 Part - 1, Merge Sort Program 1 Part - 2, Merge Sort Program 1 Part - 3, Quick Sort, Quick Sort Program 1 Part - 1, Quick Sort Program 1 Part - 2, Basic concept of order of complexity through the example programs,