6EE5-DATA STRUCTURES IN C |
Units: I |
Performance Measurement: Space complexity and Time complexity, big oh, omega and
theta notations and their significance. Linear Lists - Array and linked representation, singly &
doubly linked lists. Concept of circular linked lists.
|
Units: II |
Array & Matrices: Row and Column Major mapping & representation, irregular 2D array,
Matrix operations, Special matrices: diagonal, tri-diagonal, triangular and symmetric. Sparse
matrices representation and its transpose. |
Units: III |
Stacks: Representation in array & linked lists, basic operation, Applications of stacks in
parenthesis matching, towers of Hanoi etc. Queues - Representation in array & linked lists,
applications, circular queues.
|
Units: IV |
Trees: Binary Tree, representation in array & linked lists, basic operation on binary trees,
binary tree traversal (preorder, post order, in order). Search Trees - Binary search tree,
indexed-binary search tree, basic operation, AVL tree, B-tree & Heap Tree.
|
Units: V |
Graphs: Representation of unweighted graphs, BFS, DFS, and Minimum cost spanning trees,
Single source shortest path. Sorting - Bubble sort, insertion sort, merge sort, selection sort,
quick sort, heap sort.
|
|