
As an Amazon Associate and affiliate partner, Menrva Books earns from qualifying purchases. Learn more
1. Sets. Basic Definitions. Exercises. Operations on Sets. Exercises. Mathematical Introduction. Exercises. Strong Form of Mathematical Introduction. Exercises. The Principle of Inclusion-Exclusion. Exercises. Russell's Paradox. 2. Formal Logic. Introduction to Propositional Logic. Exercises. Truth and Logical Truth. Exercises. Normal Forms. Exercises. Formal Proofs in Propositional Logic. Exercises. First Order Logic. Exercises. 3. Relations. Binary Relations. N-ary Relations. Operations on Binary Relations. Exercises. Special Types of Relations. Exercises. Equivalence Relations. Exercises. Ordering Relations. Exercises. Relational Databases-An Application. Exercises. 4. Functions. Basic Definitions. Exercises. Operations on Functions. Sequences and Subsequences. Exercises. The Pigeon-Hole Principle. Applications. Exercises. Countable and Uncountable Sets. Exercises. Languages and Regular Sets. Exercises. 5. Analysis of Algorithms. Comparing Growth Rates of Functions. Exercises. Complexity of Programs. Exercises. Uncomputability. Exercises. 6. Graph Theory. Introduction to Graph Theory. The Handshaking Problem. Paths and Cycles. Graph Isomorphism. Representation of Graphs. Exercises. Connected Graphs. The Koingsberg Bridge Problem. Exercises. Trees. Spanning Trees. Rooted Trees. Exercises. Directed Graphs. Scheduling a Meeting Facility. Finding a Cycle in a Directed Graph. Priority in Scheduling. Connectivity in Directed Graphs. Exercises. 7. Counting and Combinatorics. Traveling Salesperson Problem. Counting Principles. Set Decomposition Principles. Exercises. Permutations and Combinations. Constructing the k-th Permutation. Exercises. Repetitions and Identities. Combinatorial Identities. Pascal's Triangle. Multinomials. TSP Revisited. Exercises. 8. Discrete Probability. Ideas of Chance in Computer Science. Exercises. Cross Product Sample Spaces. Exercises. Independent Events and Conditional Probability. Exercises. Discrete Random Variables. Exercises. 9. Recurren
This text investigates the foundational mathematical structures and logical frameworks required for rigorous computer science analysis. The authors provide a comprehensive pedagogical approach, utilizing a structured sequence of definitions, proofs, and practical exercises to bridge the gap between abstract mathematical concepts and computational application. By covering topics ranging from formal logic to discrete probability, the work establishes a formal basis for understanding algorithmic complexity and data organization.
What You Will Find
Experts identify this text as a standard academic resource for undergraduate computer science curricula. Readers frequently note the high density of the exercises, which serve as the primary mechanism for reinforcing the theoretical concepts presented in each chapter.
Page Count:
608
Publication Date:
2002-10-01
Publisher:
Addison Wesley
ISBN-10:
0201793016
ISBN-13:
9780201793017
No comments yet. Be the first to share your thoughts!