LEADER 04404nam 22006975 450 001 9910416082003321 005 20230810170516.0 010 $a3-030-42221-6 024 7 $a10.1007/978-3-030-42221-9 035 $a(CKB)4100000011384361 035 $a(DE-He213)978-3-030-42221-9 035 $a(MiAaPQ)EBC6297589 035 $a(Au-PeEL)EBL6297589 035 $a(OCoLC)1184055799 035 $a(PPN)250214970 035 $a(MiAaPQ)EBC30766833 035 $a(Au-PeEL)EBL30766833 035 $a(EXLCZ)994100000011384361 100 $a20200811d2020 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 14$aThe Discrete Math Workbook $eA Companion Manual Using Python /$fby Sergei Kurgalin, Sergei Borzunov 205 $a2nd ed. 2020. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2020. 215 $a1 online resource (XVII, 500 p. 333 illus., 19 illus. in color.) 225 1 $aTexts in Computer Science,$x1868-095X 311 $a3-030-42220-8 327 $aFundamentals 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. 330 $aThis 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. 410 0$aTexts in Computer Science,$x1868-095X 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aAlgorithms 606 $aComputers 606 $aProfessions 606 $aDiscrete Mathematics in Computer Science 606 $aAlgorithms 606 $aDiscrete Mathematics 606 $aThe Computing Profession 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aAlgorithms. 615 0$aComputers. 615 0$aProfessions. 615 14$aDiscrete Mathematics in Computer Science. 615 24$aAlgorithms. 615 24$aDiscrete Mathematics. 615 24$aThe Computing Profession. 676 $a004.0151 700 $aKurgalin$b Sergei$4aut$4http://id.loc.gov/vocabulary/relators/aut$0851963 702 $aBorzunov$b Sergei$4aut$4http://id.loc.gov/vocabulary/relators/aut 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910416082003321 996 $aThe Discrete Math Workbook$91902298 997 $aUNINA