Monday, October 14, 2019

Syllabus for data structure

In this post , I am providing a full syllabus for data structure , also share which topic important for examination .

So Read Below full syllabus for data structure .


  



1.  Shorting and Searching Techniques -

• Sell Short and Sequential 

• Interpolation 


• Bubble


• Insertion

• Selection 


• Binary Search Tree Short 

• Radix Short


• Heap Short



2. Hashing Techniques -


• Address Calculation Techniques 

• Common Hashing Function 

• Double Hashing

• Collision Resolution 

• Bucket Hashing 

• Hash Function

• Deletion and Rehashing 

• Linear Probing and Quadratic


3. Introduction to tree -

• Binary Trees 

• Search Tree

• Expression Tree

• General Tree

• General Search Tree


4. Multi - way trees

• B - Trees : insertion  ,  Deletion  , Traverse - B  Tree  ,  B - Tree Search 

• M - way Search Trees 

• B - Tree Search 

5. Linear Lists 

Linked List Alogrthms

• Linked Lists : Nodes , Linked Data structure 

• Linear List Concept 

• Complex Linked List Structures

• List v/s Array 

• Stacks : LIFO Structure , pop , push , delete Stack 

• Queues : FIFO Structure , Circular Queues 


6. Heaps -

Basic Algorithm  : Build heap , Insert , delete , Reheap Down , Reheap up 

• Structure 




Some important question -

• write short notes on - Bubble Short

• Define Sequential Searching Techniques 

• What is Bucket Hashing 

• Define Binary Search Tree 

• Write Short notes on - Multi Way Tree and B Trees











No comments:

Post a Comment