|
MCA 1 SEM. Subject: Data Structure with Algorithm
Unit – 1 Basics terminologies: Introduction to basic data Structures: Arrays, linked list, trees, stack, queue, Data structure operations; time complexity.
Unit – 2 Stacks, Queues: Stacks; Array representation of stack; Linked representation of stack; Various polish notation’s-Prefix, Postfix, infix; Evaluation of a postfix & Prefix expression; Conversion from one another; Application of stack; Queues; Linked representation of queues; Dqueues; Circular queue; Priority queue; Singly Linked list- Operation on it; Doubly linked list- Operation on it; Circular linked list.
Unit – 3 Searching and Sorting: Searching algorithm: linear search, binary search; sorting algorithms: Bubble sort, Insertion sort, Selection sort, Quick Sort, Merge sort and Heap sort.
Unit – 4 Trees : Binary trees; Representation of binary tree in memory; traversing binary tree; Traversing using stack; Binary search trees; Searching and inserting in binary search trees; Deleting in a binary search , tree; AVL search trees; Insertion and deletion in binary search trees; B trees: searching, insertion, deletion; Heap.
Unit – 5 Graphs Terminology & representation; Warshall algorithm; Shortest path; Minimum spanning tree; Kruskal & Dijkstara algorithm; Linked representation ofgraph; Operation on graph; Traversing a graph.
|
