Date: Tuesday, August 9th
Time: 8:30am to 11:30am (I didn't choose the time!!)
Room: 300
As in the midterm exams, you can bring in a single 8.5-by-11in piece of paper with whatever you want written on both sides. You can use any technology you want to help prepare this sheet.
No other aids are allowed --- no calculators, no computers, no books, etc.
Here is the approximate breakdown of topics on the test:
- 50% will be on topics covered after the 2nd midterm
- Section 5.1: all
- Section 5.2: all, plus the definition of surjective (onto) functions given on p.260
- Section 5.4: all except the material about relational databases
- Section 5.5: all
- Section 5.6: all
- Section 5.7: all
- Deterministic finite state automata: We used a slightly different approach than the book, and you are expected to know the definitions presented in class and covered on the homework.
- 25% will be on topics covered between the 1st and 2nd midterms
- 25% will be on topics covered before the 1st midterm
The style of the exam will be essentially the same style as the midterms. You should expect to write proofs, and to know your definitions!
Solving practice problems is the best way to prepare for the exam. Remember that the textbook has answers to all the odd-numbered questions in the back of the book. Some sample final exam questions may be posted a bit closer to the exam.
If you have any questions, please post them in response to this message ... I get an email alert as soon as any comment is posted here, so I will try to answer any questions as promptly as possible.
Recent Comments