Fundamentals of discrete math for computer science
a problem-solving primer
Jenkyns, T. A. (Tom A.)
creator
Stephenson, Ben (Benjamin David)
text
enk
2013
2013
monographic
eng
xii, 416 pages : illustrations ; 24 cm.
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.
Tom Jenkyns ; Ben Stephenson.
Computer science
Mathematics
Computer science
Mathematics
Informatique
Mathématiques
Algorithmes
QA76.9.M35J46 2012
Undergraduate topics in computer science
9781447140689 (alk. paper)
1447140680 (alk. paper)
9781447140696 (ebk.)
2012945303
BTCTA
120726
20201006140648.0
17402530
eng