Difference between revisions of "CS 303 midterm"
(Created page with "This page contains an outline of the midterm exam for CS 303. This covers the first chapters in [https://mfleck.cs.illinois.edu/building-blocks/index-sp2020.html Building Blo...") |
(→Goals) |
||
| Line 12: | Line 12: | ||
* Logic - identify whether a formula is unsatisfiable, valid, satisfiable, | * Logic - identify whether a formula is unsatisfiable, valid, satisfiable, | ||
* Identify the logical rule or theorem - De Morgan's, distributing union over intersection (and vice versa), definition of implication, pigeon hole principle, contrapositive, inclusion-exclusion, rules of exponents/logs | * Identify the logical rule or theorem - De Morgan's, distributing union over intersection (and vice versa), definition of implication, pigeon hole principle, contrapositive, inclusion-exclusion, rules of exponents/logs | ||
| + | * Number theory - congruence notation, divisibility statements, lcm and gcd | ||
| + | * Sets - terminology, operations | ||
| + | * Functions/Relations - terminology/definitions | ||
* Other math - factorial, combinations, exponents/logs, | * Other math - factorial, combinations, exponents/logs, | ||
Revision as of 15:58, 17 October 2022
This page contains an outline of the midterm exam for CS 303. This covers the first chapters in Building Blocks for Theoretical Computer Science up through Induction.
Goals
The goal of the midterm is to evaluate you on the most important topics from the first half of the term.
Quizzes in canvas, all will be timed, and only one chance to take them
- Math notation quiz, updated with new notation
- Math bases quiz, same as before
- Truth table - able to write one out correctly
- Proof that a number is irrational - able to write out the proof correctly
- Euclid's GCD algorithm - able to show the steps of the algorithm on a given example
- Logic - identify whether a formula is unsatisfiable, valid, satisfiable,
- Identify the logical rule or theorem - De Morgan's, distributing union over intersection (and vice versa), definition of implication, pigeon hole principle, contrapositive, inclusion-exclusion, rules of exponents/logs
- Number theory - congruence notation, divisibility statements, lcm and gcd
- Sets - terminology, operations
- Functions/Relations - terminology/definitions
- Other math - factorial, combinations, exponents/logs,
