國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

The discrete math workbooka companio...

Borzunov, Sergei.

The discrete math workbooka companion manual using python /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	The discrete math workbookby Sergei Kurgalin, Sergei Borzunov.
其他題名:	a companion manual using python /
作者:	Kurgalin, Sergei.
其他作者:	Borzunov, Sergei.
出版者:	Cham :Springer International Publishing :2020.
面頁冊數:	xvii, 500 p. :ill., digital ;24 cm.
Contained By:	Springer Nature eBook
標題:	Computer scienceMathematics.
電子資源:	https://doi.org/10.1007/978-3-030-42221-9
ISBN:	9783030422219$q(electronic bk.)

The discrete math workbooka companion manual using python /
Kurgalin, Sergei.

The discrete math workbooka companion manual using python /[electronic resource] :by Sergei Kurgalin, Sergei Borzunov. - Second edition. - Cham :Springer International Publishing :2020. - xvii, 500 p. :ill., digital ;24 cm. - 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$q(electronic bk.)

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

181991
Computer science
--Mathematics.

LC Class. No.: QA76.9.M35

Dewey Class. No.: 004.151

The discrete math workbooka companion manual using python /
LDR:03290nmm a2200361 a 4500 001 585099
003 DE-He213
005 20200811234113.0
006 m d
007 cr nn 008maaau
008 210311s2020 sz s 0 eng d
020 $a 9783030422219$q(electronic bk.)
020 $a 9783030422202$q(paper)
024 7 $a 10.1007/978-3-030-42221-9 $2 doi
035 $a 978-3-030-42221-9
040 $a GP $c GP
041 0 $a eng
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.151 $2 23
090 $a QA76.9.M35 $b K96 2020
100 1 $a Kurgalin, Sergei. $3 820687
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 Second edition.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a xvii, 500 p. : $b ill., digital ; $c 24 cm.
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 0 $a Computer science $x Mathematics. $3 181991
650 1 4 $a Discrete Mathematics in Computer Science. $3 274791
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 273702
650 2 4 $a Discrete Mathematics. $3 524738
650 2 4 $a The Computing Profession. $3 275271
700 1 $a Borzunov, Sergei. $3 820688
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a Texts in computer science. $3 559643
856 4 0 $u https://doi.org/10.1007/978-3-030-42221-9
950 $a Computer Science (SpringerNature-11645)