C

Key Features

Notes

Assignments

6 Weeks

Why This Course is Required

One thing we can speak without C Knowledge there is no Programming Logics to learn any language. There is no interviews for a Fresher without C language. To learn Java, .Net, Databases the list continues so many we require “C” Knowledge for a student Finally to tell many languages are internally Programmed by only C Language

Our Syllabus

We have provide you the following syllabus modules in your training period.

INTERODUCTION,DATA TYPES & OPERATORS

  1. Features of C
  2. History
  3. Structure of C Program
  4. Keyword, Identifiers & Constants

Data Types

  1. Primitive Data Types
  2. Aggregated Data Types

Operators

  1. Binary Operators
  2. Unary Operators
  3. Ternary Operators
  4. Special Operators
  5. Order of Evaluation

SELECTION,ITERTION & ARRAYS

  1. Simple if
  2. if..else
  3. Nested if
  4. if..else ladder
  5. Goto Statement
  6. Break and Continue Statement
  7. Switch..Case statement
    Itertion
  • While
  • For
  • Do..While
  • Nested loop Statements
    Arrays

  1. Introduction to arrays
  2. Need for ArraysNeed for Arrays
  3. Types of arrays
  4. One Dimensional Arrays
  5. Two Dimensional Arrays
  6. Multi Dimensional Arrays

STRING MANIPULATION,FUNCTIONS & STORAGE CLASS

  1. Declaring String
  2. Initializing String
  3. String Functions
  4. String Formatted Specifiers
  5. Multiple Strings
    Functions
  • Interdiction to Functions
  • Need for Functions
  • Classification of Functions
  • Function Prototype
  • Calling Function
  • Function with Arrays & Strings
  • Recursive Functions
    Storage Class Specifiers
  • Automatic
  • Extern
  • Static
  • Register

STRUCTURE ,UNIONS & ENUM

  1. Introduction to structures
  2. Declaring a Structure
  3. Introduction to Structures
  4. Structures with Arrays
  5. Structures with Function
  6. Nested Structures
  7. Introduction to Union
  8. Declaring Union
  9. Difference between Structures and Unions
  10. Enumerations
  11. Typedef

POINTERS & DYNAMIC MEMORY

  1. Introduction to Memory
  2. Introduction to Pointers
  3. Operations on Pointers
  4. Pointer to Pointer
  5. Pointer to Array
  6. Array to Pointers
  7. Void pointers
  8. Call by Value and Call by Reference
  9. Passing Pointers to Functions
  10. Functions returning Pointers
  11. Pointer to Functions
  12. Dynamic Functions Call with Function Pointer
  13. Pointers with Structures
    Dynamic Memory Allocation
  • Allocation (Malloc, Calloc & Realloc)
  • De – Allocation (Free)

DYNAMIC MEMORY ALLOCATION

  1. Allocation (Malloc, Calloc & Realloc)
  2. De – Allocation (Free)

FILES & GRAPHICS

  1. Introduction
  2. File Input, Output Operations
  3. Sequential Files
  4. Random Access Files
  5. Command Line Arguments
  6. Handling Errors
  7. Database vs File System
    Graphics
  • Introduction to Graphics
  • Initializing Graphics
  • Graphic Drivers & Modes
  • Graphic Functions

DATA STRUCTURES (DS)

  1. Introduction
  2. Stacks using Arrays
  3. Stacks using Linked List
  4. Queues using Arrays
  5. Queues using linked List
  6. Circular Queues
  7. De – Queues
  8. Singly Linked List
  9. Circular Linked List
  10. Doubly Linked List
  11. Infix, Prefix and Postfix
  12. Expressions
  13. Trees
  14. Binary Trees
  15. Directed Graphs, Undirected Graphs
  16. Searching Methods – BFS, DFS
  17. Searching Techniques – Linear, Binary
  18. Sorting Techniques – Bubble, Insertion,
  19. Selection, Quick, Heap and Merge.