Fullbook Nice

Sections

Counting
1.1 Basic Counting
The Sum Principle
Abstraction
Summing Consecutive Integers
The Product Principle
Two element subsets
Important Concepts, Formulas, and Theorems
Problems
1.2 Counting Lists, Permutations, and Subsets
Using the Sum and Product Principles
Lists and functions
The Bijection Principle
1.3 Binomial Coeﬃcients
Pascal’s Triangle
A proof using the Sum Principle
The Binomial Theorem
Labeling and trinomial coeﬃcients
1.4. EQUIVALENCE RELATIONS AND COUNTING (OPTIONAL) 27
1.4 Equivalence Relations and Counting (Optional)
The Symmetry Principle
Equivalence Relations
The Quotient Principle
Equivalence class counting
Multisets
The bookcase arrangement problem
The number of k-element multisets of an n-element set
Using the quotient principle to explain a quotient
Cryptography and Number Theory
2.1 Cryptography and Modular Arithmetic
Introduction to Cryptography
Private Key Cryptography
Public-key Cryptosystems
Arithmetic modulo n
Cryptography using multiplication mod n
2.2 Inverses and GCDs
Solutions to Equations and Inverses mod n
Inverses mod n
Converting Modular Equations to Normal Equations
Greatest Common Divisors (GCD)
Euclid’s Division Theorem
The GCD Algorithm
Extended GCD algorithm
Computing Inverses
2.3 The RSA Cryptosystem
Exponentiation mod n
The Rules of Exponents
Fermat’s Little Theorem
The RSA Cryptosystem
The Chinese Remainder Theorem
2.4 Details of the RSA Cryptosystem
Practical Aspects of Exponentiation mod n
How long does it take to use the RSA Algorithm?
How hard is factoring?
Finding large primes
Reﬂections on Logic and Proof
3.1 Equivalence and Implication
Equivalence of statements
Truth tables
DeMorgan’s Laws
Implication
3.2 Variables and Quantiﬁers
Variables and universes
Quantiﬁers
Standard notation for quantiﬁcation
Statements about variables
Rewriting statements to encompass larger universes
Proving quantiﬁed statements true or false
Negation of quantiﬁed statements
Implicit quantiﬁcation
Proof of quantiﬁed statements
3.3 Inference
Direct Inference (Modus Ponens) and Proofs
Rules of inference for direct proofs
Rules of Inference for Direct Proofs
Contrapositive rule of inference
Proof by contradiction
4.1 Mathematical Induction
Smallest Counter-Examples
The Principle of Mathematical Induction
Strong Induction
Induction in general
4.2 Recursion, Recurrences and Induction
Recursion
First order linear recurrences
Iterating a recurrence
Geometric series
4.3. GROWTH RATES OF SOLUTIONS TO RECURRENCES 139
4.3 Growth Rates of Solutions to Recurrences
Divide and Conquer Algorithms
Recursion Trees
Three Diﬀerent Behaviors
4.4 The Master Theorem
Master Theorem
Solving More General Kinds of Recurrences
More realistic recurrences (Optional)
Recurrences for general n (Optional)
Appendix: Proofs of Theorems (Optional)
4.5. MORE GENERAL KINDS OF RECURRENCES 163
4.5 More general kinds of recurrences
Recurrence Inequalities
A Wrinkle with Induction
Further Wrinkles in Induction Proofs
Dealing with Functions Other Than nc
4.6 Recurrences and Selection
The idea of selection
A recursive selection algorithm
Selection without knowing the median in advance
An algorithm to ﬁnd an element in the middle half
An analysis of the revised selection algorithm
Uneven Divisions
Probability
5.1 Introduction to Probability
Why do we study probability?
Some examples of probability computations
Complementary probabilities
Probability and hashing
The Uniform Probability Distribution
5.2 Unions and Intersections
The probability of a union of events
Principle of inclusion and exclusion for probability
The principle of inclusion and exclusion for counting
5.3 Conditional Probability and Independence
Conditional Probability
Independence
Independent Trials Processes
Tree diagrams
5.4 Random Variables
What are Random Variables?
Binomial Probabilities
Expected Value
Expected Values of Sums and Numerical Multiples
The Number of Trials until the First Success
5.5. PROBABILITY CALCULATIONS IN HASHING 227
5.5 Probability Calculations in Hashing
1. expected number of items per location,
Expected Number of Items per Location
Expected Number of Empty Locations
Expected Number of Collisions
Expected maximum number of elements in a slot of a hash table (Optional)
5.6. CONDITIONAL EXPECTATIONS, RECURRENCES AND ALGORITHMS 237
5.6 Conditional Expectations, Recurrences and Algorithms
When Running Times Depend on more than Size of Inputs
Conditional Expected Values
Randomized algorithms
A more exact analysis of RandomSelect
5.7. PROBABILITY DISTRIBUTIONS AND VARIANCE 251
5.7 Probability Distributions and Variance
Distributions of random variables
Variance
6.1 Graphs
The degree of a vertex
Connectivity
Cycles
Trees
Other Properties of Trees
6.2 Spanning Trees and Rooted Trees
Spanning Trees
Breadth First Search
Rooted Trees
6.3 Eulerian and Hamiltonian Paths and Tours
Eulerian Tours and Trails
Hamiltonian Paths and Cycles
NP-Complete Problems
6.4 Matching Theory
The idea of a matching
Making matchings bigger
Matching in Bipartite Graphs
Searching for Augmenting Paths in Bipartite Graphs
The Augmentation-Cover algorithm
Good Algorithms
6.5 Coloring and planarity
The idea of coloring
Interval Graphs
Planarity

Info and Rating

Category:

Uncategorized.

Rating:

Upload Date:

06/22/2011

Attribution Non-commercial

Tags:

No tags

Ebook download as PDF File (.pdf), Text file (.txt) or read book online.

Flag for inappropriate content

More From This User

19 Reads

Distributed Objects and Remote Invocation

41 Reads

157 Reads

72 Reads

98 Reads

3014 Reads

24 Reads

411 Reads

169 Reads

1988 Reads

Fullbook Nice

Get Scribd Mobile

Sections

Info and Rating

Download and Print this Document

Choose a format to download in

More From This User

Fullbook Nice

Get Scribd Mobile

Sections

Info and Rating

Download and Print this Document

Choose a format to download in

More From This User

Other login options

Why Sign Up?

Login Successful

Sign Up Successful