What: EXAM 2

When: November 20, 2015

Topics:
  Combinatorics
    - arrangements and selections
    - binomial coefficients
    - binomial theorem
    - identities involving the binomial coefficients
    - selections with repetition allowed
    - counting nonnegative solutions to linear equations in k unknowns
    - counting positive solutions to linear equations in k unknowns
  Graph Theory
    - simple graph, subgraphs, degrees
    - open vs closed walks, trails, and paths
    - Eulerian graphs & its characterization
    - the degree-sum formula & the handshaking lemma
    - graph isomorphisms
    - cycles, forests, and trees
    - bipartite graphs
    - planar graphs
    - Euler formula
     
Text book reading:
  Chapters 5, 11

Exam Format:
  Closed book, closed notes, no electronic devices.
  Can bring in a notebook-sized paper with your notes written on it.
  You may use both sides.  No computer-generated printout allowed.