The dining philosophers problem illustrates the problem of deadlock in systems made up concurrent tasks. The problem was formulated by Edsger Dijkstra in 1965. The dining philosophers problem is explained and two programs in C language are discussed.