Gandhi Nagar 1st lane
Berhampur
+91 8018033055
Mon-Fri 8:30am-7:30pm
info@aceit.com
24 X 7 online support

Data Structure

Course Details
  • Requirement of data structure
  • Basic terminology and elementary data organization
  • Data structure operations
  • Algorithms complexity
  • Time-space tradeoff
  • About function
  • Working with string
  • Working with math
  • Algorithm notation
  • Control statement
  • Variable and data type
  • Symbol specification and complexity
  • String processing
  • Character data type
  • Word processing
  • About array
  • Representation of array
  • Array application
  • Searching with array
  • Linear search
  • Binary search
  • Array with matrices
  • Addition matrices
  • Multiplication matrices
  • Diagonal matrices
  • Sparse matrices
  • Working with shorting
  • Bubble sort
  • Insertion sort
  • Selection sort
  • Marge sort
  • Quick sort
  • Radix sort
  • Heap sort ( for tree only)
  • Pointer array
  • Representation of records in memory , parallel array
  • About node and link list
  • Advantages of link list
  • Compare with array
  • Memory management for link list
  • Working with link list
  • Create list
  • Insert element
  • Delete element
  • View element
  • Count element
  • View memory position
  • Working with tow-way list
  • Specification
  • Working process.
  • About stack
  • Stack specification
  • Array with stack
  • Linked representation with stack
  • Stack algorithms
  • Stack applications
  • Stack insert and deletion process
  • Arithmetic expression polish notation
  • About queues
  • Queues with array representation
  • Queues execution process
  • Front and rare specification
  • Structure representation
  • Insert and delete element form a stack
  • Priority queue
  • Working with queues application
  • Basic of trees
  • Tree specification to create default tree
  • Binary tree
  • Representing binary tree in memory
  • Traversing tree
  • Header nodes
  • Binary search
  • AVL search tree
  • Insert tree element
  • Delete tree element
  • Heap a tree
  • Forest tree specification
  • Basic of graphs
  • Graph theory and terminology
  • Type of graphs
  • Direct graphs specification
  • Indirect graphs specification
  • Working with spinning tree
  • Calculate minimum cost
  • Operations of graphs
  • Warshall’s algorithms
  • Finding shortest paths