Anika's Study Corner
Here are detailed notes from computer science and economics courses I've taken at Tufts University! They've helped me study for my exams and I hope you find them useful for your studying :)
- 9
- 0
- 1
Community
- Followers
- Following
11 items
Complete Algorithms Study Guide
Cheat sheets for all exams in CS 160 Algorithms, as well as review of all topics and practice problems for final exam.
- Package deal
- • 4 items •
- Algorithms Exam 1 Review • Summary
- Algorithms Exam 2 Study Guide • Summary
- Algorithms Final Exam Cheat Sheet • Summary
- Algorithms Review & Practice Problems • Class notes
Cheat sheets for all exams in CS 160 Algorithms, as well as review of all topics and practice problems for final exam.
Comprehensive Databases Cheat Sheet
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!
- Summary
- • 2 pages •
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!
Programming Languages Course Review
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.
- Summary
- • 30 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.
Machine Learning Final Exam Review
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.
- Summary
- • 9 pages •
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.
Financial Economics Formula Cheat Sheet
Formula cheat sheet for final exam of Financial Economics.
- Summary
- • 1 pages •
Formula cheat sheet for final exam of Financial Economics.
Algorithms Review & Practice Problems
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.
- Package deal
- Class notes
- • 47 pages •
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.
Algorithms Final Exam Cheat Sheet
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.
- Package deal
- Summary
- • 2 pages •
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.
Algorithms Exam 2 Study Guide
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.
- Package deal
- Summary
- • 2 pages •
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.
Algorithms Exam 1 Review
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.
- Package deal
- Summary
- • 2 pages •
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.