Discrete Mathematics and Its Applications - Kenneth H Rosen

Discrete Mathematics and Its Applications

Kenneth H Rosen

出版时间

2003-04-22

ISBN

9780072930337

评分

★★★★★
书籍介绍
Discrete Mathematics and its Applications is a focused introduction to the primary themes in a discrete mathematics course, as introduced through extensive applications, expansive discussion, and detailed exercise sets. These themes include mathematical reasoning, combinatorial analysis, discrete structures, algorithmic thinking, and enhanced problem-solving skills through modeling. Its intent is to demonstrate the relevance and practicality of discrete mathematics to all students. The Fifth Edition includes a more thorough and linear presentation of logic, proof types and proof writing, and mathematical reasoning. This enhanced coverage will provide students with a solid understanding of the material as it relates to their immediate field of study and other relevant subjects. The inclusion of applications and examples to key topics has been significantly addressed to add clarity to every subject. True to the Fourth Edition, the text-specific web site supplements the subject matter in meaningful ways, offering additional material for students and instructors. Discrete math is an active subject with new discoveries made every year. The continual growth and updates to the web site reflect the active nature of the topics being discussed. The book is appropriate for a one- or two-term introductory discrete mathematics course to be taken by students in a wide variety of majors, including computer science, mathematics, and engineering. College Algebra is the only explicit prerequisite.
AI导读
核心看点
  • 涵盖逻辑、集合、图论等CS核心数学基础
  • 强调算法思维与建模,注重实际应用
  • 习题丰富,后半部分难度递增挑战性强
适合谁读
  • 计算机科学及相关专业本科生
  • 需要系统构建数学基础的入门者
  • 希望提升逻辑推理能力的自学者
读前提醒
  • 建议先通读全书,再按需精读章节
  • 务必动手完成课后习题以巩固知识
  • 可配合交大OCW课程视频辅助学习
读者共识
  • 经典教材,编排合理,久经市场考验
  • 内容基础全面,适合新手入门打基础
  • 行文风格活泼,但部分习题难度较大

本导读基于书籍简介、目录、原文摘录、短评和书评生成,不等同于全文精读。

精彩摘录
  • "各种算法有若干共有的性质。在描述算法时记住他们是有用的。这些性质是: * 输入 算法从一个指令的集合得到输入值 * 输出 对每个输入值集合,算法都要从每个指令的集合中产生输出值。输出值就是问题的解。 * 确定性 算法的步骤必须是准确定义的。 * 正确性 对每一组输入值,算法都产生正确的输出值。 * 有限性 对集合中的任何输入,算法都应在有限(可能很多)步之后产生所求的输出。 * 有效性 算法的每一步必须能够准确地执行,并在有限时间内完成。 * 通用性 算法过程应适用于要求形式的所有问题,而不只是用于一组特定的输出值。"
  • "The number 1 has this property, since the only positive integer not exceeding 1 is 1 itself, and therefore the sum is 1. This is a constructive proof."
  • "the set of students at your school who either are not sophomores or are not taking ds"
  • "有向图的邻接矩阵定义中,aij=1,若{vi,vj}是G的一条边"
  • "但是删除顶点v和所有与v关联的边.."
  • "证明:如果n是不能被2或3整除的整数,则n^2 - 1能被24整除"
  • "Many people fnd it confusing that "p only if q" expresses the same thing as "if p then q." To remember this, note that "p only if q" says that p cannot be true when q is not true. That is, the statement is false if p is true, but q is false. When p is false, q may be either true or false, because th"
  • "由5个ASCII码构成且至少(在符号位)包含一个@字符的串有多少个?"
用户评论
还剩下图论没看,以后换本书补吧。。
像强迫症一般几乎刷完了所有讲过的章节的习题,感觉离散数学特别有趣,尤其是素数和图论。这本书也讲的很清楚,课后习题也挺有意思,尤其到了后半部分有一些非常难或者实用性强的习题,推荐~
确实很基础,就适合我这种newbie入门用。 第九章relations受益匪浅,在图论甚至抽代都很有用。 基本上扫了一遍,某些章节需要补做习题。
书是好书,但是被教这么课的老师恶心到了…… 还有靠后的习题相当难
读了一点点
Discrete什么的最可爱了
收藏