Learning Outcomes versus Collected Course Materials (Sec 1)
| LO1 | LO2 | LO3 | LO4 | LO5 | LO6 | LO7 | LO8 | LO9 | LO10 | LO11 | LO12 | N/A |
HW1 | X | | | | | | | | | | | | |
HW2 | | | | | | X | | X | | | | | |
HW3 | | X | X | | | | X | | | | | | |
MT1P1 | | | | | X | X | | | | | | | |
MT1P2 | | | | | | | X | | | | | | |
MT1P3 | | | | | | | | | | | | | X |
MT1P4 | | | | | | | | X | | | | | |
MT1P5 | | | | | X | | | | | | | | |
HW4 | | X | X | | | | | | X | X | X | | |
HW5 | | | | | | | | | | | | X | X |
FT1 | | | | | | | X | | | | | | |
FT2 | | | X | | | | | | | | | | |
FT3 | | | | | | | | | X | | | | |
FT4 | | | | | | | | | | | | | |
FT5 | | | | | | | | X | | | | | |
FT6 | | | | | | | | | | | X | | |
FT7 | | | | X | | | | | | | | | |
FT8 | | | | | | X | | | | | | | |
FT9 | | | | | | | | | | | | X | |
FT10 | | | | | | | | | X | x | | | |
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.
LO1 (Learning Outcome 1) -- By code or by hand find solution nodes in a state space using the A* algorithm.
LO2 -- By code or by hand translate sentences in first-order logic to conjunctive normal form (CNF).
LO3 -- By code or by hand find proofs by using resolution.
LO4 -- Students should be able to explain the advantages and disadvantages of breadth-first search, compared to depth-first search
LO5 -- Students should be able to explain the advantages and disadvantages of informed search, compared to uninformed search.
LO6 -- Students should be able to explain the advantages and disadvantages of hill climbing.
LO7 -- Students should be able to explain the advantages and disadvantages of forward checking in constraint satisfaction.
LO8 -- Students should be able to explain the advantages and disadvantages of alpha-beta pruning.
LO9 -- Students should be able to explain the advantages and disadvantages of the STRIPS representation for planning.
LO10 -- Students should be able to describe the frame problem.
LO11 -- Students should be able to describe default reasoning.
LO12 -- 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.
|