B. Tech. - Data Structure Using C

Click here for  Module I 

Module I : Introduction to Data Structures

Definition, Types. Algorithm design, Complexity, Time-Space Tradeoffs. Use of pointers in data structures. Array Definition and Analysis, Representation of Linear Arrays in Memory, Traversing of Linear Arrays, Insertion And Deletion, Single Dimensional Arrays, Two Dimensional Arrays, Multidimensional Arrays, Function Associated with Arrays, Character String in C, Character String Operations, Arrays as parameters, Implementing One Dimensional Array, Sparse matrix.

Click here for Module II  

Module II:  Stacks and Queues: Definition, Array representation of stacks, Operations Associated with Stacks- Push & Pop, Polish expressions, Conversion of infix to postfix, infix to prefix (and vice versa),Application of stacks recursion, polish expression and their compilation, conversion of infix expression to prefix and postfix expression, Tower of Hanoi problem. Queue: Definition, Representation of Queues, Operations of queues- Insert, Delete, Priority Queues, Circular Queue, Deque.

Click here for Module III 

Module III: Programming with Linked Lists: Introduction to Singly linked lists: Representation of linked lists in memory, Traversing, Searching, Insertion into, Deletion from linked list, Garbage collection and compaction, doubly linked list, operations on doubly linked list, circular linked list, operations on circular linked list, generalized list. Applications of Linked List-Polynomial representation using linked list and basic operation. Stack and queue implementation using linked list.

Click here for Module IV 

Module IV: Trees: Basic Terminology, Binary Trees and their representation, expression evaluation, Complete Binary trees, extended binary trees, Traversing binary trees, Searching, Insertion and Deletion in binary search trees, General trees, AVL trees, Threaded trees, B trees.

Click here for Module V 

Module V: Searching and Sorting Techniques:  Insertion Sort, Bubble sort, Selection sort, Quick sort,  Merge sort, Heap sort, Partition exchange sort, Shell sort, Sorting on different keys, External sorting. Linear search, Binary search, Hashing:,Hash Functions, Collision Resolution Techniques.

Click here for Module VI 

Module VI: Graph and Their Applications: Introduction, Graph Theory Terminology, Sequential Representation of Graph (Adjacency and Path Matrix), Warshall Algorithms, Linked Representation of Graph, Different Operations on Graphs, Traversing A Graph(DFS, BFS)., Spanning Trees-Introduction .Representation of Spanning tree, Constructing A Spanning Tree(Prim’s Algorithm, Kruskal’s Algorithm).