Difference between revisions of "FA19:Prelim 2 guide"

From CS2800 wiki
Line 43: Line 43:
 
*** [[Euler's theorem]],
 
*** [[Euler's theorem]],
 
*** [[Claim:⟦k⟧_m is a unit if and only if gcd(k,m) = 1]]
 
*** [[Claim:⟦k⟧_m is a unit if and only if gcd(k,m) = 1]]
 +
<strike>
 
* [[Automata]] theory
 
* [[Automata]] theory
 
** Be able to build [[DFA]]s for simple problems
 
** Be able to build [[DFA]]s for simple problems
Line 51: Line 52:
 
** Key results
 
** Key results
 
*** Know how to prove that an automaton is correct (by giving and proving a specification for <math>[[\hat{δ}]]</math>, see [[SP19:Lecture 23 Automata constructions|Lecture 23 Automata constructions]])
 
*** Know how to prove that an automaton is correct (by giving and proving a specification for <math>[[\hat{δ}]]</math>, see [[SP19:Lecture 23 Automata constructions|Lecture 23 Automata constructions]])
 +
</strike>

Revision as of 09:45, 26 October 2019

Prelim 2 will cover all material covered in lecture and homework between 9/27 and 10/25. I will update this guide after Monday's lecture to reflect what we have covered and what is in scope. Material covered on prelim 1 will not be directly tested, although you will still need to know how to write proofs and work with the basic mathematical objects necessary for those topics. Material that you have had homework problems on will be tested more heavily. The exam will be closed book, closed notes, and will be 90 minutes long.

Here are some sample questions from past prelims: Media:fa19-prelim2-sample.pdf (solutions coming soon: Media:fa19-prelim2-sample-sol.pdf).

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