Discrete Mathematical Structures 5/e (絕)
- 20本以上，享 8.5折
售價
$
洽詢
- 一般書籍
- ISBN：9780131230460
- 作者：Bernard Kolman, Robert C Busby, Sharon Cutler Ross
- 版次：5
- 年份：2004
- 出版商：Pearson Education
- 頁數/規格：536頁
書籍介紹
本書特色
目錄
Description
Combining a careful selection of topics with previews of their genuine applications in computer science, this text, more than any other book in its field, is written at an elementary level with a strong pedagogical focus. It limits its area and coverage of topics to those that students will actually utilize, and emphasizes both basic theory and applications, giving a firm foundation for more advanced courses, as well as providing an excellent reference work for those courses.
Combining a careful selection of topics with previews of their genuine applications in computer science, this text, more than any other book in its field, is written at an elementary level with a strong pedagogical focus. It limits its area and coverage of topics to those that students will actually utilize, and emphasizes both basic theory and applications, giving a firm foundation for more advanced courses, as well as providing an excellent reference work for those courses.
Features
-
Brief sketches of mathematical history open each chapter.
＊ Vignettes provide these students with a practical background of how these ideas were developed. -
Additional number theory—Provides more information on the properties of integers, including base n representations; and gives more contexts for isomorphism.
＊ Gives students further understanding for future study. -
Cryptology theme—Begins in Chapter 1, and is then explored throughout the book, ending with Section 11.3, Public Key Cryptology.
＊ Presents for students the basic ideas of this fun field. -
Expanded coverage of coding—Covers all of its aspects, including efficiency, effectiveness, and security.
＊ Provides students with full picture of coding. -
New exercises in each chapter—Includes approximately 25% more exercises than in the 4th edition.
＊ Emphasizes for students multiple representations of concepts providing more practice in proof-reading and -writing skills. -
Additional student projects—Included for weighted voting systems, Petri nets, and Catalan numbers.
＊ Provides students with opportunities for exploration and discovery, as well as for writing and for working in groups. -
Chapter review questions—Provided at the end of each chapter.
＊ Helps students identify the “big” ideas of each chapter. -
Concise, well-written text—Remains the briefest text on the market; devoid of excessive technical jargon and abstraction.
＊ Helps students focus on fundamental concepts without becoming bogged down in special cases, weakly-motivated examples, and applications. Enables instructors to sharpen their focus on key ideas and concepts. -
Development of mathematical thinking skills—Strengthens the text for use in a bridge course and lays foundation for mathematical thinking in upper-division courses.
＊ Helps students develop the skills of building mathematical models through abstraction. -
No calculus—Assumes only a limited background in mathematics.
＊ Offers students a level of rigor appropriate for beginners or non-math majors. - Organization of text around the concept of relation—Treats relations and digraphs as two aspects of the same basic mathematical idea.
-
Clear organization of topics—Minimizes the difficulties of being overwhelmed by too many definitions and theory abstraction by treating relations and digraphs as two aspects of the same fundamental idea, which is then used as the basis of virtually all the concepts introduced in the book.
＊ Introduces students to each new idea in the context of previously learned material, allowing them to fully understand what is being presented to them. -
Focus on topics used in computer science—Limits coverage of abstract algebra and gives applications for finite state machines, error detecting and correcting codes.
＊ Gives students valuable information for future computer science careers. -
Instructor's Solutions Manual and Companion Website.
＊ Provides instructors and students with valuable course support.
Table of Contents
1. Fundamentals.
2. Logic.
3. Counting.
4. Relations and Digraphs.
5. Functions.
6. Order Relations and Structures.
7. Trees.
8. Topics in Graph Theory.
9. Semigroups and Groups.
10. Languages and Finite-State Machines.
11. Groups and Coding.
1. Fundamentals.
2. Logic.
3. Counting.
4. Relations and Digraphs.
5. Functions.
6. Order Relations and Structures.
7. Trees.
8. Topics in Graph Theory.
9. Semigroups and Groups.
10. Languages and Finite-State Machines.
11. Groups and Coding.
