Explore

Deadlock conditions, prevention, avoidance, Banker's algorithm, and resource allocation graphs with worked examples.

1NF through BCNF, functional dependencies, and how to decompose relations without losing information.

Binary trees, BST operations, BFS, DFS, and shortest-path intuition for semester exams.

OSI vs TCP/IP, reliable transfer, congestion control, and routing notes for unit 2.

Short cheatsheet covering deadlock prevention strategies and comparison with avoidance.