Fundamentals of discrete math for computer science : a problem-solving primer / Tom Jenkyns, Ben Stephenson.
Material type:
TextSeries: Undergraduate topics in computer sciencePublication details: Cham, Switzerland : Springer, c2018.Edition: 2nd edDescription: xiii, 512 p. : illISBN: - 9783319701509 (pbk.)
- 3319701509 (pbk.)
- QA76.9.M35 J465 2018
| Item type | Home library | Shelving location | Call number | Status | Barcode | |
|---|---|---|---|---|---|---|
|
|
Punsarn Library | General Stacks | QA76.9.M35 J465 2018 (Browse shelf(Opens below)) | Available | PNLIB21062558 |
Browsing Punsarn Library shelves Close shelf browser (Hides shelf browser)
Includes index.
Algorithms, Numbers and Machines -- Sets, Sequences and Counting -- Boolean Expressions, Logic and Proof -- Searching and Sorting -- Graphs and Trees -- Relations: Especially on (Integer) Sequences -- Sequences and Series -- Generating Sequences and Subsets -- Discrete Probability and Average Case Complexity -- Turing Machines.
There are no comments on this title.
