Boost Your Career with Best C, C++ & Data Structures Course Institute in Delhi

• Conditional Control Statementsif
• if-else
• nested if-else
• else-if ladder
• Multiple Branching Control Statement
• switch-case
• Loop Control Statements
• while
• do-while
• for
• Nested Loops
• Jump Control statements
• break
• continue
• goto
• exit
• return
• FAQ’s

• What is function?
• Why function?
• Advantages of using functions
• Function Prototype
• Defining a function
• Calling a function
• Return statement
• Types of functions
• Recursion
• Nested functions
• main() function
• Library Function
• Local and global variables
• Programming Examples
• FAQ’s

• Types of storage class
• Scoping rules
• Dealing with all storage classes
• Programming Examples
• FAQ’s

• Def of Pointer
• Declaration of Pointer Variables
• Assigning Address to Pointer

• De-referencing Pointer Variables
• Pointer to Pointer
• Pointer Arithmetic
• Pointer comparisons
• De-reference and increment pointer
• pointer to const data
• const pointer
• const pointer to const data
• Void pointer or Generic Pointer
• Null pointer
• wild pointer
• Programming Examples
• FAQ’svironment

• Parameter Passing Techniques – call by value, call by address
• Using Pointers as Arguments
• Function Returning value
• Returning More than one value From A
• Functions Returning Address
• Function Returning Pointers
• Dangling pointer
• Pointer to a Function
• Calling A function through function pointer
• passing A function’s address as an Argument to other function
• Functions with variable number of arguments
• Programming Examples
• FAQ’s

• One dimensional arrays
• Declaration of 1D arrays
• Initialization of 1D arrays
• Accessing element of 1D arrays
• Reading and displaying elements
• Two dimensional arrays
• Declaration of 2D arrays
• Initialization of 2D arrays
• Accessing element of 2D arrays
• Reading and displaying elements
• Programming Examples

• Pointer and one dimensional arrays
• Subscripting pointer variables
• Pointer to an array
• Array of pointers
• Pointers and two dimensional arrays
• Subscripting pointer To an array
• Programming Examples
• FAQ’s

• 1D array and function
• Passing individual array elements to a function
• passing individual array elements address to a function
• passing whole 1d array to a function
• 2D array and function
• Passing individual array elements to a function
• passing individual array elements address to a function
• passing whole 2d array to a function
• using arrays of function pointer
• Programming Examples
• FAQ’s

• malloc()
• calloc()
• realloc()
• free()
• Core dump
• Memory leak
• Dynamic 1D and 2D Arrays
• Programming Examples
• FAQ’s

• Strings versus character arrays
• Initializing strings
• Reading string
• Displaying string
• The %s format specifier
• The gets() and puts() functions
• string handling functions
• string pointers
• Two-dimensional character arrays or array of string
• array of pointers to strings
• Programming Examples
• FAQ’s

   

• Principle of Object Oriented Programming
• Software evaluation
• Oop paradigm
• .Basic concept of Oop
• .Benefits of Oop
• .Application of Oop

• Introduction to C++
• Tokens
• Keywords
• Identifiers
• .Constants
• Operators
• Manipulators
• Expressions and control structure
• Pointers
• Functions
• Function prototyping
• Parameters passing in functions
• Values Return by functions
• Inline functions – friend and virtual functions

• Classes, objects, constructors and destructors
• Operator overloading
• Type conversions
• Type of constructors
• Function over loading

• Inheritance
• Type of inheritance
• Function
• Polymorphism
• Constructors in heritance
• Mapping console IO operations

• Files – File stream – File operators
• File pointer
• Error handling during file operations
• Command line arguments

• Time complexity
• Space complexity

• Big O
• Omega
• Theta notations

• Malloc()
• calloc()
• realloc()
• free()

• Stack Operations
• push()
• pop()
• peex()
• distzay()
• isEmpty()
• isFull()
• Stack implementation using arrays Applications
• Decimal to Binary
• String reverse
• Number reverse
• Recursion – Towers of Hanoi
• Balanced Parentheses
• Expressions

• Introduction to Notations
• Importance of Notations in expression evaluation
• Conversion Algorithms
• Infix to prefix
• Infix to postfix
• Prefix to infix
• Prefix to postfix
• Postfix to infix
• Postfix to prefix
• Implementation of all the conversions

• Operations on Queue – enqueue(), dequeue()
• Queue implementation using static arrays
• Applications
• Queues Implementations using pointer (dynamic)

• Introduction
• Construction
• Length
• Insertion
• Deletion
• Sort
• Reverse list
• Swap node data
• Swap nodes
• Applications

• Terminology
• Differences between Tree and Binary Tree
• Binary Tree Representations
• Expression Trees
• Traversals
• In-order
• pre-order
• post-order
• Introduction to BST
• Insertion
• Deletion
• Search
• Implementation

• Introduction
• BST v/s AVL
• Rotations
• L-L-Rotation
• R-R-Rotation
• L-R-Rotation
• R-L-Rotation
• Insertion
• Deletion
• Traversal

Red Black Trees

• Introduction
• BST v/s AVL v/s RBT
• Rotations
• L-L-Rotation
• R-R-Rotation
• L-R-Rotation
• R-L-Rotation
• Insertion
• Deletion

B trees

• M-way Search Tree
• Search
• Insertion
• Deletion

Hashing

• Hash Table representation
• Hash function-Division Method
• Collision
• Collision Resolution Techniques
• Separate Chaining
• open addressing
• linear probing
• quadratic probing
• double hashing
• Rehashing

• Operations-Insertion, Deletion,

Heap

• Definition
• Max Heap
• Min Heap
• Insertion and deletion

Pattern matching algorithms

• Brute force
• Boyer –Moore algorithm
• Knuth-Morris-Pratt algorithm

Tries

• Standard Tries
• Compressed Tries
• Suffix tries