|
B.Tech. IT 3rd Sem Subject: Data Structure with Algorithm
Unit – 1 String algorithms, Arrays algorithms development simple examples of algorithm development, Complexity, Divided & conquer binary search, Selection sort, Insertion sort, Merge sort, Quick sort, Complexity of sorting.
UNIT – 2 Linear list Stacks, Application of Stacks, arithmetic notations, queues and circular queues , Linked list definition in C, creation and deletion of nodes , circular and doubly linked list .
UNIT – 3 Trees Basic Technology, Binary Tree, Binary tree representation, algebra Expressions, complete Binary Tree, Extended Binary Tree, Array and linked Representation of Binary trees, traversing Binary Trees traversing Threaded Binary trees, Binary search trees(BST), Insertion and deletion in BST, AVL trees, heap sort.
UNIT – 4 Graph and representation Graph algorithms, minimum spanning tree, shortest path, DFS, BFS search, hashing.
UNIT – 5 Files File organization, sequential file, direct file organization, index sequential file organization, Data storage and management.
|
