# Introductory Discrete Mathematics

## De (autor): V. K. Balakrishnan

This concise text offers an introduction to discrete mathematics for undergraduate students in computer science and mathematics. It emphasizes combinatorics, graph theory with applications to some standard network optimization problems, and algorithms to solve these problems. Numerous exercises help students test their grasp of the material. 65 illustrations.
This concise text offers an introduction to discrete mathematics for undergraduate students in computer science and mathematics. Mathematics educators consider it vital that their students be exposed to a course in discrete methods that introduces them to combinatorial mathematics and to algebraic and logical structures focusing on the interplay between computer science and mathematics. The present volume emphasizes combinatorics, graph theory with applications to some stand network optimization problems, and algorithms to solve these problems.
Chapters 0-3 cover fundamental operations involving sets and the principle of mathematical induction, and standard combinatorial topics: basic counting principles, permutations, combinations, the inclusion-exclusion principle, generating functions, recurrence relations, and an introduction to the analysis of algorithms. Applications are emphasized wherever possible and more than 200 exercises at the ends of these chapters help students test their grasp of the material.
Chapters 4 and 5 survey graphs and digraphs, including their connectedness properties, applications of graph coloring, and more, with stress on applications to coding and other related problems. Two important problems in network optimization ― the minimal spanning tree problem and the shortest distance problem ― are covered in the last two chapters. A very brief nontechnical exposition of the theory of computational complexity and NP-completeness is outlined in the appendix.
Citeste mai mult

78.06Lei

Sau 7806 de puncte

Fiecare comanda noua reprezinta o investitie pentru viitoarele tale comenzi. Orice comanda plasata de pe un cont de utilizator primeste in schimb un numar de puncte de fidelitate, In conformitate cu regulile de conversiune stabilite. Punctele acumulate sunt incarcate automat in contul tau si pot fi folosite ulterior, pentru plata urmatoarelor comenzi.

Livrare in 3-5 saptamani

#### Descrierea produsului

This concise text offers an introduction to discrete mathematics for undergraduate students in computer science and mathematics. It emphasizes combinatorics, graph theory with applications to some standard network optimization problems, and algorithms to solve these problems. Numerous exercises help students test their grasp of the material. 65 illustrations.
This concise text offers an introduction to discrete mathematics for undergraduate students in computer science and mathematics. Mathematics educators consider it vital that their students be exposed to a course in discrete methods that introduces them to combinatorial mathematics and to algebraic and logical structures focusing on the interplay between computer science and mathematics. The present volume emphasizes combinatorics, graph theory with applications to some stand network optimization problems, and algorithms to solve these problems.
Chapters 0-3 cover fundamental operations involving sets and the principle of mathematical induction, and standard combinatorial topics: basic counting principles, permutations, combinations, the inclusion-exclusion principle, generating functions, recurrence relations, and an introduction to the analysis of algorithms. Applications are emphasized wherever possible and more than 200 exercises at the ends of these chapters help students test their grasp of the material.
Chapters 4 and 5 survey graphs and digraphs, including their connectedness properties, applications of graph coloring, and more, with stress on applications to coding and other related problems. Two important problems in network optimization ― the minimal spanning tree problem and the shortest distance problem ― are covered in the last two chapters. A very brief nontechnical exposition of the theory of computational complexity and NP-completeness is outlined in the appendix.
Citeste mai mult

Detaliile produsului

## De pe acelasi raft

• transport gratuit

469.06 Lei

• transport gratuit

747.86 Lei

• transport gratuit

407.93 Lei

• transport gratuit

747.86 Lei

• transport gratuit

373.93 Lei

• transport gratuit

373.93 Lei

• transport gratuit

380.73 Lei

• transport gratuit

203.86 Lei

• transport gratuit

407.93 Lei

• transport gratuit

428.33 Lei

Parerea ta e inspiratie pentru comunitatea Libris!

Noi suntem despre carti, si la fel este si