東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Fundamentals of discrete math for co...

Jenkyns, Tom.

FindBook

Google Book

Amazon

博客來

Fundamentals of discrete math for computer science = a problem-solving primer /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Fundamentals of discrete math for computer science/ by Tom Jenkyns, Ben Stephenson.
其他題名:	a problem-solving primer /
作者:	Jenkyns, Tom.
其他作者:	Stephenson, Ben.
出版者:	Cham :Springer International Publishing : : 2018.,
面頁冊數:	xiii, 512 p. :ill., digital ;24 cm.
內容註:	Algorithms, Numbers and Machines -- Sets, Sequences and Counting -- Boolean Expressions, Logic and Proof -- Searching and Sorting -- Graphs and Trees -- Relations: Especially on (Integer) Sequences -- Sequences and Series -- Generating Sequences and Subsets -- Discrete Probability and Average Case Complexity -- Turing Machines.
Contained By:	Springer eBooks
標題:	Computer science - Mathematics. -
電子資源:	http://dx.doi.org/10.1007/978-3-319-70151-6
ISBN:	9783319701516

Fundamentals of discrete math for computer science = a problem-solving primer /
Jenkyns, Tom.

Fundamentals of discrete math for computer sciencea problem-solving primer /[electronic resource] :by Tom Jenkyns, Ben Stephenson. - 2nd ed. - Cham :Springer International Publishing :2018. - xiii, 512 p. :ill., digital ;24 cm. - Undergraduate topics in computer science,1863-7310. - Undergraduate topics in computer science..

Algorithms, Numbers and Machines -- Sets, Sequences and Counting -- Boolean Expressions, Logic and Proof -- Searching and Sorting -- Graphs and Trees -- Relations: Especially on (Integer) Sequences -- Sequences and Series -- Generating Sequences and Subsets -- Discrete Probability and Average Case Complexity -- Turing Machines.

This clearly written textbook presents an accessible introduction to discrete mathematics for computer science students, offering the reader an enjoyable and stimulating path to improve their programming competence. The text empowers students to think critically, to be effective problem solvers, to integrate theory and practice, and to recognize the importance of abstraction. Its motivational and interactive style provokes a conversation with the reader through a questioning commentary, and supplies detailed walkthroughs of several algorithms. This updated and enhanced new edition also includes new material on directed graphs, and on drawing and coloring graphs, in addition to more than 100 new exercises (with solutions to selected exercises) Topics and features: Assumes no prior mathematical knowledge, and discusses concepts in programming as and when they are needed Designed for both classroom use and self-study, presenting modular and self-contained chapters that follow ACM curriculum recommendations Describes mathematical processes in an algorithmic manner, often supported by a walkthrough demonstrating how the algorithm performs the desired task Includes an extensive set of exercises throughout the text, together with numerous examples, and shaded boxes highlighting key concepts Selects examples that demonstrate a practical use for the concept in question Students embarking on the start of their studies of computer science will find this book to be an easy-to-understand and fun-to-read primer, ideal for use in a mathematics course taken concurrently with their first programming course. Dr. Tom Jenkyns is a retired Associate Professor from the Department of Mathematics and the Department of Computer Science at Brock University, Canada. Dr. Ben Stephenson is a Teaching Professor in the Department of Computer Science at the University of Calgary, Canada.

ISBN: 9783319701516

Standard No.: 10.1007/978-3-319-70151-6doiSubjects--Topical Terms:

532725
Computer science
--Mathematics.

LC Class. No.: QA76.9.M35

Dewey Class. No.: 004.0151

Fundamentals of discrete math for computer science = a problem-solving primer /
LDR:03343nmm a2200361 a 4500 001 2145867
003 DE-He213
005 20180503043544.0
006 m d
007 cr nn 008maaau
008 190227s2018 gw s 0 eng d
020 $a 9783319701516 $q (electronic bk.)
020 $a 9783319701509 $q (paper)
024 7 $a 10.1007/978-3-319-70151-6 $2 doi
035 $a 978-3-319-70151-6
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.M35
072 7 $a PBD $2 bicssc
072 7 $a UYAM $2 bicssc
072 7 $a COM018000 $2 bisacsh
072 7 $a MAT008000 $2 bisacsh
082 0 4 $a 004.0151 $2 23
090 $a QA76.9.M35 $b J53 2018
100 1 $a Jenkyns, Tom. $3 3331864
245 1 0 $a Fundamentals of discrete math for computer science $h [electronic resource] : $b a problem-solving primer / $c by Tom Jenkyns, Ben Stephenson.
250 $a 2nd ed.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2018.
300 $a xiii, 512 p. : $b ill., digital ; $c 24 cm.
490 1 $a Undergraduate topics in computer science, $x 1863-7310
505 0 $a Algorithms, Numbers and Machines -- Sets, Sequences and Counting -- Boolean Expressions, Logic and Proof -- Searching and Sorting -- Graphs and Trees -- Relations: Especially on (Integer) Sequences -- Sequences and Series -- Generating Sequences and Subsets -- Discrete Probability and Average Case Complexity -- Turing Machines.
520 $a This clearly written textbook presents an accessible introduction to discrete mathematics for computer science students, offering the reader an enjoyable and stimulating path to improve their programming competence. The text empowers students to think critically, to be effective problem solvers, to integrate theory and practice, and to recognize the importance of abstraction. Its motivational and interactive style provokes a conversation with the reader through a questioning commentary, and supplies detailed walkthroughs of several algorithms. This updated and enhanced new edition also includes new material on directed graphs, and on drawing and coloring graphs, in addition to more than 100 new exercises (with solutions to selected exercises) Topics and features: Assumes no prior mathematical knowledge, and discusses concepts in programming as and when they are needed Designed for both classroom use and self-study, presenting modular and self-contained chapters that follow ACM curriculum recommendations Describes mathematical processes in an algorithmic manner, often supported by a walkthrough demonstrating how the algorithm performs the desired task Includes an extensive set of exercises throughout the text, together with numerous examples, and shaded boxes highlighting key concepts Selects examples that demonstrate a practical use for the concept in question Students embarking on the start of their studies of computer science will find this book to be an easy-to-understand and fun-to-read primer, ideal for use in a mathematics course taken concurrently with their first programming course. Dr. Tom Jenkyns is a retired Associate Professor from the Department of Mathematics and the Department of Computer Science at Brock University, Canada. Dr. Ben Stephenson is a Teaching Professor in the Department of Computer Science at the University of Calgary, Canada.
650 0 $a Computer science $x Mathematics. $3 532725
650 1 4 $a Computer Science. $3 626642
650 2 4 $a Discrete Mathematics in Computer Science. $3 892513
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 891007
700 1 $a Stephenson, Ben. $3 2118802
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
830 0 $a Undergraduate topics in computer science. $3 1567579
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-70151-6
950 $a Computer Science (Springer-11645)