Chris Pollett >
Old Classses >
CS157b |
MTn = Midterm Problem n. FEPn = Final Exam Problem n. Within the class there were two versions of a given test; however, these two versions were just problem permutations of each other. The results above are all for the first of these two permutations. The two classes each had different tests which were variants of each other, testing the same learning outcomes. CLO1 (Course Learning Outcome 1) know common database record formats CLO2 -- Given an index structure based on a B-tree or extensible hashing be able to figure out the effect of performing an insert or a delete CLO3 -- Create a simple query transaction in a modern DBMS system. CLO4 -- Tune queries and know how to perform query performance evaluations CLO5 -- Know database recovery techniques CLO6 -- Be able to use isolation levels for concurrency control in a popular DBMS CLO7 -- Be able to create or deploy a query mediator for a system with at least two data sources. CLO8 -- Be able to determine how the A Priori algorithm would operate on a toy dataset CLO9 -- Design and deploy analytical databases for OLAP. N/A -- Important material covered in the course but not directly related to a specific learning outcome. |