Do not put your name on this exam.
CS6601 Final Exam – Spring
Instructions – please read thoroughly!
Do not put your name on this exam. The exams will be graded anonymously.
Fill out this PDF form and upload it to Gradescope only when you are done, with unlimited
resubmissions until the deadline. You can: (a) type directly into the form – we suggest using Adobe
Reader DC (or Evince on Linux). Other programs may not save your answers so pleasekeep a backup;
or (b) print, hand-write, & scan. You can combine the methods as well. Bullet point answers are
appreciated over full sentences. Show your work wherever indicated and clearly indicate your final
answer.
Submit only a single PDF – no phone pictures, please! (You may use an app like CamScanner if you do
not have scanner access.) Do not add pages unless absolutely necessary; if you do, please add them at
the end of the exam only, and clearly label both theextra page and the original question page. Submit
ALL pages of the exam, not only the completed ones.
Do not forget to fill the checklist at the end before turning in the exam. The exam may notbe graded
if it is left blank.
The exam is open-book, open-note, open video lectures, with no time limit aside from the openperiod.
No internet use is allowed with exceptions for e-text versions of the textbook & this semester's CS6601
course materials. No resources outside this semester‟s CS6601 class should be used. Do not discuss the
exam on Piazza, Slack, or any other form of communication. If there is a question for the teaching staff,
please make it private on Piazza and tag it as Final Exam with the question number in the subject line.
Point breakdown:
Each question has sub-parts with varying points. Bonus questions (optional) are 1 point eachand applied
to the overall grade (not included in the exam points).
Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 Q10 Q11 Q12 Total
Pts 7 4 12 4 8 10 11 3 8.5 15 4 13.5 100
1
, Do not put your name on this exam.
1. Game Playing
(7 points)
Question 1 (2 points):
Solve the game tree below using alpha beta pruning. Evaluate from left to right. Check the boxover
branches that should be pruned, then fill in the numerical values for remaining branches.
2
, Do not put your name on this exam.
Question 2 (2 points):
Solve the probabilistic game tree below. Note the branches labeled A, B and C - this is what wein the
CS6601 business know as foreshadowing.
3
, Do not put your name on this exam.
Question 3 (3 points):
For each of the labeled branches (A, B, C) in question 2, identify eval bounds that are consistent with all
observed values (5, 4, 5, 0, …) and will lead to the branch being pruned, when evaluated from left to
right. Provide the tightest possible integer bound, choose “any” if the branch will be pruned regardless
of eval bounds, or choose "not possible" if no valid boundwill prune this branch.
Branch A
Lower bound (choose 1):
❏ Any
❏ Not possible
❏ (lowest integer)
Upper bound (choose 1):
❏ Any
❏ Not possible
❏ (highest integer)
Branch B
Lower bound (choose 1):
❏ Any
❏ Not possible
❏ (lowest integer)
Upper bound (choose 1):
❏ Any
❏ Not possible
❏ (highest integer)
Branch C
Lower bound (choose 1):
❏ Any
❏ Not possible
❏ (lowest integer)
Upper bound (choose 1):
❏ Any
❏ Not possible
❏ (highest integer)
4
CS6601 Final Exam – Spring
Instructions – please read thoroughly!
Do not put your name on this exam. The exams will be graded anonymously.
Fill out this PDF form and upload it to Gradescope only when you are done, with unlimited
resubmissions until the deadline. You can: (a) type directly into the form – we suggest using Adobe
Reader DC (or Evince on Linux). Other programs may not save your answers so pleasekeep a backup;
or (b) print, hand-write, & scan. You can combine the methods as well. Bullet point answers are
appreciated over full sentences. Show your work wherever indicated and clearly indicate your final
answer.
Submit only a single PDF – no phone pictures, please! (You may use an app like CamScanner if you do
not have scanner access.) Do not add pages unless absolutely necessary; if you do, please add them at
the end of the exam only, and clearly label both theextra page and the original question page. Submit
ALL pages of the exam, not only the completed ones.
Do not forget to fill the checklist at the end before turning in the exam. The exam may notbe graded
if it is left blank.
The exam is open-book, open-note, open video lectures, with no time limit aside from the openperiod.
No internet use is allowed with exceptions for e-text versions of the textbook & this semester's CS6601
course materials. No resources outside this semester‟s CS6601 class should be used. Do not discuss the
exam on Piazza, Slack, or any other form of communication. If there is a question for the teaching staff,
please make it private on Piazza and tag it as Final Exam with the question number in the subject line.
Point breakdown:
Each question has sub-parts with varying points. Bonus questions (optional) are 1 point eachand applied
to the overall grade (not included in the exam points).
Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 Q10 Q11 Q12 Total
Pts 7 4 12 4 8 10 11 3 8.5 15 4 13.5 100
1
, Do not put your name on this exam.
1. Game Playing
(7 points)
Question 1 (2 points):
Solve the game tree below using alpha beta pruning. Evaluate from left to right. Check the boxover
branches that should be pruned, then fill in the numerical values for remaining branches.
2
, Do not put your name on this exam.
Question 2 (2 points):
Solve the probabilistic game tree below. Note the branches labeled A, B and C - this is what wein the
CS6601 business know as foreshadowing.
3
, Do not put your name on this exam.
Question 3 (3 points):
For each of the labeled branches (A, B, C) in question 2, identify eval bounds that are consistent with all
observed values (5, 4, 5, 0, …) and will lead to the branch being pruned, when evaluated from left to
right. Provide the tightest possible integer bound, choose “any” if the branch will be pruned regardless
of eval bounds, or choose "not possible" if no valid boundwill prune this branch.
Branch A
Lower bound (choose 1):
❏ Any
❏ Not possible
❏ (lowest integer)
Upper bound (choose 1):
❏ Any
❏ Not possible
❏ (highest integer)
Branch B
Lower bound (choose 1):
❏ Any
❏ Not possible
❏ (lowest integer)
Upper bound (choose 1):
❏ Any
❏ Not possible
❏ (highest integer)
Branch C
Lower bound (choose 1):
❏ Any
❏ Not possible
❏ (lowest integer)
Upper bound (choose 1):
❏ Any
❏ Not possible
❏ (highest integer)
4
