Discrete mathematics and its applications Kenneth H. Rosen; Adapted by: Kamala Krithivasan
Dil: İngilizce : , Baskı: 7th ediTanım: XXIV, 836 p. picture, table 26.7 cmİçerik türü:- text
- unmediated
- volume
- 978-981-4670135
- 511 R67 2013
Books
| Materyal türü | Geçerli Kütüphane | Yer Numarası | Kopya numarası | Durum | Notlar | İade tarihi | Barkod | Materyal Ayırtmaları | |
|---|---|---|---|---|---|---|---|---|---|
|
Books
|
CIU LIBRARY Genel Koleksiyon | 511 R67 2013 (Rafa gözat(Aşağıda açılır)) | C.1 | Kullanılabilir | Deniz Plaza | 0068955 |
Includes bibliography and index (I1-I24 p.)
1 The Foundations: Logic and Proofs
1 Propositional Logic
15 Applications of Propositional Logic
22 Propositional Equivalences
34 Predicates and Quantifiers
53 Nested Quantifiers
62 Rules of Inference
76 Normal Forms
83 Introduction to Proofs
94 Proof Methods and Strategy
111 End of Chapter Material
117 Basic Structures: set, Functions, Sequences, Sums and Matrices
117 Sets
128 Set Operation
140 Functions
155 Sequences and Summations
168 Cardinality of Sets
181 Matrices
188 End of Chapter Materials
193 Algorithms
193 Algorithms
206 The Growth of Functions
219 Complexity of Algorithms
231 End of Chapter Material
237 Number Theory and Cryptography
237 Divisibility and Modular Arithmetic
245 Integer Representations and Algorithms
256 Primes and Greatest Common Divisors
272 Solving Congruences
284 Applications of Congruences
290 Cryptography
302 End of Chapter Material
307 Introduction and Recursion
307 Mathematical Induction
328 Strong Induction and Well-Ordering
339 Recursive Definitions and Structural Induction
353 Recursive Algorithms
364 Program Correctness
370 End of Chapter Material
375 Counting
375 The Basics of Counting
388 The Pigeonhole Principle
395 Permutation and Combinations
403 Binomial Coefficients and Combinations
410 Generalized Permutations and Combinations
422 Generating Permutations and Combinations
426 End of Chapter Material
431 Discrete Probability
431 An Introduction to Discrete Probability
438 Probability Theory
454 Bayes Theorem
463 Expected Value and Variance
479 End of Chapter Material
485 Advance Counting Techniques
485 Applications of Recurrence Relations
497 Solving Linear Recurrence Relations
511 Divide and Conquer Algorithms and Recurrence Relations
520 Generating Functions
535 Inclusion Exclusion
541 Applications of Inclusion Exclusion
548 End of Chapter Material
553 Relations
553 Relations and Their Properties
563 n-ary Relations and Their Applications
570 Representing Relations
576 Closures of Relations
587 Equivalence Relations
597 Partial Orderings
611 End of Chapter material
617 Graphs
617 Graph and Graph Models
627 Graph Terminology and Special Types of Graph
643 Representing Graph and Graph Isomorphism
625 Connectivity
666 Euler and Hamilton Paths
679 Shortest path problems
689 Planar Graphs
698 Graph Coloring
706 End of Chapter Material
715 Trees
715 Introduction to Trees
726 Application to Trees
740 Tree Traversal
753 Spanning Trees
764 Minimum Spanning Trees
770 End of Chapter Material
777 Algebraic Structure and Coding Theory
777 The Structure of Algebras
783 Semigroups, Monoids and Groups
798 Homeomorphisms Normal Subgroups and Congruence Relations
808 Rings, Integral, Domains and Fields
814 Quotients and Product Algebras
817 Coding Theory
827 Polynomial Rings and Polynomial Codes
832 end of Chapter Material
Boolean Algebra ... Available online at www.mhhe.com/rosen/GE
Model Computation ...Available online at www.mhhe.com/rosen/GE
A-1 Appendixes
1 axioms for the Real Numbers and the Positive Integers
7 Exponential and Logarithmic Functions
11 Pseudocode
B-1 Suggested reading
S-1 Answer to odd-Numbered Exercise
C-1 Photo Credits
I-1 Index of Biography
I-2 Index