Object Oriented Data Structure & Algorithms Training Syllabus

C++ Language Contents:

• Introduction to C++ Language
• Difference and Similarities between C and C++
• Role Of Compilers and Assemblers
• Introduction to C++ Basic
• Flow Control Statements
• Jump statements
• Conditional Statements
• Iteration statements

Arrays:

• Introduction to Arrays
• Several examples of Arrays like insert, delete, counter occurrence of items etc.
• Searching
• Sorting
• 2 D Array
• Several Examples of 2 D arrays
• Multidimensional Array s

Strings:

• Introduction to Strings
• String handling built in functions
• Several examples of Strings
• Array of Strings
• Searching in Array of Strings
• Sorting in Array of Strings

POINTERS

• Introduction to pointers
• Pointer expressions
• Types of Pointers
• Void Pointer
• NULL Pointer
• Wild Pointer
• Dangling Pointer
• Various examples of pointers
• Pointer Arithmetic’s
• Array using pointers
• Array of pointer
• chaining pointer
• String using pointers
• Pointers in Functions

FUNCTIONS

• Introduction to functions
• Types of functions
• Nesting of functions
• Various examples of functions
• Strings passing is functions
• Array Passing in Functions
• Pointer passing is functions
• Function Returning Address
• Function returning address
• Recursion
• Various Examples and Interview Questions on Recursion and Function
• Storage classes

STRUCTURE

• Introduction to structure
• Advantages of structure
• Array of structure
• Structure using pointer
• Structure with functions
• Applications of structure

DYNAMIC MEMORY ALLOCATION

• Introduction to dynamic memory allocation
• Advantage of dynamic memory allocation
• new and delete operators
• Array implementation using dynamic memory allocation

Oops Introduction

• Oops vs. Procedural Programming Approach
• Oops Implementation
• Accessing class members
• Array of objects
• Types of members of class
• Instance members
• Static members
• Scope resolution Operator (::)
• Oops Approaches
• Encapsulation
• Nesting of Class(i.e. Outer Class, Inner Class, Local Class)
• Polymorphism
• Function Overloading
• Constructor & Destructor
• Deep Copy
• Shallow Copy
• Operator Overloading
• Function Overriding
• Reference variable
• Pointers
• Class object using pointer
• Array of objects using pointer
• This pointer Etc.
• Inheritance
• Single Inheritance
• Multiple Inheritance
• Multilevel Inheritance
• Hierarchical inheritance
• Hybrid Inheritance
• Need of Virtual
• Friend Function and Friend Class
• Function Overriding
• Binding Types
• Static Binding and Dynamic Binding
• Up casting and Down casting
• Virtual Function
• Abstraction
• Data Abstraction
• Abstract Class
• Pure Virtual Function
• Inline Functions
• Composition and Aggregation

Exception Handling

• Introduction to Exception Handling
• Need of Exception Handling
• try, throw, catch
• Multiple catch blocks

FILE MANAGEMENT

• Introduction to file management
• File opening modes
• Opening and closing a file
• Input output operations on file
• Error handling
• Applications of file management

Multithreading:

• Thread introduction
• Thread Synchronization
• Life cycle of thread
• Deal Lock situation

Templates (Generic Programming):

• Introduction to Templates and Generic Programming
• Advantages of template
• Template function and Template class

Standard Templates Library

• Container
• Class
• Functions
• Iterators
• List class
• Stack class
• Queue Class
• De Queue Etc.

DATA STRUCTURE AND ALGORITHMS CONTENT (using C++)

INTRODUCTION TO DATA STRUCTURE AND ALGORITHMS

• What is data structure
• Benefits of data structure
• Types of data structure
• Introduction to algorithms
• Types of Algorithms
• Time and Space Complexity
• Interview Questions

LINEAR DATA STRUCTURE

Non-linear data structure

Searching and sorting

Graph

Hashing

Interview Questions

Project

• Array
• String
• Link list
• Introduction to link list
• Array vs. link lists
• Types of link lists
• Implementation of link list
• Singly link list
• Insertion(at first position, last position and at used specific position) , deletion(at first position, last position and at used specific position) , traversing operations in Singly linked list
• Doubly link list
• Insertion (at first position, last position and at used specific position), deletion(at first position, last position and at used specific position) , traversing operations in Doubly linked list
• Circular link list
• Insertion(at first position, last position and at used specific position) , deletion(at first position, last position and at used specific position) , traversing operations in Circular linked list
• Application of link list
• Interview Questions
• Stack
• Introduction to stack
• Stack using array
• Stack using linked list
• Applications of stack
• Reverse Polish Notations(Infix to Postfix and Infix to Prefix)
• Interview Questions
• Queue
• Introduction to queue
• Queue using array
• Queue using linked list
• Applications of queue
• Introduction to circular queue
• Application of Circular queue
• Introduction to DeQueue(Double Ended Queue)
• Application of Dequeue
• Priority Queue
• Interview Questions
• Tree
• Introduction to trees
• Types of trees
• Implementation of tress
• Binary tree
• Binary search tree
• AVL tree
• Threaded binary tree
• M way tree
• M way search tree
• B tree
• Heap
• Various operations on trees
• Application of tress
• Interview Questions
• Searching in arrays
• Searching in strings
• Linear Search
• Binary Search
• Sorting
• Various sorting techniques
• Selection sort
• Bubble sort
• Insertion sort
• Quick sort
• Heap sort
• Merge sort
• Radix Sort
• Introduction of graph
• Types of graphs
• Implementation of graph using Adj. Matrix and Adj. list
• Various operations on graphs
• Shortest path search in graph
• Floyd Warshall Algorithm
• Dijkstra Algorithm
• Minimum spanning tree
• Kruskal’s Algorithm
• Prims Algorithm
• Applications of graphs
• Interview Questions
• Introduction of hashing
• Hash table
• Applications of hashing

object oriented data structure & algorithms Course Advantages

Utilizing web, we can get to the information whenever from any associated machine (PC, PC, tablet, telephone, and so on)

With productive utilization of information structure memory use can be improved, for e.g., we can utilize connected rundown versus clusters when we do not know about the size of information. When there is no more utilization of memory, it tends to be delivered.

Information designs can be reused, for example whenever we have executed a specific information structure, we can utilize it at some other spot. Execution of information constructions can be ordered into libraries which can be utilized by various customers.

Information structure fills in as the premise of theoretical information types, the information structure characterizes the actual type of ADT (Abstract Data Type). ADT is hypothetical and Data structure gives actual structure to them.

Information structures permit data stockpiling on hard plates.

gives intends to the board of huge dataset, for example, data sets or web ordering administrations.

Are essential for plan of effective calculations.

permits safe stockpiling of data on a PC. The data is then accessible for some time in the future and can be utilized by various projects. Furthermore, the data is gets and cannot be lost (particularly if it is put away on attractive tapes).

permits the information use and preparing on a product framework.

Permits simpler handling of information.