Chris Pollett >
CS156 |
LegendMiPj -- 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. |