Chris Pollett > Old Classes >
CS267

( Print View )

Student Corner:
  [Grades Sec1]

  [Submit Sec1]

  [Class Sign Up Sec1]

  [
Lecture Notes]
  [Discussion Board]

Course Info:
  [Texts & Links]
  [Topics/Outcomes]
  [Outcomes Matrix]
  [Grading]
  [HW/Quiz Info]
  [Exam Info]
  [Regrades]
  [Honesty]
  [Additional Policies]
  [Announcements]

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

Practice Exams:
  [Mid 1]  [Mid 2]  [Final]

                           












Learning Outcomes versus Collected Course Materials
LO1LO2LO3LO4LO5LO6LO7N/A
HW1XX
HW2XXX
MT1P1X
MT1P2X
MT1P3X
MT1P4X
MT1P5XX
HW3XXX
MT2P1X
MT2P2X
MT2P3X
MT2P4X
MT2P5X
HW4XXX
F1P1X
F1P2X
F1P3X
F1P4X
F1P5X
F1P6X
F1P7X
F1P8X
F1P9
F1P0

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.

LO1 (Learning Outcome 1) -- Code a basic inverted index capable of performing conjunctive queries.

LO2 -- Be able to calculate by hand on small examples precision (fraction relevant results returned), recall (fraction of results which are relevant), and other IR statistics.

LO3 -- Be able to explain where BM25, BM25F and difference from randomness statistics come from.

LO4 -- Give an example of how a posting list might be compressed using difference lists and gamma codes or Rice codes.

LO5 -- Demonstrate with small examples how incremental index updates can be done with log merging.

LO6 -- Be able to evaluate search results by hand and using TREC eval software.

LO7 -- Know at least one Map Reduce algorithm (for example to calculate page rank).

N/A -- Important material covered in the course but not directly related to a specific learning outcome.