| Course details |
Introduction:
Definition of data structure, linear and non-linear data structure, Concepts and examples of elementary data objects, elementary data structures.
Arrays:
One dimensional, two dimensional, and multi dimensional arrays, representation of array in the memory. Array programming.
Linked lists:
Definition of linked list, node and pointer, array representation of a linked list, two way list, memory representation of lists.
Stack, queues and recursions:
Definition, different operations on stack, and queue, overflow and under flow, stack implementation using array, use and advantages, double ended queue, use, tower of honey problem, fibonacii, factorial problems etc using recursion.
Trees:
Definition, types, binary tree, general tree, different operations of binary tree, array and linked list representation of binary tree, problems, heap tree, binary search tree, weighted tree, Hoffman tree.
Graph:
Directed and general graph, node, vertex, edge, symmetric and asymmetric graphs, Array or link list representation of a graph. Traversing.
Memory Management:
Sorting and searching, and hash technique. |