Please use this identifier to cite or link to this item: http://localhost/handle/Hannan/1216
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKurgalin, Sergei. ;en_US
dc.contributor.authorBorzunov, Sergei. ;en_US
dc.date.accessioned2013en_US
dc.date.accessioned2020-05-17T08:26:35Z-
dc.date.available2020-05-17T08:26:35Z-
dc.date.issued2018en_US
dc.identifier.isbn9783319926452 ;en_US
dc.identifier.isbn9783319926445 (print) ;en_US
dc.identifier.urihttp://localhost/handle/Hannan/1216-
dc.descriptionPrinted edition: ; 9783319926445. ;en_US
dc.descriptionSpringerLink (Online service) ;en_US
dc.descriptionen_US
dc.descriptionen_US
dc.descriptionen_US
dc.descriptionen_US
dc.description.abstractThis 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. ;en_US
dc.description.statementofresponsibilityby Sergei Kurgalin, Sergei Borzunov.en_US
dc.description.tableofcontentsFundamentals 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. ;en_US
dc.format.extentXIII, 485 p. 90 illus., 10 illus. in color. ; online resource. ;en_US
dc.publisherSpringer International Publishing :en_US
dc.publisherImprint: Springer,en_US
dc.relation.ispartofseriesTexts in Computer Science, ; 1868-0941. ;en_US
dc.relation.ispartofseriesTexts in Computer Science, ; 1868-0941. ;en_US
dc.relation.haspart9783319926445.pdfen_US
dc.subjectComputer Scienceen_US
dc.subjectAlgorithmsen_US
dc.subjectComputer Science and Mathematicsen_US
dc.subjectComputersen_US
dc.subjectDiscrete mathematics. ;en_US
dc.subjectComputer Scienceen_US
dc.subjectDiscrete Mathematics in Computer Science. ;en_US
dc.subjectAlgorithm Analysis and Problem Complexity. ;en_US
dc.subjectDiscrete Mathematics. ;en_US
dc.subjectThe Computing Profession. ;en_US
dc.subject.ddc004.0151 ; 23 ;en_US
dc.subject.lccQA76.9.M35 ;en_US
dc.titleThe Discrete Math Workbooken_US
dc.title.alternativeA Companion Manual for Practical Study /en_US
dc.typeBooken_US
dc.publisher.placeCham :en_US
Appears in Collections:مدیریت فناوری اطلاعات

Files in This Item:
File Description SizeFormat 
9783319926445.pdf6.73 MBAdobe PDFThumbnail
Preview File
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKurgalin, Sergei. ;en_US
dc.contributor.authorBorzunov, Sergei. ;en_US
dc.date.accessioned2013en_US
dc.date.accessioned2020-05-17T08:26:35Z-
dc.date.available2020-05-17T08:26:35Z-
dc.date.issued2018en_US
dc.identifier.isbn9783319926452 ;en_US
dc.identifier.isbn9783319926445 (print) ;en_US
dc.identifier.urihttp://localhost/handle/Hannan/1216-
dc.descriptionPrinted edition: ; 9783319926445. ;en_US
dc.descriptionSpringerLink (Online service) ;en_US
dc.descriptionen_US
dc.descriptionen_US
dc.descriptionen_US
dc.descriptionen_US
dc.description.abstractThis 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. ;en_US
dc.description.statementofresponsibilityby Sergei Kurgalin, Sergei Borzunov.en_US
dc.description.tableofcontentsFundamentals 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. ;en_US
dc.format.extentXIII, 485 p. 90 illus., 10 illus. in color. ; online resource. ;en_US
dc.publisherSpringer International Publishing :en_US
dc.publisherImprint: Springer,en_US
dc.relation.ispartofseriesTexts in Computer Science, ; 1868-0941. ;en_US
dc.relation.ispartofseriesTexts in Computer Science, ; 1868-0941. ;en_US
dc.relation.haspart9783319926445.pdfen_US
dc.subjectComputer Scienceen_US
dc.subjectAlgorithmsen_US
dc.subjectComputer Science and Mathematicsen_US
dc.subjectComputersen_US
dc.subjectDiscrete mathematics. ;en_US
dc.subjectComputer Scienceen_US
dc.subjectDiscrete Mathematics in Computer Science. ;en_US
dc.subjectAlgorithm Analysis and Problem Complexity. ;en_US
dc.subjectDiscrete Mathematics. ;en_US
dc.subjectThe Computing Profession. ;en_US
dc.subject.ddc004.0151 ; 23 ;en_US
dc.subject.lccQA76.9.M35 ;en_US
dc.titleThe Discrete Math Workbooken_US
dc.title.alternativeA Companion Manual for Practical Study /en_US
dc.typeBooken_US
dc.publisher.placeCham :en_US
Appears in Collections:مدیریت فناوری اطلاعات

Files in This Item:
File Description SizeFormat 
9783319926445.pdf6.73 MBAdobe PDFThumbnail
Preview File
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKurgalin, Sergei. ;en_US
dc.contributor.authorBorzunov, Sergei. ;en_US
dc.date.accessioned2013en_US
dc.date.accessioned2020-05-17T08:26:35Z-
dc.date.available2020-05-17T08:26:35Z-
dc.date.issued2018en_US
dc.identifier.isbn9783319926452 ;en_US
dc.identifier.isbn9783319926445 (print) ;en_US
dc.identifier.urihttp://localhost/handle/Hannan/1216-
dc.descriptionPrinted edition: ; 9783319926445. ;en_US
dc.descriptionSpringerLink (Online service) ;en_US
dc.descriptionen_US
dc.descriptionen_US
dc.descriptionen_US
dc.descriptionen_US
dc.description.abstractThis 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. ;en_US
dc.description.statementofresponsibilityby Sergei Kurgalin, Sergei Borzunov.en_US
dc.description.tableofcontentsFundamentals 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. ;en_US
dc.format.extentXIII, 485 p. 90 illus., 10 illus. in color. ; online resource. ;en_US
dc.publisherSpringer International Publishing :en_US
dc.publisherImprint: Springer,en_US
dc.relation.ispartofseriesTexts in Computer Science, ; 1868-0941. ;en_US
dc.relation.ispartofseriesTexts in Computer Science, ; 1868-0941. ;en_US
dc.relation.haspart9783319926445.pdfen_US
dc.subjectComputer Scienceen_US
dc.subjectAlgorithmsen_US
dc.subjectComputer Science and Mathematicsen_US
dc.subjectComputersen_US
dc.subjectDiscrete mathematics. ;en_US
dc.subjectComputer Scienceen_US
dc.subjectDiscrete Mathematics in Computer Science. ;en_US
dc.subjectAlgorithm Analysis and Problem Complexity. ;en_US
dc.subjectDiscrete Mathematics. ;en_US
dc.subjectThe Computing Profession. ;en_US
dc.subject.ddc004.0151 ; 23 ;en_US
dc.subject.lccQA76.9.M35 ;en_US
dc.titleThe Discrete Math Workbooken_US
dc.title.alternativeA Companion Manual for Practical Study /en_US
dc.typeBooken_US
dc.publisher.placeCham :en_US
Appears in Collections:مدیریت فناوری اطلاعات

Files in This Item:
File Description SizeFormat 
9783319926445.pdf6.73 MBAdobe PDFThumbnail
Preview File