CSC 301.01, Class 42: Evaluate and debrief
Overview
- Preliminaries
- Notes and news
- Upcoming work
- Extra credit
- Questions
- Friday PSA
- EOCEs
- “How will you grade the course?”
- Debrief
News / Etc.
- Please attend today’s class.
Upcoming work
- Final Wednesday morning.
Friday PSA
- It may have been a stressful week.
- As you decompress, please do so responsibly.
Questions
- Will you be available via email over the weekend?
- Probably.
- Will you be available Monday and Tuesday
- It looks that way. I have some meetings.
EOCEs
Sam leaves room.
How will you grade the course?
- Exams: Unchanged.
- Returned on Monday. Sam may allow you to make up a problem.
- Final as is:
- Homework formula
(min 100 (* 100/9 (+ (count completed on time and code doesn't suck) (* 0.75 (count completed a day or more late and code doesn't suck)) (* scale-factor-tbd (count sucky code))))) - Scaled by attendance
- Tentative indicators on Monday
Questions on the sample exam
#4.
The dynamic programming solution to the stamps problem is O(n) both time and space.
When we start thinking more broadly about running time, we want to think about the running time in terms of the size of the input. It can take k = log_2(n) bits to represent n. The running time is therefore O(2^k).
Traditionally, n is a count of things (nodes, elements in an array/list, characters in a string), so it makes sense to make n the input size.
What do we do when the data may themselves have sizes? (E.g., strings.) We’ve generally ignored that issue, both in computing the input size and the running time.
When we use the textbook, how do we cite?
- Shorthand + page
- Using the DFS algorithm on p. 123 of Skiena …
- Replace line 5 in the DFS algorithm on p. 123 of Skiena with …. and all will be fine with the world.
Do we have to do running time if you don’t explicitly ask?
- No.
Should we submit an inefficient one even if we know there’s a more efficient solution we can’t figure out.
- Probably.
- But say “I suspect there’s one more efficient …”