DATA STRUCTURES-II

-

 UNIT – I 

Tree: Header nodes, Threads, Binary search trees, Searching, Insertion and deletion in aBinary search tree, AVL search trees, Insertion and deletion in AVL search tree, m-waysearch tree, Searching, Insertion and deletion in an m-way search tree, B-trees, Searching,Insertion and deletion in a B-tree, B+tree, Huffman’s algorithm, General trees. 


UNIT – II 

Graphs: Warshall’s algorithm for shortest path, Dijkstra algorithm for shortest path, Operations on graphs, Traversal of graph, Topological sorting. 

UNIT – III 


Sorting: Internal & external sorting, Radix sort, Quick sort, Heap sort, Merge sort.

Searching: Liner search, binary search, merging, Comparison of various sorting and searching algorithms on the basis of their complexity. 

UNIT – IV 


Files: Physical storage devices and their characteristics, Attributes of a file viz fields, records,Fixed and variable length records, Primary and secondary keys, Classification of files, File operations, Comparison of various types of files, 

File organization: Serial, Sequential,Indexed-sequential, Random-access/Direct, Inverted, Multilist file organization. Hashing: Introduction, Hashing functions and Collision resolution methods .

Popular posts from this blog

DATA STRUCTURES FOR BCA

-
UNIT – I  Introduction: Elementary data organization, Data Structure definition , Data type vs. data structure , Categories of data structures, Data structure operations, Applications of data structures, Algorithms complexity and time-space tradeoff, Big-O notataion.   Strings: Introduction, Storing strings, String operations, Pattern matching algorithms.  UNIT – II  Arrays: Introduction, Linear arrays, Representation of linear array in memory, address calculations, Traversal, Insertions, Deletion in an array, Multidimensional arrays, Parallel arrays, Sparse arrays.  Linked List: Introduction, Array vs. linked list, Representation of linked lists in memory, Traversal, Insertion, Deletion, Searching in a linked list, Header linked list, Circular linked list, Two-way linked list, Threaded lists, Garbage collection, Applications of linked lists.  UNIT – III  Stack: Introduction, Array and linked representation of stacks, Operations on stacks, Ap...
Read more

DATA STRUCTURES FOR B.TECH

-
DATA STRUCTURES Unit 1: Introduction :   Basic Terminologies:   C oncept of Data Structure, Choice of right Data Structure , Algorithms , how to design and develop algorithm, Complexity of algorithm.   Operations: insertion, deletion, traversal etc,   Analysis of an Algorithm. Searching:  Linear Search and Binary Search Techniques and their complexity analysis. Unit 2: Stacks  and  Queues : Stack  and  its  operations: Algorithms and their complexity analysis, Applications of Stacks: Expression       Conversion and evaluation -corresponding algorithms and complexity analysis. queue, Types of Queue: Simple  Queue, Circular Queue, Priority Queue ; Operations on each types of Queues: Algorithms and their analysis.   Unit 3 : Linked Lists:      Singly   linked  lists: Representation in memory, Algorithms of several operations:...
Read more