Discrete mathematics / œc Richard Johnsonbaugh, DePaul University, Chicago

"An accessible introduction to the topics of discrete math, this best-selling text also works to expand students' mathematical maturity. With nearly 4,500 exercises, Discrete Mathematics provides ample opportunities for students to practice, apply, and demonstrate conceptual understanding....

Full description

Saved in:
Bibliographic Details
Main Author: Johnsonbaug, Richard (Author)
Format: Book
Language:English
Published: New York, NY Pearson œc [2018]
Edition:Eighth edition
Subjects:
Tags: Add Tag
No Tags, Be the first to tag this record!
Call Number :QA39.2 .J65 2018

MARC

LEADER 00000nam a2200000 c 4500
001 90400
003 MY-KLNDU
005 20241219045038.0
008 221104 20182005xxua i 001 0 eng d
020 |a 9780321964687 
020 |a 0321964683 
039 9 |a 202211041304  |b VLOAD  |c 202204141024  |d sani  |c 202203221248  |d sani  |c 202203221245  |d sani  |y 202107181442  |z dewi 
040 |a MY-KlNDU  |b eng  |c MY-KlNDU  |e rda 
050 0 0 |a QA39.2  |b .J65 2018 
090 |a QA39.2  |b .J65 2018 
100 1 |a Johnsonbaug, Richard  |e author 
245 1 0 |a Discrete mathematics / œc Richard Johnsonbaugh, DePaul University, Chicago 
250 |a Eighth edition 
264 1 |a New York, NY  |b Pearson œc [2018] 
264 4 |a ©2018 
300 |a xix, 747 pages  |b illustrations (some color)  |c 27 cm 
336 |a text  |2 rdacontent 
337 |a unmediated  |2 rdamedia 
338 |a volume  |2 rdacarrier 
504 |a Includes bibliographical references (pages 627-631) and index 
505 0 |a Sets and Logic -- Proofs -- Functions, Sequences, and Relations -- Algorithms -- Introduction to Number Theory -- Counting Methods and the Pigeonhole Principle -- Recurrence Relations -- Graph Theory -- Trees -- Network Models -- Boolean Algebras and Combinatorial Circuits -- Automata, Grammars, and Languages -- Appendix A: Matrices -- Appendix B: Algebra Review -- Appendix C: Pseudocode 
520 |a "An accessible introduction to the topics of discrete math, this best-selling text also works to expand students' mathematical maturity. With nearly 4,500 exercises, Discrete Mathematics provides ample opportunities for students to practice, apply, and demonstrate conceptual understanding. Exercise sets features a large number of applications, especially applications to computer science. The almost 650 worked examples provide ready reference for students as they work. A strong emphasis on the interplay among the various topics serves to reinforce understanding. The text models various problem-solving techniques in detail, then provides opportunity to practice these techniques. The text also builds mathematical maturity by emphasizing how to read and write proofs. Many proofs are illustrated with annotated figures and/or motivated by special Discussion sections. The side margins of the text now include "tiny URLs" that direct students to relevant applications, extensions, and computer programs on the textbook website." 
592 |a 20210137  |b 15/9/2021  |c RM741.48  |d NIJUYON 
650 0 |a Mathematics 
650 0 |a Computer science  |x mathematics 
999 |a vtls000100132  |c 90400  |d 90400