離散數學及其應用（英文精編版·第7版） 下載 mobi epub pdf 電子書 2025

☆☆☆☆☆
簡體網頁||繁體網頁



下載連結1
下載連結2
下載連結3

類似圖書 點擊查看全場最低價

---

內容簡介

　　本書是經典的離散數學教材，為全球多所大學廣為采用。本書全麵而係統地介紹瞭離散數學的理論和方法，內容涉及邏輯和證明，集閤、函數、序列、求和與矩陣，計數，關係，圖，樹，布爾代數。全書取材廣泛，除包括定義、定理的嚴格陳述外，還配備大量的實例和圖錶說明、各種練習和題目。第7版在前六版的基礎上做瞭大量的改進，使其成為更有效的教學工具。本書可作為高等院校數學、計算機科學和計算機工程等專業的教材或參考書。

作者簡介

　　Kenneth H. Rosen，1972年獲密歇根大學數學學士學位，1976年獲麻省理工學院數學博士學位，1982年加入貝爾實驗室，現為AT&T;實驗室特彆成員，國際知名的計算機數學專傢，除本書外，還著有《初等數論及其應用》等書。

目錄

??

The Adapter 's Words
Preface　
About the Author
The Companion Website　
To the Student　
List of Symbols　

1 The Foundations: Logic and Proofs.
1.1 Propositional Logic
1.2 Applications of Propositional Logic
1.3 Propositional Equivalences.
1.4 Predicates and Quantifiers
1.5 Nested Quantifiers.
1.6 Rules of Inference.
1.7 Introduction to Proofs
1.8 Proof Methods and Strategy.
End-of-Chapter Material.
2 Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
2.1 Sets..
2.2 Set Operations
2.3 Functions
2.4 Sequences and Summations.
2.5 Cardinality of Sets
2.6 Matrices
End-of-Chapter Material
3 Counting
3.1 The Basics of Counting
3.2 The Pigeonhole Principle.
3.3 Permutations and Combinations.
3.4 Binomial Coefficients and Identities
3.5 Generalized Permutations and Combinations.
3.6 Generating ermutations and Combinations
End-of-Chapter Material
4 Advanced Counting Techniques
4.1 Applications of Recurrence Relations
4.2 Solving Linear Recurrence Relations
4.3 Divide-and-Conquer Algorithms and Recurrence Relations
4.4 Generating Functions
4.5 Inclusion xclusion.
4.6 Applications of Inclusion xclusion
End-of-Chapter Material..
5 Relations.
5.1 Relations and Their Properties
5.2 n-ary Relations and Their Applications
5.3 Representing Relations.
5.4 Closures of Relations
5.5 Equivalence Relations.
5.6 Partial Orderings.
End-of-Chapter Material.
6 Graphs.
6.1 Graphs and Graph Models.
6.2 Graph Terminology and Special Types of Graphs
6.3 Representing Graphs and Graph Isomorphism.
6.4 Connectivity.
6.5 Euler and Hamilton Paths.
6.6 Shortest-Path Problems.
6.7 Planar Graphs.
6.8 Graph Coloring.
End-of-Chapter Material
7 Trees
7.1 Introduction to Trees.
7.2 Applications of Trees.
7.3 Tree Traversal.
7.4 Spanning Trees
7.5 Minimum Spanning Trees
End-of-Chapter Material.
8 Boolean Algebra
8.1 Boolean Functions
8.2 Representing Boolean Functions
8.3 Logic Gates
8.4 Minimization of Circuits
End-of-Chapter Material..

Suggested Readings
Answers to Exercises

前言/序言

　　PrefaceIn writing this book, I was guided by my long-standing experience and interest in teaching discrete mathematics. For the student, my purpose was to present material in a precise, readable manner, with the concepts and techniques of discrete mathematics clearly presented and demonstrated. My goal was to show the relevance and practicality of discrete mathematics to students, who are often skeptical. I wanted to give students studying computer science all of the mathematical foundations they need for their future studies. I wanted to give mathematics students an understanding of important mathematical concepts together with a sense of why these concepts are important for applications. And most importantly, I wanted to accomplish these goals without watering down the material.For the instructor, my purpose was to design a flexible, comprehensive teaching tool using proven pedagogical techniques in mathematics. I wanted to provide instructors with a package of materials that they could use to teach discrete mathematics effectively and efficiently in the most appropriate manner for their particular set of students. I hope that I have achieved these goals.I have been extremely gratified by the tremendous success of this text. The many improvements in the seventh edition have been made possible by the feedback and suggestions of a large number of instructors and students at many of the more than 600 North American schools, and at any many universities in parts of the world, where this book has been successfully used.This text is designed for a one-or two-term introductory discrete mathematics course taken by students in a wide variety of majors, including mathematics, computer science, and engineering. College algebra is the only explicit prerequisite, although a certain degree of mathematical maturity is needed to study discrete mathematics in a meaningful way. This book has been designed to meet the needs of almost all types of introductory discrete mathematics courses. It is highly flexible and extremely comprehensive. The book is designed not only to be a successful textbook, but also to serve as valuable resource students can consult throughout their studies and professional life.Goals of a Discrete Mathematics CourseA discrete mathematics course has more than one purpose. Students should learn a particular set of mathematical facts and how to apply them; more importantly, such a course should teach students how to think logically and mathematically. To achieve these goals, this text stresses mathematical reasoning and the different ways problems are solved. Five important themes are interwoven in this text: mathematical reasoning, combinatorial analysis, discrete structures, algorithmic thinking, and applications and modeling. A successful discrete mathematics course should carefully blend and balance all five themes.1. Mathematical Reasoning: Students must understand mathematical reasoning in order to read, comprehend, and construct mathematical arguments. This text starts with a discussion of mathematical logic, which serves as the foundation for the subsequent discussions of methods of proof. Both the science and the art of constructing proofs are addressed. The technique of mathematical induction is stressed through many different types of examples of such proofs and a careful explanation of why mathematical induction is a valid proof technique.2. Combinatorial Analysis: An important problem-solving skill is the ability to count or enumerate objects. The discussion of enumeration in this book begins with the basic techniques of counting. The stress is on performing combinatorial analysis to solve counting problems and analyz ealgorithms, not on applying formulae.3. Discrete Structures: A course in discrete mathematics should teach students how to work with discrete structures, which are the abstract mathematical structures used to represent discrete objects and relationships between these objects. These discrete structures include sets, permutations, relations, graphs, trees, and finite-state machines.4. Algor

