lec20-review-exam2 - EECS 203, Winter 2007 Discrete...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
EECS 203, Winter 2007 Discrete Mathematics Lecture 20 Review for the 2nd Exam March 20 Reading: Covered sections in Rosen March 20 Review for the 2nd Exam, Page 1
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
20.1 Matrices and graphs Key concepts: matrix, symmetric, transpose, matrix multiplication, graphs (undirected and directed), path, cycle, walks, connected, connected components, isomorphism, subgraphs, adjacency matrix, incidence matrix. Key results: If A is the adjacency matrix of G , then [ A k ] u,v is the number of different walks from u to v using exactly k steps. Ramsey’s Theorem: for any integers s and t , there exists R ( s, t ) so that any graph with at least R ( s, t ) vertices would have a size s clique, or its complement has a size t clique. March 20 Review for the 2nd Exam, Page 2
Background image of page 2
20.2 Sum and sequence i a i , i ia i - 1 i i , i i 2 , i i ( i - 1). Approximation by integration: ln( n + 1) = Z n +1 x =1 1 /xdx n X i =1 1 i 1 + Z n x =1 1 /xdx = 1 + ln n. An approximation of
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 7

lec20-review-exam2 - EECS 203, Winter 2007 Discrete...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online