By Downloading Pdf file, you are accepting our Site Policies and Terms & Conditions.
DS Complete pdf notes(material 2)
Please find the DS Complete pdf notes(material 2) download button above
Unit-1:
Basic concepts of Algorithm,Preliminaries of Algorithm,Structure and Properties of Algorithm,Practical Algorithm Design Issues,Efficiency of Algorithms.
Unit-2:
STACKS AND QUEUES,Basic Stack Operations,Representation of a Stack using Arrays,Source code for stack operations, using array.
Unit-3:
TREES AND GRAPHS,Basic Tree Concepts,Binary Tree,Tree Terminology,Leaf node,Path,Siblings,Ancestor and Descendent,Subtree.
Unit-4:
SORTING TECHNIQUES,Bubble Sort,Bubble Sort Algorithm,Time Complexity,Selection Sort,Time Complexity,Insertion Sort.
Unit-5:
Binary Search Trees,Insert Node into the BST ,AVL Trees,AVL Rotations,Left Rotation,Right Rotation,Left-Right Rotation,Right-Left Rotation.
Other Useful Links