Subject-Wise & Topic-Wise Study Library

Search and filter video links, detailed study text/notes, and standard reference books for HPSC, KVS, NVS, Programmer & Instructor exams.

Clear Filters

Search Keyword / Topic

Subject

Topic

Target Exam

All Resources Video Lectures Study Notes / Text Reference Books PDFs / PYQs

Showing 2 matching study resource(s)

Practice Quizzes on this Subject →

Study Notes Data Structures & Algorithms

Trees (Binary Tree, BST, AVL, B-Tree)

Binary Trees, BST, AVL & B-Tree Formula Cheat Sheet for Competitive Exams

All direct formulas for leaf nodes, height of binary trees, number of unlabeled binary trees (Catalan Number), and Heap time complexities.

### 1. Essential Binary Tree Formulas
1. **Maximum nodes at level L** (root at level 0): `2^L`
2. **Maximum nodes in a Binary Tree of height H** (root at height 0): `2^(H+1) - 1`
3. **Relati...

Exams: HPSC PGT CS, KVS PGT / TGT, NVS PGT CS, Computer Instructor

Study Notes Operating System (OS)

Deadlocks & Banker's Algorithm

Deadlock Necessary Conditions, Avoidance & Banker's Algorithm Complete Notes

High-yield revision notes on Coffman's 4 conditions, Resource Allocation Graph (RAG), and Safe Sequence formula.

### 1. Four Necessary Conditions for Deadlock (Coffman Conditions)
A deadlock situation can arise if and only if the following four conditions hold simultaneously in a system:
1. **Mutual Ex...

Exams: HPSC PGT CS, KVS PGT / TGT, RPSC / State Programmer, Computer Instructor