LEADER 04200nam 22006615 450 001 9910299352103321 005 20230810194500.0 010 $a3-319-92645-4 024 7 $a10.1007/978-3-319-92645-2 035 $a(CKB)4100000005472044 035 $a(DE-He213)978-3-319-92645-2 035 $a(MiAaPQ)EBC6313158 035 $a(PPN)22950289X 035 $a(EXLCZ)994100000005472044 100 $a20180731d2018 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 for Practical Study /$fby Sergei Kurgalin, Sergei Borzunov 205 $a1st ed. 2018. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2018. 215 $a1 online resource (XIII, 485 p. 90 illus., 10 illus. in color.) 225 1 $aTexts in Computer Science,$x1868-095X 311 $a3-319-92644-6 320 $aIncludes bibliographical references and index. 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-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. 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.151 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 $a9910299352103321 996 $aThe Discrete Math Workbook$91902298 997 $aUNINA