大葉大學圖書館 |

登入

回首頁

Discrete mathematics /

Johnsonbaugh, Richard, (1941-)

Discrete mathematics /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
杜威分類號:	510
書名/作者:	Discrete mathematics // Richard Johnsonbaugh.
作者:	Johnsonbaugh, Richard,
出版者:	NY, NY : : Pearson,, [2019]
面頁冊數:	767 pages ;; 26 cm
標題:	Mathematics.
標題:	Computer science - Mathematics.
ISBN:	1292233702(pbk.)
ISBN:	9781292233703(pbk.)
書目註:	Includes bibliographical references and index.
內容註:	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
摘要、提要註:	"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." -- Provided by publisher.

Discrete mathematics /
Johnsonbaugh, Richard,1941-

Discrete mathematics /Richard Johnsonbaugh. - Eighth edition.Global edition. - NY, NY :Pearson,[2019] - 767 pages ;26 cm

Includes bibliographical references and index.

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

"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." -- Provided by publisher.

ISBN: 1292233702(pbk.)NTD 1320Subjects--Topical Terms:

172349
Mathematics.

LC Class. No.: QA39.2 / .J65 2019

Dewey Class. No.: 510

Discrete mathematics /
LDR:02140cam a2200241Ii 4500 001 483836
003
005
008 191017s2019 nyu b 001 0 eng d
020 $a 1292233702(pbk.) $c NTD 1320
020 $a 9781292233703(pbk.) $c NTD 1320
040 $a YDX $b eng $e rda $c YDX $d OCLCQ $d DYU
050 # 4 $a QA39.2 $b .J65 2019
082 0 4 $a 510 $2 23
100 1 $a Johnsonbaugh, Richard, $d 1941- $e author. $3 699046
245 1 0 $a Discrete mathematics / $c Richard Johnsonbaugh.
250 $a Eighth edition.Global edition.
260 # 1 $a NY, NY : $b Pearson, $c [2019]
300 $a 767 pages ; $c 26 cm
336 $a text $b txt $2 rdacontent
337 $a unmediated $b n $2 rdamedia
338 $a volume $b nc $2 rdacarrier
504 $a Includes bibliographical references 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." -- Provided by publisher.
650 # 0 $a Mathematics. $3 172349
650 # 0 $a Computer science $x Mathematics. $3 382369