# Course Evaluation

Please submit the course evaluation on AEFIS before the end of the week. The evaluations are very important for me so I really appreciate your help!

# Final

📗 Coverage: W6, W7, W9, W10, W11
📗 Number of questions: 40
📗 Length: 2 hours
📗 Sec 1 Final A: Engineering 2305, August 14, 12:30 to 2:30
📗 Sec 1 Final B: Engineering 2305, August 16, 12:30 to 2:30
📗 Sec 2 Final A: the Beatles, August 15, 5:30 to 7:30
📗 Sec 2 Final B: the Granary (Shed), August 20, 5:30 to 7:30
📗 Sample final: File
📗 Formula sheet: File
📗 Review Session Sec 1: CS1221, August 11 (Sunday), 12:30 to 2:30
📗 Review Session Sec 2: the Beatles, August 13 (Tuesday), 5:30 to 7:30
📗 Final Version A: File
📗 Version A Answers: CECBC DBBBA BEEDD BCACB CBEED DDCDC ACBCC ECABC
📗 Final Version B: File
📗 Version B Answers: EEAEE AEACE BBDED BDAAA DCEEA CDACA AEAAA CCABB

📗 Questions that will be on the final: 
M6 File: Q1, Q3
M9 File: Q1, Q3, Q4, Q5
M10 File: Q1, Q2
M11 File: Q1, Q2, Q4, Q5
The questions may be slightly changed.

📗 Each correct answer receives 1 point, each incorrect answer receives -0.25 points, each blank answer receives 0 points. See Link for explanation.
📗 Calculator: NO. (Deduction for bringing a calculator: 2 points.)
📗 Notes: NO. (Deduction for bring an additional page: 2 points. NO examples, quizzes, homeworks questions and answers on the additional pages: deduction for each violation: 2 points.)

# Coverage

📗 Math to do by hand:
(1) Projection
(2) Draw weighted digraph given adjacency matrix
(3) Simple SAT (with only and, or, not)
(4) Compute expected or discounted values

📗 Things on the slides that not on final: 
L11: Gaussian Mixture (formula) 
L12: Autoencoder (formula), kernel / non-linear PCA (everything), tSNE (everything)
L13: Multi-Armed Bandits and UCB Algorithm (everything), Q Learning (formula), Q Net (everything)
L14: (everything)
L15: Configuration Space (everything)
L16: IDA* (formula), Beam Search (formula)
L17: WalkSAT (everything)
L18: Genetic Algorithm Variations (everything)
L19: Monte Carlo Tree Search (everything), Upper Confidence Bound (everything)
L20: Rationalizability (everything)
L21: Auction (everything)

(formula) means you do not need to remember or be able to use or derive the formulas, but you should still be familiar with the concept.

# Review

📗 Sample final: (updated August 11) Link
📗 Video going through sample final very quickly: Link

📗 Dandi's review session section 1 notes: Link
📗 Tan's review session section 2 notes: Link