Data Structure and algorithm preliminaries: Definitions; Time and Space analysis of Algorithms; Time and
space trade-off, Recursion, ADT
Array: Definitions of Arrays and Lists; Stacks; Queues; Strings; Row/Column major representation of Arrays;
Linked List: Singly linked list; circular linked list; doubly linked list, operations on linked list.
Stack: Push; Pop; Applications of Stack; stack representation using array and linked list.
Queue: Representation using array and linked list; Insertion and deletion operations; circular queue; priority queue.
Graph Algorithms: Representation and Traversal, Basic Algorithms Minimal Spanning Tree, Shortest Path, All pairs Shortest Path, Transitive Closer
Searching and Sorting Methods: Various Searching and Sorting algorithms with complexity analysis.
Tree: Definition; Generalised tree representation; Binary tree – definitions and properties; binary tree traversal
algorithms with and without recursion.
Binary Search Tree – creation, insertion and deletion operations, Threaded tree (One way and Two way); AVL
tree balancing; B-tree; Application of trees
- Lectures 0
- Quizzes 0
- Duration 2.5 MONTHS
- Students 27
- Assessments Self