CPS 102, Spring 2012, Test 2

TEST 2 topics

Below highlights the main topics from each chapter. Other topics from those chapters are also possible.

• Chapter 2.1-2.5
  • Sets, Functions, Sequences, Cardinality, Countability
  • Not the focus of the test, but you still need to know these topics as we build on them.

• Chapter 4.1-4.6
  • 4.1 and 4.2 are not the focus of the test.
  • Divisibility and Modular Arithmetic - understand basics for rest of chapter
  • prime numbers, relatively prime numbers, pairwise relatively prime
  • GCD, LCM, Euclidean algorithm - know how to apply
  • Bezout coefficients - know how to calculate these
  • Caeser cipher, check digits

• Chapter 5.1-5.3
  • mathematical induction, strong induction
  • recursively defined functions, sets and structures

• Chapter 6.1-6.6
  • counting
  • permutations (ordered), combinations (not ordered)
  • binomial coefficients, binomial theorem, pascal's triangle, combinations with repetition

• Chapter 7.1
  • Probability
  • This test covers only those topics in 7.1. The rest of Chapter 7 will be on the final, but not on this test.

Ways to Study for the Exam

• recitation problems
• homework problems
• classwork problems
• problems in the book (answers to odd numbered problems)
• lecture notes - definitions and problems

TEST 1 Logistics

• Closed book, closed notes, closed neighbor

Office Hours between now and exam

• Prof Rodger - LSRC D237 -
  I will be around most of Monday and Friday afternoons til 4:30pm.