Term: 1192 - 1192

Instructor: Schwarz, Alvarez, Noyola, Mayer-Hirshfeld, Kravitz, Sriram, Smith, Saini, Zhu, Le, Saleh, Brickner, Melloni, Hoag

**Students will be able to write rigorous mathematical proofs using common proof techniques, such as direct proofs, proofs by contradiction and contrapositive, and proofs by induction.**

How well did you achieve this learning goal in this course?

- Extremely well
- Very well
- Moderately well
- Slightly well
- Not well at all

**Students will be able to create, understand, and manipulate formal definitions in first-order logic.**

How well did you achieve this learning goal in this course?

- Extremely well
- Very well
- Moderately well
- Slightly well
- Not well at all

**Students will be able to reason about and prove properties of common discrete structures such as graphs, sets, functions, and binary relations.**

How well did you achieve this learning goal in this course?

- Extremely well
- Very well
- Moderately well
- Slightly well
- Not well at all

**Students will be able to compare and contrast different models of computation and their relative powers.**

How well did you achieve this learning goal in this course?

- Extremely well
- Very well
- Moderately well
- Slightly well
- Not well at all

**Students will be able to formally reason about the limits of computation and why various problems cannot be solved by computers.**

How well did you achieve this learning goal in this course?

- Extremely well
- Very well
- Moderately well
- Slightly well
- Not well at all

**Students will understand the significance and meaning of the P versus NP question.**

How well did you achieve this learning goal in this course?

- Extremely well
- Very well
- Moderately well
- Slightly well
- Not well at all

**Students will understand the practical applications of concepts from discrete mathematics, computability theory, and complexity theory.**

How well did you achieve this learning goal in this course?

- Extremely well
- Very well
- Moderately well
- Slightly well
- Not well at all

How useful to you were the **lectures**?

- Extremely useful
- Very useful
- Moderately useful
- Slightly useful
- Not useful at all

How useful to you were the **problem sets**?

- Extremely useful
- Very useful
- Moderately useful
- Slightly useful
- Not useful at all

How useful to you was/were the **online tools**?

- Extremely useful
- Very useful
- Moderately useful
- Slightly useful
- Not useful at all

How useful to you was/were the **office hours**?

- Extremely useful
- Very useful
- Moderately useful
- Slightly useful
- Not useful at all

How useful to you was/were the **animated guides**?

- Extremely useful
- Very useful
- Moderately useful
- Slightly useful
- Not useful at all

How useful to you was/were the **programming assignments**?

- Extremely useful
- Very useful
- Moderately useful
- Slightly useful
- Not useful at all

**Do you feel more confident in your mathematical abilities now than at the start of the quarter?**

- Yes
- No

**Do you see yourself taking more courses in mathematics or theoretical computer science in the future?**

- Yes
- No

**Do you have any advice you'd like to offer to future generations of CS103 students?**

**Of all the topics we covered this quarter, which one did you think was the most interesting? Why?**

**Of all the topics we covered this quarter, which one did you think was the least interesting? Why?**

Process Comments: