國立虎尾科技大學 |

The Discrete Math Workbook = A Companion Manual Using Python /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	The Discrete Math Workbook/ by Sergei Kurgalin, Sergei Borzunov.
其他題名:	A Companion Manual Using Python /
作者:	Kurgalin, Sergei.
其他作者:	Borzunov, Sergei.
面頁冊數:	XVII, 500 p. 333 illus., 19 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	The Computing Profession. -
電子資源:	https://doi.org/10.1007/978-3-030-42221-9
ISBN:	9783030422219

The Discrete Math Workbook = A Companion Manual Using Python /
Kurgalin, Sergei.

The Discrete Math WorkbookA Companion Manual Using Python /[electronic resource] :by Sergei Kurgalin, Sergei Borzunov. - 2nd ed. 2020. - XVII, 500 p. 333 illus., 19 illus. in color.online resource. - Texts in Computer Science,1868-0941. - Texts in Computer Science,.

Fundamentals of Mathematical Logic -- Set Theory -- Relations and Functions -- Combinatorics -- Graphs -- Boolean Algebra -- Complex Numbers -- Recurrence Relations -- Concept of an Algorithm, Correctness of Algorithms -- Turing Machine -- Asymptotic Analysis -- Basic Algorithms -- Parallel Algorithms.

This practically-focused study guide introduces the fundamentals of discrete mathematics through an extensive set of classroom-tested problems. Each chapter presents a concise introduction to the relevant theory, followed by a detailed account of common challenges and methods for overcoming these. The reader is then encouraged to practice solving such problems for themselves, by tackling a varied selection of questions and assignments of different levels of complexity. This updated second edition now covers the design and analysis of algorithms using Python, and features more than 50 new problems, complete with solutions. Topics and features: Provides a substantial collection of problems and examples of varying levels of difficulty, suitable for both laboratory practical training and self-study Offers detailed solutions to each problem, applying commonly-used methods and computational schemes Introduces the fundamentals of mathematical logic, the theory of algorithms, Boolean algebra, graph theory, sets, relations, functions, and combinatorics Presents more advanced material on the design and analysis of algorithms, including Turing machines, asymptotic analysis, and parallel algorithms Includes reference lists of trigonometric and finite summation formulae in an appendix, together with basic rules for differential and integral calculus This hands-on workbook is an invaluable resource for undergraduate students of computer science, informatics, and electronic engineering. Suitable for use in a one- or two-semester course on discrete mathematics, the text emphasizes the skills required to develop and implement an algorithm in a specific programming language. Dr. Sergei Kurgalin is a Professor and Head of the Department of Digital Technologies at Voronezh State University, Russia. Dr. Sergei Borzunov is an Associate Professor at the same institution.

ISBN: 9783030422219

Standard No.: 10.1007/978-3-030-42221-9doiSubjects--Topical Terms:

669954
The Computing Profession.

LC Class. No.: QA76.9.M35

Dewey Class. No.: 004.0151

The Discrete Math Workbook = A Companion Manual Using Python /
LDR:03592nam a22004095i 4500 001 1022322
003 DE-He213
005 20200811234113.0
007 cr nn 008mamaa
008 210318s2020 gw | s |||| 0|eng d
020 $a 9783030422219 $9 978-3-030-42221-9
024 7 $a 10.1007/978-3-030-42221-9 $2 doi
035 $a 978-3-030-42221-9
050 4 $a QA76.9.M35
072 7 $a PBD $2 bicssc
072 7 $a COM018000 $2 bisacsh
072 7 $a PBD $2 thema
072 7 $a UYAM $2 thema
082 0 4 $a 004.0151 $2 23
100 1 $a Kurgalin, Sergei. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1207060
245 1 4 $a The Discrete Math Workbook $h [electronic resource] : $b A Companion Manual Using Python / $c by Sergei Kurgalin, Sergei Borzunov.
250 $a 2nd ed. 2020.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a XVII, 500 p. 333 illus., 19 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Texts in Computer Science, $x 1868-0941
505 0 $a Fundamentals of Mathematical Logic -- Set Theory -- Relations and Functions -- Combinatorics -- Graphs -- Boolean Algebra -- Complex Numbers -- Recurrence Relations -- Concept of an Algorithm, Correctness of Algorithms -- Turing Machine -- Asymptotic Analysis -- Basic Algorithms -- Parallel Algorithms.
520 $a This practically-focused study guide introduces the fundamentals of discrete mathematics through an extensive set of classroom-tested problems. Each chapter presents a concise introduction to the relevant theory, followed by a detailed account of common challenges and methods for overcoming these. The reader is then encouraged to practice solving such problems for themselves, by tackling a varied selection of questions and assignments of different levels of complexity. This updated second edition now covers the design and analysis of algorithms using Python, and features more than 50 new problems, complete with solutions. Topics and features: Provides a substantial collection of problems and examples of varying levels of difficulty, suitable for both laboratory practical training and self-study Offers detailed solutions to each problem, applying commonly-used methods and computational schemes Introduces the fundamentals of mathematical logic, the theory of algorithms, Boolean algebra, graph theory, sets, relations, functions, and combinatorics Presents more advanced material on the design and analysis of algorithms, including Turing machines, asymptotic analysis, and parallel algorithms Includes reference lists of trigonometric and finite summation formulae in an appendix, together with basic rules for differential and integral calculus This hands-on workbook is an invaluable resource for undergraduate students of computer science, informatics, and electronic engineering. Suitable for use in a one- or two-semester course on discrete mathematics, the text emphasizes the skills required to develop and implement an algorithm in a specific programming language. Dr. Sergei Kurgalin is a Professor and Head of the Department of Digital Technologies at Voronezh State University, Russia. Dr. Sergei Borzunov is an Associate Professor at the same institution.
650 2 4 $a The Computing Profession. $3 669954
650 2 4 $a Discrete Mathematics. $3 796600
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 1 4 $a Discrete Mathematics in Computer Science. $3 670123
650 0 $a Computers. $3 565115
650 0 $a Discrete mathematics. $3 1254302
650 0 $a Algorithms. $3 527865
650 0 $a Computer science—Mathematics. $3 1253519
700 1 $a Borzunov, Sergei. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1207061
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030422202
776 0 8 $i Printed edition: $z 9783030422226
830 0 $a Texts in Computer Science, $x 1868-0941 $3 1254292
856 4 0 $u https://doi.org/10.1007/978-3-030-42221-9
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)