Anika's Study Corner

Cheat sheets for all exams in CS 160 Algorithms, as well as review of all topics and practice problems for final exam.

Your go-to cheat sheet on databases. Double-sided and full of detail and color. Covers how we organize and fetch data, relational algebra, hash indexes, ACID properties of transactions, database storage, replacement strategies and memory management, query execution, join algorithms, query planning and optimization, concurrency control, and more all in great detail. Also includes dozens of sample SQL queries. All in two pages!

Provides a detailed overview of all topics covered in CS 105 Programming Languages course. Includes practice problems for each topic. Topics covered include algebraic laws, operational semantics, derivations, Higher-Order Functions, basic Scheme syntax, continuations, pattern matching, polymorphic Abstract Data Types, Type Systems, Type Inference, Modules, and Pure Object-Oriented Programming. Great for final exam prep.

Covers all the topics covered in final exam of CS 135 Machine Learning and Data Mining course. Topics covered include loss-based model training, generic model evaluation, generic model selection, binary classification, multi-class classification, K Nearest Neighbors, etc. Includes a table comparing all classifiers. Explains different types of regression.

Formula cheat sheet for final exam of Financial Economics.

Practice problems from all homeworks and exams in CS 160 Algorithms course. Includes problem and answers with work shown. Includes problems on all topics covered in final exam.

Detailed double sided study guide for material covered in CS 160 Algorithms course. Topics include Big-O, recursion trees, master method, induction, heap sort, heap building, BFS/DFS, Dijkstra, dynamic programming, and more. Includes tables comparing all sorting algorithms and search algorithms.

Detailed double sided study guide for material covered in second third of the CS 160 Algorithms course. Topics include dynamic programming, amortized analysis, hashing, binary search trees, red-black trees, and augmenting data structures.

Detailed double sided study guide for material covered in first third of the CS 160 Algorithms course. Topics include Big-O, recursion trees, master method, induction, heap sort. Includes a table comparing all sorting algorithms.

Comprehensive summary of all material covered in COMP 40 midterm and final exams. Condensed study guide.