Before the 1980s, the mathematical training of a computer scientist was predominantly rooted in calculus and linear algebra. Norman L. Biggs, a distinguished professor at the London School of Economics (LSE), recognized a fundamental mismatch. Computer science, he argued, was not the continuous mathematics of Newton, but the discrete mathematics of Leibniz: logic, graphs, trees, and finite sets.
The book is typically divided into three main sections, covering 27 chapters in the second edition. 1. Foundations norman l. biggs discrete mathematics pdf
Assuming you obtain the legitimately, simply staring at a screen won't teach you math. Here is a pedagogical strategy: Before the 1980s, the mathematical training of a
The search for a PDF of this book usually stems from a desire to quickly reference specific concepts. The book is lauded for its clear structure, moving from elementary concepts to advanced applications. Key chapters cover: Computer science, he argued, was not the continuous
The Second Edition (2002) is the most common version, building upon the revised 1993 edition.
Published by Oxford University Press, the book carries the weight of the "Clarendon Press" legacy. It emphasizes logic over rote memorization. While American textbooks often balloon to 1,000 pages with flashy sidebars, Biggs’ text is lean, precise, and relentless. It assumes the reader wants to think like a mathematician, not just pass a multiple-choice exam.
Platforms like or Amazon Kindle allow you to "rent" the digital version of the book for a semester. This usually costs a fraction of the physical book price, gives you a high-quality PDF/ePub format, and is perfectly legal.