Chris Pollett > Old Classses > CS157b
( Print View )

Student Corner:
  [Submit Sec1]
  [Grades Sec1]

  [
Lecture Notes]
  [Discussion Board]

Course Info:
  [Texts & Links]
  [Description]
  [Course Outcomes]
  [Outcomes Matrix]
  [Course Schedule]
  [Grading]
  [Requirements/HW/Quizzes]
  [Class Protocols]
  [Exam Info]
  [Regrades]
  [University Policies]
  [Announcements]

HW Assignments:
  [Hw1]  [Hw2]  [Hw3]
  [Hw4]  [Hw5]  [Quizzes]

Practice Exams:
  [Midterm]  [Final]

                           












Learning Outcomes versus Collected Course Materials
CLO1CLO2CLO3CLO4CLO5CLO6CLO7CLO8CLO9N/A
HW1X
HW2XX
HW3XX
MT1X
MT2X
MT3X
MT4X
MT5X
HW4XX
HW5XXX
FEP1X
FEP2X
FEP3XX
FEP4X
FEP5X
FEP6X
FEP7X
FEP8X
FEP9X
FEP10X

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.