Difference between revisions of "CS 303 midterm"
(→Goals) |
(→Goals) |
||
| Line 4: | Line 4: | ||
The goal of the midterm is to evaluate you on the most important topics from the first half of the term. | The goal of the midterm is to evaluate you on the most important topics from the first half of the term. | ||
| − | Quizzes in | + | ==Exam part 1== |
| − | * Math notation | + | For the "regular exam" portion of the midterm, you will have at most 90 minutes, with the goal that more than half of the class has enough time to finish. |
| − | * Math bases | + | it will have the following... |
| − | * | + | * Quizzes in Canvas, auto-graded and with practices available (at some point) |
| − | + | ** Math notation, updated with new notation (5-10 min) | |
| − | + | ** Math bases, same as before (5-10+ min) | |
| − | * Logic - given a logical formula, identify whether a formula is unsatisfiable, valid, satisfiable (1 minute per simple formula | + | ** Logic - given a logical formula, identify whether a formula is unsatisfiable, valid, satisfiable (1 minute per simple formula) |
| − | * 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. (5-10 minute | + | ** 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. (5-10 minute) |
| − | * Number theory - congruence notation, divisibility statements, lcm and gcd. (5-10 minute | + | ** Number theory - congruence notation, divisibility statements, lcm and gcd. (5-10 minute) |
| − | * Sets - terminology, operations (few minutes | + | ** Sets - terminology, operations (few minutes) |
| − | * Functions/Relations - terminology/definitions (few minutes | + | ** Functions/Relations - terminology/definitions (few minutes) |
| − | * Other math - factorial, combinations, exponents/logs (few minutes | + | ** Other math - factorial, combinations, exponents/logs (few minutes) |
| + | * Short answer / essay, that will be looked at manually | ||
| + | ** Truth table - able to write one out correctly (few minutes short answer / essay) | ||
| + | ** Proof that a number is irrational - able to write out the proof correctly (few minutes short answer / essay) | ||
| + | ** Euclid's GCD algorithm - able to show the steps of the algorithm on a given example (few minutes short answer / essay) | ||
| + | |||
| + | Maybe a bit from the latest topics, but will see if there is room/time in the exam for it. | ||
* Graphs - terms, basic properties | * Graphs - terms, basic properties | ||
* Induction and big O asymptotics - maybe some basic | * Induction and big O asymptotics - maybe some basic | ||
| + | |||
| + | ==Exam part 2== | ||
| + | The second part of the exam is a 30 minute interview slot with the instructor. You will be asked to explain solutions from the regular exam, from the hw assignments, or questions that are similar to these. The goal is to (a) verify that the work you are submitting is your own (you demonstrate the skills live that you have been turning in work for), (b) have an adaptive portion of the exam where you can be given hints if needed and see if you can get some partial credit. | ||
Revision as of 16:12, 18 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.
Exam part 1
For the "regular exam" portion of the midterm, you will have at most 90 minutes, with the goal that more than half of the class has enough time to finish. it will have the following...
- Quizzes in Canvas, auto-graded and with practices available (at some point)
- Math notation, updated with new notation (5-10 min)
- Math bases, same as before (5-10+ min)
- Logic - given a logical formula, identify whether a formula is unsatisfiable, valid, satisfiable (1 minute per simple formula)
- 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. (5-10 minute)
- Number theory - congruence notation, divisibility statements, lcm and gcd. (5-10 minute)
- Sets - terminology, operations (few minutes)
- Functions/Relations - terminology/definitions (few minutes)
- Other math - factorial, combinations, exponents/logs (few minutes)
- Short answer / essay, that will be looked at manually
- Truth table - able to write one out correctly (few minutes short answer / essay)
- Proof that a number is irrational - able to write out the proof correctly (few minutes short answer / essay)
- Euclid's GCD algorithm - able to show the steps of the algorithm on a given example (few minutes short answer / essay)
Maybe a bit from the latest topics, but will see if there is room/time in the exam for it.
- Graphs - terms, basic properties
- Induction and big O asymptotics - maybe some basic
Exam part 2
The second part of the exam is a 30 minute interview slot with the instructor. You will be asked to explain solutions from the regular exam, from the hw assignments, or questions that are similar to these. The goal is to (a) verify that the work you are submitting is your own (you demonstrate the skills live that you have been turning in work for), (b) have an adaptive portion of the exam where you can be given hints if needed and see if you can get some partial credit.
