Fundamentals of discrete math for computer science : a problem-solving primer / Tom Jenkyns ; Ben Stephenson.
Material type:
TextSeries: Undergraduate topics in computer scienceDescription: xii, 416 pages : illustrations ; 24 cmISBN: 9781447140689 (alk. paper); 1447140680 (alk. paper); 9781447140696 (ebk.)Subject(s): Computer science -- Mathematics | Computer science -- Mathematics | Informatique -- Mathématiques | AlgorithmesLOC classification: QA76.9.M35J46 2012
Contents:
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.
| Item type | Current library | Call number | Status | Date due | Barcode |
|---|---|---|---|---|---|
Hard Covered Materials
|
MACHAKOS UNIVERSITY LIBRARY Open shelf | QA76.9.M35J46 2012 (Browse shelf (Opens below)) | Available | 23273 |
Browsing MACHAKOS UNIVERSITY LIBRARY shelves, Shelving location: Open shelf Close shelf browser (Hides shelf browser)
|
|
|
|
|
|
|
||
| QA 76.9 .L45 2004 The web worrior guide to web Database Technologies/ | QA 76.9 .M33T35 1985 Elements of computer mathematics | QA76.9 .M35 1996 Lectures on numerical methods in bifurcation problems/ | QA76.9.M35J46 2012 Fundamentals of discrete math for computer science : | QA76.9.M65Q5 2015 Ethics for the Information Age/ | QA76.9.O35L37 1997 Applying UML and patterns : | QA 76.9.P38 2005 Computer organization and design: the hardware/software interface/ |
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.