This text combines the theoretical foundations of computing with essential discrete mathematics. It follows the same organization as its predecessor, "Foundations of Computer Science" (also published by W.H. Freeman), with all examples and exercises in C.

It shows you how to use such essential data structures as lists, stacks, queues, sets, trees, heaps, priority queues, and graphs. He explains how to use algorithms for sorting, searching, numerical analysis, data compression, data encryption, common graph problems, and computational geometry.

download