國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

The discrete math workbooka companio...

Borzunov, Sergei.

The discrete math workbooka companion manual for practical study /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	The discrete math workbookby Sergei Kurgalin, Sergei Borzunov.
其他題名:	a companion manual for practical study /
作者:	Kurgalin, Sergei.
其他作者:	Borzunov, Sergei.
出版者:	Cham :Springer International Publishing :2018.
面頁冊數:	xiii, 485 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
標題:	Computer scienceMathematics.
電子資源:	http://dx.doi.org/10.1007/978-3-319-92645-2
ISBN:	9783319926452$q(electronic bk.)

The discrete math workbooka companion manual for practical study /
Kurgalin, Sergei.

The discrete math workbooka companion manual for practical study /[electronic resource] :by Sergei Kurgalin, Sergei Borzunov. - Cham :Springer International Publishing :2018. - xiii, 485 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-oriented textbook presents an accessible introduction to discrete mathematics through a substantial collection of classroom-tested exercises. Each chapter opens with concise coverage of the theory underlying the topic, reviewing the basic concepts and establishing the terminology, as well as providing the key formulae and instructions on their use. This is then followed by a detailed account of the most common problems in the area, before the reader is invited to practice solving such problems for themselves through a varied series of questions and assignments. Topics and features: Provides an extensive set of exercises and examples of varying levels of complexity, 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 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 study guide is designed to address the core needs of undergraduate students training in computer science, informatics, and electronic engineering, emphasizing 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: 9783319926452$q(electronic bk.)

Standard No.: 10.1007/978-3-319-92645-2doiSubjects--Topical Terms:

181991
Computer science
--Mathematics.

LC Class. No.: QA76.9.M35

Dewey Class. No.: 004.151

The discrete math workbooka companion manual for practical study /
LDR:03135nmm a2200349 a 4500 001 542780
003 DE-He213
005 20180731210342.0
006 m d
007 cr nn 008maaau
008 190411s2018 gw s 0 eng d
020 $a 9783319926452$q(electronic bk.)
020 $a 9783319926445$q(paper)
024 7 $a 10.1007/978-3-319-92645-2 $2 doi
035 $a 978-3-319-92645-2
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.151 $2 23
090 $a QA76.9.M35 $b K96 2018
100 1 $a Kurgalin, Sergei. $3 820687
245 1 4 $a The discrete math workbook $h [electronic resource] : $b a companion manual for practical study / $c by Sergei Kurgalin, Sergei Borzunov.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2018.
300 $a xiii, 485 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-oriented textbook presents an accessible introduction to discrete mathematics through a substantial collection of classroom-tested exercises. Each chapter opens with concise coverage of the theory underlying the topic, reviewing the basic concepts and establishing the terminology, as well as providing the key formulae and instructions on their use. This is then followed by a detailed account of the most common problems in the area, before the reader is invited to practice solving such problems for themselves through a varied series of questions and assignments. Topics and features: Provides an extensive set of exercises and examples of varying levels of complexity, 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 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 study guide is designed to address the core needs of undergraduate students training in computer science, informatics, and electronic engineering, emphasizing 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 Computer Science. $3 212513
650 2 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 eBooks
830 0 $a Texts in computer science. $3 559643
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-92645-2
950 $a Computer Science (Springer-11645)