南開科技大學圖書館 |

Language: 繁體中文

說明(常見問題)

南開科技大學

圖書館首頁

編目中圖書申請

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Essential discrete mathematics for computer science /

紀錄類型:	書目-語言資料,印刷品 : 單行本
正題名/作者:	Essential discrete mathematics for computer science // Harry Lewis and Rachel Zax.
作者:	Lewis, Harry R.
其他作者:	Zax, Rachel.
出版者:	Princeton, New Jersey :Princeton University Press,c2019.
面頁冊數:	xii, 388 p. :ill. (some col.) ;27 cm.
附註:	Includes index.
標題:	Computer science - Mathematics. -
ISBN:	9780691179292 (bound) :
ISBN:	0691179298 (bound)

Essential discrete mathematics for computer science /
Lewis, Harry R.

Essential discrete mathematics for computer science /Harry Lewis and Rachel Zax. - Princeton, New Jersey :Princeton University Press,c2019. - xii, 388 p. :ill. (some col.) ;27 cm.

Includes index.

The pigeonhole principle -- Basic proof techniques -- Proof by mathematical induction -- Strong induction -- Sets -- Relations and functions -- Countable and uncountable sets -- Structural induction -- Propositional logic -- Normal forms -- Logic and computers -- Quantificational logic -- Directed graphs -- Digraphs and relations -- States and invariants -- Undirected graphs -- Connectivity -- Coloring -- Finite automata -- Regular languages -- Order notation -- Counting -- Counting subsets -- Series -- Recurrence relations -- Probability -- Bayes' theorem -- Random variables and expectation -- Modular arithmetic -- Public key cryptography.

Discrete mathematics is the basis of much of computer science, from algorithms and automata theory to combinatorics and graph theory. Essential Discrete Mathematics for Computer Science aims to teach mathematical reasoning as well as concepts and skills by stressing the art of proof. It is fully illustrated in color, and each chapter includes a concise summary as well as a set of exercises.--

ISBN: 9780691179292 (bound) :NT1643

LCCN: 2018960770Subjects--Topical Terms:

156381
Computer science
--Mathematics.

LC Class. No.: QA76.9.M35 / L485 2019

Dewey Class. No.: 004.01/51

Essential discrete mathematics for computer science /
LDR:01830cam a2200229 a 4500 001 1000103657
005 20200801092531.0
008 181009s2019 njua 001 0 eng d
010 $a 2018960770
020 $a 9780691179292 (bound) : $c NT1643
020 $a 0691179298 (bound)
035 $a (OCoLC)on1051134793
035 $a 20699537
040 $a YDX $b eng $c YDX $d OCLCQ $d YDXIT $d MNW $d BUB $d OCLCF $d YDXIT $d CHVBK $d OCLCO $d BDX $d COD $d DLC
042 $a lccopycat
050 0 0 $a QA76.9.M35 $b L485 2019
082 0 4 $a 004.01/51 $2 23
100 1 $a Lewis, Harry R. $3 184814
245 1 0 $a Essential discrete mathematics for computer science / $c Harry Lewis and Rachel Zax.
260 # $a Princeton, New Jersey : $b Princeton University Press, $c c2019.
300 $a xii, 388 p. : $b ill. (some col.) ; $c 27 cm.
500 $a Includes index.
505 0 # $a The pigeonhole principle -- Basic proof techniques -- Proof by mathematical induction -- Strong induction -- Sets -- Relations and functions -- Countable and uncountable sets -- Structural induction -- Propositional logic -- Normal forms -- Logic and computers -- Quantificational logic -- Directed graphs -- Digraphs and relations -- States and invariants -- Undirected graphs -- Connectivity -- Coloring -- Finite automata -- Regular languages -- Order notation -- Counting -- Counting subsets -- Series -- Recurrence relations -- Probability -- Bayes' theorem -- Random variables and expectation -- Modular arithmetic -- Public key cryptography.
520 # $a Discrete mathematics is the basis of much of computer science, from algorithms and automata theory to combinatorics and graph theory. Essential Discrete Mathematics for Computer Science aims to teach mathematical reasoning as well as concepts and skills by stressing the art of proof. It is fully illustrated in color, and each chapter includes a concise summary as well as a set of exercises.-- $c Source other than the Library of Congress.
650 # 0 $a Computer science $x Mathematics. $3 156381
700 1 # $a Zax, Rachel. $3 1000128672