COMPSCI 170 Study Guide - Final Guide: Directed Acyclic Graph, Dynamic Programming, Priority Queue
Document Summary
Name of the person sitting to your left: Name of the person sitting to your right: You may consult three double-sided sheet of notes. You may not consult other notes, textbooks, etc. Computers and other electronic devices are not permitted. Reminder: when we ask for an ef cient algorithm, we want one whose asymptotic running time is as fast as possible. Do not turn this page until an instructor tells you to do so. Answer the following questions, giving a short justi cation (a sentence or two). (a) suppose we have already trained two classi ers. Classi er a is a k-nearest neighbors classi er with a xed k = 25, using a linear search implementation (not a k-d tree). Classi er b is a random forest classi er with a xed t = 25 (i. e. , 25 decision trees), where each decision tree has depth at most 10.
