Liu begins with propositional logic, truth tables, and logical equivalence. Unlike modern texts that spend 100+ pages, Liu covers the essentials in 30 crisp pages. He then moves quickly to predicates and quantifiers, ending with basic proof techniques (direct proof, contradiction).
| Feature | Information | | :--- | :--- | | Title | Elements of Discrete Mathematics | | Author | C. L. Liu (Chung Laung Liu) | | Edition | 2nd Edition (the most common) | | Publisher | McGraw-Hill College | | Year | 1985 (Second Edition) | | Pages | ~450-500 (depending on printing) | | ISBN (2nd Ed) | 978-0070381333 | | Key Topics | Logic, Set Theory, Combinatorics, Graph Theory, Boolean Algebra |
The demand for a PDF version of this text highlights a shift in how engineering mathematics is consumed. As university curriculums become more packed, students often need quick, searchable access to reference material. A digital copy allows for:
A brief introduction to automata theory: finite-state machines (FSMs), deterministic and nondeterministic models, regular languages, and grammars. liu elements of discrete mathematics pdf upd
When users search for the "upd" (updated) version, they are typically looking for the later editions, often the Second Edition or the version revised with D.P. Mohapatra. These versions modernized the problems and notation to align more closely with contemporary computer science curriculums, addressing the rapid evolution of the field during the 80s and 90s.
While core discrete math has not changed fundamentally, the pedagogical approach has. Later editions of Liu’s work include more computer science-oriented applications, moving away from pure mathematics toward applied logic.
If you acquire a copy (legally), follow this study plan: Liu begins with propositional logic, truth tables, and
| Week | Topic | Action | | :--- | :--- | :--- | | 1-2 | Logic & Proofs | Do all truth table exercises. Write 10 direct proofs. | | 3 | Set Theory | Memorize set identities. Prove De Morgan’s laws from axioms. | | 4-5 | Combinatorics | Solve 20 pigeonhole problems. Derive the binomial theorem. | | 6-7 | Recurrence | Solve 15 recurrence problems (Fibonacci, Tower of Hanoi). | | 8-9 | Graph Theory | Draw 30 graphs. Prove Euler’s theorem by hand. | | 10 | Boolean Algebra | Build truth tables for 5-variable functions. |
Q1: Is there a 3rd edition of Liu’s "Elements of Discrete Mathematics"? A: No. The 2nd edition (1985) was the last. Liu focused on research and other publications.
Q2: What is the best PDF version to search for? A: Search for "C. L. Liu Elements of Discrete Mathematics 2nd Edition scan" – better OCR quality than early 2000s scans. | Feature | Information | | :--- |
Q3: Does the "updated" PDF include solutions? A: Usually not. The original textbook does not contain solutions. You need a separate solution manual.
Q4: Can I use Liu’s book for self-study? A: Absolutely. But beginners may find it terse. Pair it with YouTube lectures (e.g., TrevTutor, Neso Academy).
Q5: Why is Liu’s book so expensive if it’s old? A: High demand from CS programs and low supply. Many universities still assign it, driving up used prices.
This chapter is algorithm-focused. Liu explains how to solve linear recurrence relations (homogeneous and non-homogeneous) using characteristic equations. Generating functions are introduced as a formal power series tool—crucial for analyzing recursive algorithms.
