Course Details

Topics covered in this course:

Introduction on Data Structure

• Concepts of C language and go through Arrays, pointers, Recursive functions and understand the concept of Data Structure.

Sorting techniques

• Space & time complexity and cover following algorithms of Sorting in data structure: Selection, Bubble, Insertion, Quick and Radix.

Link List

• Implementation of Singly linked list, Doubly linked list, Circular linked list, Operations on link list - insertion, deletion, traversal and reverse, and Applications of link list.

Abstract Data Type (ADT)

• Concept of Stack, Operations on stack, Applications of stack, Concept of Queues, Operations on queue, Priority queue, Applications on queue and Heap sort.

Trees in Data Structure

• Concept of tree, Binary search tree, AVL Tree, Multi way trees (B-Tree, B*Tree), Red-Black tree, Operations on tree and Applications of tree.

Graphs

• Depth First Search (DFS) and Breadth First Search (BFS), Minimal spanning tree (Kruskal's and Prim's Algorithm), Shortest path (Dijkstra's algorithm) and Topological sorting.

Miscellaneous features

• Conversion of expression and evaluation of infix, postfix, prefix expressions. We will also cover Linear Queue, Circular Queue, Sparse matrix and Polynomial representation in detail.

Standard Template Library (STL)

• Template classes, vector, list, Map Hash Tables, Hash function, Collision resolution and Huffman's algorithm.