Mathematics for computer science
By: Lehman, Eric
| Leighton, F. Thomson | Meyer, Albert R
Language: English Publisher: Creative Common License 2017Edition: Rev. edDescription: viii, 998p.; 28cmISBN: 9781680921229Subject(s): Computer science | Mathematical principlesDDC classification: 004.0151 LEH/M Online resources: Publisher's URL Summary: This book covers elementary discrete mathematics for computer science and engineering. It emphasizes mathematical definitions and proofs as well as applicable methods. Topics include formal logic notation, proof methods; induction, well-ordering; sets, relations; elementary graph theory; integer congruences; asymptotic notation and growth of functions; permutations and combinations, counting principles; discrete probability. Further selected topics may also be covered, such as recursive definition and structural induction; state machines and invariants; recurrences; generating functions.
| Item type | Current location | Collection | Call number | Status | Date due | Barcode |
|---|---|---|---|---|---|---|
Reference
|
CENTRAL LIBRARY Reference (Sahyadri Campus) | Reference | 004.0151 LEH/M | Not for loan | 09260 | |
Book
|
CENTRAL LIBRARY General Stack (Sahyadri Campus) | 004.0151 LEH/M | Checked out | 25/09/2025 | 09267 | |
|
Book
|
CENTRAL LIBRARY General Stack (Sahyadri Campus) | 004.0151 LEH/M | Checked out | 26/09/2025 | 09266 | |
|
Book
|
CENTRAL LIBRARY General Stack (Sahyadri Campus) | 004.0151 LEH/M | Checked out | 29/09/2025 | 09261 | |
|
Book
|
CENTRAL LIBRARY General Stack (Sahyadri Campus) | 004.0151 LEH/M | Checked out | 29/09/2025 | 09265 | |
|
Book
|
CENTRAL LIBRARY General Stack (Sahyadri Campus) | 004.0151 LEH/M | Checked out | 29/09/2025 | 09268 | |
|
Book
|
CENTRAL LIBRARY General Stack (Sahyadri Campus) | 004.0151 LEH/M | Checked out | 29/09/2025 | 09264 | |
|
Book
|
CENTRAL LIBRARY General Stack (Sahyadri Campus) | 004.0151 LEH/M | Checked out | 26/09/2025 | 09269 | |
|
Book
|
CENTRAL LIBRARY General Stack (Sahyadri Campus) | 004.0151 LEH/M | Checked out | 29/09/2025 | 09263 | |
|
Book
|
CENTRAL LIBRARY General Stack (Sahyadri Campus) | 004.0151 LEH/M | Checked out | 25/09/2025 | 09262 |
This book covers elementary discrete mathematics for computer science and engineering. It emphasizes mathematical definitions and proofs as well as applicable methods. Topics include formal logic notation, proof methods; induction, well-ordering; sets, relations; elementary graph theory; integer congruences; asymptotic notation and growth of functions; permutations and combinations, counting principles; discrete probability. Further selected topics may also be covered, such as recursive definition and structural induction; state machines and invariants; recurrences; generating functions.