Algorithms & Data Structures

The Algorithms & Data Structures training course would purely be stressed on various algorithms using necessary examples. This course begins with an introduction to Pointers, Arrays, difference between Pointers and Arrays, Recursive functions, Self Referential Structures, Linked Lists and Data Structures. Implementation is on either C or C++.

Building upon these basic concepts, you are made familiar and expert in understanding the above concepts. Subsequently, Analysis of Algorithms, basic sorting and searching algorithms are covered. Further the course would indulge with Hash tables, Trees, Graph algorithms, Data Compression & Encryption will be covered.

Course Agenda:

• Pointers, Array, 2D and 3D Arrays and Pointer to a 2D array
• Recursive function (stack building)
• Self referential structures
• Stack and Queue, Circular Queue implementation using Array and Linked list. Examples: Event handling (queue)
• Doubly LL, Trees, Binary Tree, BST, traversals, building a BST, deleting nodes
• Analysis of Algorithm techniques, efficiency of algorithms
• Searching & Sorting: (implementation and analysis) Binary search (spell checking example), BST search, Bubble sort, Selection Sort, Insertion sort, Merge sort, Quick sort (example: directory listing)
• Hash tables, Implementation, analysis and example for Chained Hash table, Open addressed Hash table
• Example for Binary tree: Expression processing
• Bit operations, Huffman Coding, Example: Optimized Networking
• Description of DES, Implementation and Analysis of DES