SP18:Prelim 1 guide

From CS2800 wiki
Revision as of 15:21, 17 January 2019 by {{GENDER:Mdg39|[math]'"2}} [/math]'"7
(<math>1) </math>2 | <math>3 (</math>4) | <math>5 (</math>6)

Prelim 1 will cover material all material covered in lecture and the homework up to and including material covered on Friday 3/2. Material that you've had homework problems on will be stressed more heavily. The exam will be closed book, closed notes, and will be 90 minutes long.

The first part of the course is somewhat different from past semesters; for questions on set theory and basic proof techniques, I would review homework 1. Most of the questions in part 1 are good prelim questions. For problems on functions and induction, see the corresponding sections of File:P1-sample.pdf (File:P1-sample-sol.pdf). I expect the exam to be about as long as 4-6 of these questions.

Here is a brief summary of what we've covered; for an exhaustive list see the Main page.

  • Know and be able to apply basic results
    • Relationship between 'jectivity and inverses
    • Countability or uncountability of [math]\mathbb{Z}, \mathbb{N} \times \mathbb{N}, \mathbb{R}, 2^\mathbb{N}, [\mathbb{N} \to \{0,1\}] [/math].
    • Properties of GCD algorithm, existence and uniqueness of quotient and remainder, existence of base b representation, set relationships, etc.