Lavoisier S.A.S.
14 rue de Provigny
94236 Cachan cedex
FRANCE

Heures d'ouverture 08h30-12h30/13h30-17h30
Tél.: +33 (0)1 47 40 67 00
Fax: +33 (0)1 47 40 67 02


Url canonique : www.lavoisier.fr/livre/informatique/the-discrete-math-workbook/descriptif_3845907
Url courte ou permalien : www.lavoisier.fr/livre/notice.asp?ouvrage=3845907

The Discrete Math Workbook, Softcover reprint of the original 1st ed. 2018 A Companion Manual for Practical Study Texts in Computer Science Series

Langue : Anglais

Auteurs :

Couverture de l’ouvrage The Discrete Math Workbook

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 many problems, 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.

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

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.

Presents a hands-on, classroom-tested study guide suitable for laboratory practical training and self-study

Provides an extensive set of exercises and examples of different levels of complexity

Offers detailed solutions to many problems, applying commonly-used methods and computational schemes

Date de parution :

Ouvrage de 485 p.

15.5x23.5 cm

Disponible chez l'éditeur (délai d'approvisionnement : 15 jours).

Prix indicatif 47,46 €

Ajouter au panier