Information
There will be two take home quizzes during the course. The main purpose of this quizzes is to assess your understanding of the material covered in class and prepare you for the exams. Quiz solutions have to submitted to the git repositories.Quiz 1
Handout: 02/19 Submission Deadline: 02/26 11:59pm (one minute before midnight)Fraud will result in 0 points. The quiz will have both multiple choice and regular questions. The following topics will be covered in the quiz:
- Storage: E.g., formulas to compute random access and sequential read time
- Record Layout: how to represent values and records, how to layout records on pages, how to represent pointers to records, pointer swizzling
- Index structures:
- B-tree: Inserting and deleting entries, compute the size of a B-tree
- Hashing: Regular hash tables, extensible and linear hashing
- SQL querying: write SQL queries
- Write relational algebra expressions
- Translation from relational algebra to SQL
- Relational algebra equivalences
- Result size estimation
Quiz: Here is the quiz as a PDF file.
Solutions: Here are the solutions for quiz 1. Grades will be made available through blackboard in the next few days.
Quiz 2
Handout: 04/15 Submission Deadline: 04/22 11:59pm (one minute before midnight)Fraud will result in 0 points. The quiz will have both multiple choice and regular questions. The following topics will be covered in the quiz:
- Buffer Handling
- Index structures:
- B-tree: Inserting and deleting entries, compute the size of a B-tree
- Hashing: Regular hash tables, extensible and linear hashing
- Result Size Estimation
- IO Cost Estimation
- Transaction model
- Schedules
- Classes of Schedules
- Determining whether a schedule belongs to a certain class
- Given a set of transactions create a schedule of a certain class
- Recovery
- ARIES
- Physical optimization
- Join reordering algorithms
- Nested subqueries decorrelation and unnesting
Quiz: Here is the quiz as a PDF file.
Solutions: Here are the solutions for quiz 2.