Welcome to Nakshatra Software Training


C with DS Training Institute in vijayawada

Course Duration : 35 Hrs

Our main intention is to give in-depth knowledge of C programming language with limited students in a batch. For fast track batches, daily classes are provided for 2 hours and 30 days duration. Daily at least 5 to 10 interview questions are discussed in class based on current topic of the class.


C with DS Course Content

Computer

Software

Introduction to ‘C’ Language

  • History and generations of language
  • Features of ‘C ‘
  • Block diagram of C Program Execution
  • Structure of C language
  • C program development steps

Basics of ‘C’

  • Algorithms
  • Flowcharts
  • Keywords, identifiers, constants
  • Creating and running programs:
  • Writing, editing, compiling,
  • Linking, and executing.

Operators of C

  • Arithmetic,
  • Relational and logical operators
  • Conditional operator
  • Assignment operators
  • Increment and decrement operators
  • Operator’s precedence

Control Statements

  • Simple if
  • If-else
  • Nested if
  • Else if
  • Switch control statements
  • Sample programs

Iteration

  • While loop
  • Do-while loop
  • For loop,
  • Nested loops

Arrays

  • Introduction to Arrays
  • Need for Arrays
  • Types of Arrays
    • One dimensional Arrays
    • Two dimensional Arrays
    • Multidimensional Arrays

Strings

  • Strings Operations
  • String handling functions

Functions

  • Introduction to Functions
  • Need for Functions
  • Classification of Functions
  • Function prototypes
  • Defining Function
  • Calling Functions
  • Recursive Functions

Storage classes

  • Automatic
  • Static
  • Extern
  • Register
  • Header files

Structure & unions

  • Structures declaration, definition
  • Initialization of structures
  • Accessing structures
  • Nested structures

Pointers

  • Pointers- concepts
  • Initialization of pointer variables
  • Pointers to Pointers
  • Pointers to Functions
  • Pointers and Multidimensional arrays
  • Pointer arithmetic

Files

  • Introduction
  • File input, output operations
  • Sequential files
  • Random Access Files
  • Command Line Arguments
  • Handling Errors

Data Structures

  • Introduction
  • Stacks using arrays
  • Stacks using Linked list
  • Queues using Arrays
  • Queues using Linked list
  • Single Linked list
  • Double Linked list
  • Circular Linked list
  • Infix, Prefix and post fix
  • Trees
  • Binary Trees
  • Binary Search Trees
  • Directed graphs Undirected graphs

Classroom Training Enquiry Form