- Main
- Mathematics - Discrete Mathematics
- Introductory Discrete Mathematics
Introductory Discrete Mathematics
V. K . Balakrishnan이 책이 얼마나 마음에 드셨습니까?
파일의 품질이 어떻습니까?
책의 품질을 평가하시려면 책을 다운로드하시기 바랍니다
다운로드된 파일들의 품질이 어떻습니까?
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.
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.
년:
2010
출판사:
Dover Publications
언어:
english
페이지:
256
ISBN 10:
0486691152
ISBN 13:
9780486691152
시리즈:
Dover Books on Computer Science
파일:
PDF, 5.16 MB
개인 태그:
IPFS:
CID , CID Blake2b
english, 2010
파일이 귀하의 이메일로 송부 됩니다. 1-5분 소요됩니다.
1~5분 이내로 파일이 사용자님의 Telegram 계정으로 전송될 것입니다.
주의: 자신의 계정이 Z-Library Telegram 봇과 연결되어 있는지 확인하십시오.
1~5분 이내로 파일이 사용자님의 Kindle 기기로 전송될 것입니다.
비고: Kindle로 보내시는 책은 모두 확인해 보실 필요가 있습니다. 메일함에 Amazon Kindle Support로부터 확인 메일이 도착했는지 메일함을 점검해 보시기 바랍니다.
로의 변환이 실행 중입니다
로의 변환이 실패되었습니다