| Summary: | Roadmap to the Syllabus: storage structure for arrays, sparse matrices; stacks and queues: representation and application; linked lists: single linked lists, linked list representation of stacks and queues; operations on polynomials; double linked list, circular list. Module II Dynamic storage management – garbage collection and compaction; infix to postfix conversion; postfix expression evaluation. Trees: tree terminology, binary tree, binary search tree, general tree, B+ tree, AVL tree, complete binary tree representation, tree traversals, operation on binary trees, expression manipulation. Module III Graphs – graph terminology, representation of graphs, path matrix, breadth first search (BFS), depth first search (DFS), topological sorting, Warshall’s algorithm (shortest path algorithm); sorting and searching techniques: bubble sort, selection sort, insertion sort, quick sort, merge sort, heap sort, radix sort; linear and binary search methods; hashing techniques and hash functions
|
|---|