Course Evaluation Customization Form

Viewing: CS 103, section 01


Term: 1198 - 1198
Instructor: Liu

Learning Goals

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?


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?


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?


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?


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?


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?


Course Elements

How useful to you were the lectures?


How useful to you were the problem sets?


How useful to you was/were the Office hours?


How useful to you was/were the Online tools?


How useful to you was/were the Animated guides?


Additional Questions

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


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



Process Comments:

Key: 28653
Show Export
Preview Bridge