Deadlocks freeze system progress because two or more processes each hold a resource and wait for the other to release a resource. For example, Process A holds Resource 1 and requests Resource 2, while Process B holds Resource 2 and requests Resource 1. Both processes wait indefinitely, causing a deadlock. The execution table shows step-by-step how each process holds and requests resources, leading to both waiting forever. Variables track which resources are held and requested, and process states change from running to waiting. Key moments clarify why both wait forever, that deadlock requires mutual waiting, and that the system cannot recover without intervention. Visual quiz questions test understanding of resource requests, waiting steps, and effects of releasing resources. The quick snapshot summarizes deadlock as a cycle of waiting that halts system progress.