
Discrete Mathematics with Applications
Thomas Koshy(Author)
Academic Press
Published on 19. January 2004
Book
Hardback
1042 pages
978-0-12-421180-3 (ISBN)
Description
This approachable text studies discrete objects and the relationsips that bind them. It helps students understand and apply the power of discrete math to digital computer systems and other modern applications. It provides excellent preparation for courses in linear algebra, number theory, and modern/abstract algebra and for computer science courses in data structures, algorithms, programming languages, compilers, databases, and computation.
Reviews / Votes
"A good source of topics for discrete mathematics, and many topics are covered in very good breadth and depth.", H.K. Dai, Oklahoma State University"This text is better than the current one that I am using in the sense that it has been written in a less pure mathematics text style, which will be much more receivable for the student outside of mathematical major. The plenty of exercises provided allow instructor to have more flexibility to choose. The author's easy going but interesting writing style will certainly make instructor's job easier.", Nan Jiang, University of San Diego.More details
Language
English
Place of publication
San Diego
United States
Publishing group
Elsevier Science Publishing Co Inc
Target group
College/higher education
Dimensions
Height: 234 mm
Width: 191 mm
Weight
1790 gr
ISBN-13
978-0-12-421180-3 (9780124211803)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions

Thomas Koshy
Discrete Mathematics with Applications
E-Book
05/2014
Academic Press
€76.95
Available for download
Person
By Dr. Thomas Koshy
Content
Preface: A Word to the Student; 1. The Language of Logic; 2. The Language of Sets; 3. Functions and Matrices; 4. Induction and Algorithms; 5. Recursion; 6. Combinatorics and Discrete Probability; 7. Relations; 8. Graphs; 9. Trees; 10. Digraphs; 11. Formal Languages and Finite-State Machines; 12. Boolean Algebra and Combinatorial Circuits; Appendix; Bibliography; Solutions to Odd Numbered Exercises; Index.