Discrete Mathematics: Theory and Applications (Revised Edition)

D.S. Malik, M. K. Sen

  • 出版商: Cengage Learning
  • 出版日期: 2010-04-05
  • 售價: $1,100
  • 貴賓價: 9.5$1,045
  • 語言: 英文
  • 裝訂: Paperback
  • ISBN: 981429635X
  • ISBN-13: 9789814296359

下單後立即進貨 (約5~7天)





Discrete Mathematics: Theory and ApplicationsRevised Editionoffers a refreshing alternative for the undergraduate Discrete Mathematics course, In this revised text, Dr. Malik and Dr. Sen employ a classroom-tested, student-focused approach that is conducive to effective learning. Each chapter motivates students through the use of real-world, concrete examples. Ample exercise sets provide alternative practice, while programming exercises in each chapter allow opportunities for computer science application. This text is a true blend of theory and applications.


  Designed for an undergraduate course in Discrete Mathematics.

  Ideal for students in mathematics/computer science.

  Adds a new chapter on discrete probability.

  Provides over 100 exercises and a rich set of programming exercises per chapter.

  Includes Worked-out Exercises in each section to illustrate crucial problem-solving techniques.

  Supplies a rich collection of examples and visual diagrams that clearly illustrate key concepts.

  Additional resources for students and instructors are available online and on CD-ROM, including a detailed solutions manual, an an extensive test bank, teaching tips, practice tests, web links, and PowerPoint slides.

  Thoroughly proofread and errors from the earlier edition corrected.

Chapter 1. Foundations :Sets, Logic, and Algorithms
Chapter 2. Integers and Mathematical Induction
Chapter 3. Relations and Posets
Chapter 4. Matrices and Closures of Relations
Chapter 5. Functions
Chapter 6. Congruences
Chapter 7. Counting Principles
Chapter 8. Discrete Probability
Chapter 9. Recurrence Relations
Chapter 10. Algorithms and Time Complexity
Chapter 11. Graph Theory
Chapter 12. Trees and Networks
Chapter 13. Boolean Algebra and Combinatorial Circuits
Chapter 14. Finite Automata and Languages