Learning Outcomes versus Collected Course Materials (Sec 1)
CLO1CLO2CLO3CLO4CLO5CLO6CLO7CLO8CLO9CLO10CLO11CLO12N/A
HW1X
HW2XX
HW3XXX
HW4XX
HW5XX
M1P1XX
M1P2X
M1P3X
M1P4X
M1P5X
M2P1X
M2P2X
M2P3X
M2P4X
M2P5X
F1P1X
F1P2X
F1P3X
F1P4X
F1P5X
F1P6X
F1P7X
F1P8X
F1P9X
F1P10XX

Legend

MiPj -- Midterm i problem j

Fi -- Final problem i

Each class had distinct versions of all exams. Within a class there were also two versions of a given test; however, these two versions were just problem permutations of each other. The results above are all for the second of these two permutations.

CLO1 (Course Learning Outcome 1) -- By code or by hand find solution nodes in a state space using the A* algorithm.

CLO2 -- By code or by hand translate sentences in first-order logic to conjunctive normal form (CNF).

CLO3 -- By code or by hand find proofs by using resolution.

CLO4 -- Students should be able to explain the advantages and disadvantages of breadth-first search, compared to depth-first search

CLO5 -- Students should be able to explain the advantages and disadvantages of informed search, compared to uninformed search.

CLO6 -- Students should be able to explain the advantages and disadvantages of hill climbing.

CLO7 -- Students should be able to explain the advantages and disadvantages of forward checking in constraint satisfaction.

CLO8 -- Students should be able to explain the advantages and disadvantages of alpha-beta pruning.

CLO9 -- Students should be able to explain the advantages and disadvantages of the STRIPS representation for planning.

CLO10 -- Students should be able to describe the frame problem.

CLO11 -- Students should be able to describe default reasoning.

CLO12 -- Students should be able to describe or implement at least one learning algorithm.

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