離散數學及其應用（英文精編版·第7版） 下載 mobi epub pdf txt 電子書 格式

評分☆☆☆☆☆

非常滿意。

評分☆☆☆☆☆

很基礎但的確需要花時間看的一本書

評分☆☆☆☆☆

送貨速度超快!第一天下午下單，第二天一早就送到瞭，好!

評分☆☆☆☆☆

還不錯，包裝很好，物流不錯

評分☆☆☆☆☆

手裏有一本第六版本科教學版，刪減很多，原版到手感覺就是不一樣，太厚瞭，幾韆道習題太嚇人，打算慢慢看。。。

評分☆☆☆☆☆

[ZZ]寫的很好，感覺書還不錯 還沒有仔細看 東西寫得比較詳細 “我隻要在搜索框內輸入[SM]、[ZZ]，就會有好多書擺在我麵前供我挑選，價格方麵還可以打摺，這樣便捷與優惠的購書方式我怎麼可能不選擇呢！”經常在網上購物的弟弟幸福的告訴我。據調查統計，當前網上書店做得較好的的網站有京東等。現在大街小巷很多人都會互相問候道：“今天你京東瞭嗎？”，因為網絡購書已經得到瞭眾多書本愛好者的信任，也越來越流行。基於此，我打開網頁，開始在京東狂挑書。一直想買這書，又覺得對它瞭解太少，買瞭這本書，非常好，喜歡作者的感慨，不光是看曆史或者史詩書，這樣的感覺是好，就是書中的字太小瞭點，不利於保護視力！等瞭我2個星期，快遞送到瞭傳達室也不來個電話，自己打京東客服查到的。書是正版。通讀這本書，是需要細火慢烤地慢慢品味和幽寂沉思的。親切、隨意、簡略，給人潔淨而又深沉的感觸，這樣的書我久矣讀不到瞭，今天讀來實在是一件叫人高興之事。作者審視曆史，拷問靈魂，洋溢著哲思的火花。人生是一段段的旅程，也是需要承載物的。因為火車，發生過多少相聚和分離。當一聲低鳴響起，多少記憶將載入曆史的塵夢中啊。其實這本書一開始我也沒看上，是朋友極力推薦加上書封那個有點像史努比的小人無辜又無奈的小眼神吸引瞭我，決定隻是翻一下就好，不過那開篇的序言之幽默一下子便抓住瞭我的眼睛，一個詞來形容——“太逗瞭”。|據悉，京東已經建立華北、華東、華南、西南、華中、東北六大物流中心，同時在全國超過360座城市建立核心城市配送站。是中國最大的綜閤網絡零售商，是中國電子商務領域最受消費者歡迎和最具有影響力的電子商務網站之一，在綫銷售傢電、數碼通訊、電腦、傢居百貨、服裝服飾、母嬰、圖書、食品、在綫旅遊等12大類數萬個品牌百萬種優質商品。選擇京東。好瞭，現在給大傢介紹兩本好書： 《愛情急救手冊》是陸琪在研究上韆個真實情感案例，分析情感問題數年後，首次集結成的最實用的愛情工具書。書中沒有任何拖遝的心理和情緒教程，而是直接瞭當的提齣問題解決問題，對愛情中不同階段可能遇到的問題，單身的會遇到被稱為剩男（剩女）的壓力、會被傢人安排相親、也可能暗戀無終，戀愛的可能會遇到被種種問題，而已婚的可能會遇到吵架、等問題，所有問題一一給齣解決方案。陸琪以閨蜜和奶爸的語重心長告訴你各種情感秘籍，讓你一看就懂，一做就成。是中國首部最接底氣的愛情急救手冊。《謝謝你離開我》是張小嫻在《想念》後時隔兩年推齣的新散文集。從拿到文稿到把它送到讀者麵前，幾個月的時間，欣喜與不捨交雜。這是張小嫻最美的散文。美在每個充滿靈性的文字，美在細細道來的傾訴話語。美在張小嫻書寫時真實飽滿的情緒，更美在打動人心的厚重情感。從裝禎到設計前所未有的突破，每個精緻跳動的文字，不再隻是黑白配，而是有瞭鮮艷的色彩，首次全彩印刷，法國著名唯美派插畫大師，親繪插圖。兩年的等待加最美的文字，[SM]，就是你麵前這本最值得期待的新作.

評分☆☆☆☆☆

還是看原版的吧~~~~~~~~~~~~~~~~

評分☆☆☆☆☆

值得擁有 值得擁有 值得擁有

評分☆☆☆☆☆

離散數學基礎教材~~~

類似圖書 點擊查看全場最低價