Quiz

CSE547 : Discrete Mathematics

Chapter 1 : Recurrent Problems

Chapter 1.1 : The Tower of Hanoi

Chapter 1.2 : Lines in the plane

Chapter 1.3 : The Josephus Problem

Exercises

Chapter 2 : Recurrent Problems

Chapter 2.1 : Notation

Chapter 2.2 : Sums and Recurrences

Chapter 2.3 : Manipulation of Sums

Chapter 2.4 : Multiple Sums

Chapter 2.5 : General Methods

Chapter 2.6 : Finite and Infinite Calculus

Chapter 2.7 : Infinite Sums

Exercises

Chapter 3 : Integer Functions

Chapter 3.1 : Floors and Ceilings

Chapter 3.2 : Floor/Ceiling Applications

Chapter 3.3 : Floor/Ceiling Reccurences

Chapter 3.4 : 'mod': The Binary Operation

Chapter 3.5 : Floor/Ceiling Sums

Exercises

Chapter 4 : Number Theory

Chapter 4.1 : Divisibility

Chapter 4.2 : Primes

Chapter 4.3 : Prime Examples

Chapter 4.4 : Factorial Factors

Chapter 4.5 : Relative Primality

Chapter 4.6 : 'mod': The Congruence Relation

Chapter 4.7 : Independent Residues

Chapter 4.8 : Additional Applications

Chapter 4.9 : Phi and Mu

Exercises

Chapter 5 : Binomial Coefficients

Chapter 5.1 : Basic Identities

Chapter 5.2 : Basic Practice

Chapter 5.3 : Tricks of the Trade

Chapter 5.4 : Generating Functions

Chapter 5.5 : Hypergeometric Functions

Chapter 5.6 : Hypergeometric Transforms

Chapter 5.7 : Partial Hypergeometric Sums

Chapter 5.8 : Mechanical Summation

Exercises

Chapter 6 : Special Numbers

Chapter 6.1 : Stirling Numbers

Chapter 6.2 : Eulerian Numbers

Chapter 6.3 : Harmonic Numbers

Chapter 6.4 : Harmonic Summation

Chapter 6.5 : Bernoulli Numbers

Chapter 6.6 : Fibonacci Numbers

Chapter 6.7 : Continuants

Chapter 7 : Generating Functions

Chapter 7.1 : Domino Theory and Change

Chapter 7.2 : Basic Maneuvers

Chapter 7.3 : Solving Recurrences

Chapter 7.4 : Special Generating Functions

Chapter 7.5 : Convolutions

Chapter 7.6 : Exponential Generating Functions

Chapter 7.7 : Dirichlet Generating Functions

Chapter 8 : Discrete Probability

Chapter 8.1 : Definitions

Chapter 8.2 : Mean and Variance

Chapter 8.3 : Probability Generating Functions

Chapter 8.4 : Flipping Coins

Chapter 8.5 : Hashing

Chapter 9.2 : Address Spaces

Chapter 9.3 : VM as a tool for caching

Chapter 9.6 : Address Translation

Chapter 9.9 : Dynamic Memory Allocation

Chapter 9.9.1 : The malloc and free Functions

Chapter 9.9.2 : Why Dynamic Memory Allocation?

Chapter 9.9.3 : Allocator Requirements and Goals

Chapter 9.9.4 : Fragmentation

Chapter 9.9.5 : Implementation Issues

Chapter 9.9.6 : Implicit Free Lists

Chapter 9.9.7 : Placing Allocated Blocks

Chapter 9.9.8 : Splitting Free Blocks

Chapter 9.9.9 : Getting Additional Heap Memory

Chapter 9.9.10 : Coalescing Free Blocks

Chapter 9.9.11 : Coalescing with Boundary Tags

Chapter 9.9.12 : Putting It Together: Implementing a Simple Allocator

Chapter 9.9.13 : Explicit Free Lists

Chapter 9.9.14 : Segregated Free Lists

Chapter 9.10 : Garbage Collection

Chapter 9.11 : Common Memory-Related Bugs in C Programs