|
" Fundamentals of discrete math for computer science : "
Tom Jenkyns; Ben Stephenson
| Document Type
|
:
|
BL
|
| Record Number
|
:
|
665939
|
| Doc. No
|
:
|
dltt
|
| Main Entry
|
:
|
Jenkyns, T. A., (Tom A.)
|
| Title & Author
|
:
|
Fundamentals of discrete math for computer science : : a problem-solving primer /\ Tom Jenkyns; Ben Stephenson
|
| Publication Statement
|
:
|
London ;New York :: Springer,, c2013
|
| Series Statement
|
:
|
Undergraduate topics in computer science
|
| Page. NO
|
:
|
xii, 416 p.: ill.; 24 cm
|
| ISBN
|
:
|
9781447140689
|
|
|
:
|
: 1447140680
|
| 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
|
| Subject
|
:
|
Computer science-- Mathematics
|
| LC Classification
|
:
|
QA76.9.M35J46 2013
|
| Added Entry
|
:
|
Stephenson, Ben, (Benjamin David)
|
| |