UNIT 1 | UNIT 2 | UNIT 3 |

UNIT 4 | UNIT 5 | UNIT 6 |

OBJECTIVE | PRIVIOUS QUESTION PAPERS | IMP QUESTIONS |

UNIT 1 | UNIT 2 | UNIT 3 |

UNIT 4 | UNIT 5 | UNIT 6 |

OBJECTIVE | PRIVIOUS QUESTION PAPERS | IMP QUESTIONS |

UNIT 1 | UNIT 2 | UNIT 3 |

UNIT 4 | UNIT 5 | UNIT 6 |

OBJECTIVE | PRIVIOUS QUESTION PAPERS | IMP QUESTIONS |

UNIT 1 | UNIT 2 | UNIT 3 |

UNIT 4 | UNIT 5 | UNIT 6 |

OBJECTIVE | PRIVIOUS QUESTION PAPERS | IMP QUESTIONS |

UNIT 1 | UNIT 2 | UNIT 3 |

UNIT 4 | UNIT 5 | UNIT 6 |

OBJECTIVE | PRIVIOUS QUESTION PAPERS | IMP QUESTIONS |

Ms.K. Kalpana,P.Gayathri

Basics of UNIX utilities and Shell Programming

Basics of UNIX utilities and Shell Programming

Basics of UNIX utilities and Shell Programming

Ms.T.Sukanya,Mrs.K.Kalpana

HASHING

AVL TREES

**
BalanceFactor = height(left-sutree) − height(right-sutree)**

In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any
time they differ by more than one, rebalancing is done to restore this property. To understand how
to rebalance a tree using the LL rotation, LR rotation, RR rotation, and RL rotation.

2-3 TREES

BINARY HEAP