cs2223, D97/98 Grading of Exam 4 - 100 points total Question 1 (30 points total) Sum the following 15 for analyzing gray 1 5 for some understanding or for implicit understanding only 10 for analysis of the function 5 for some explicit analysis or correct but lacking calculation 10 for substantial analysis and comparison 15 for analyzing gray 2 5 for some understanding or for implicit understanding only 10 for analysis of the function 5 for some explicit analysis or correct but lacking calculation 10 for substantial analysis and comparison Question 2 (30 points total) Sum the following 15 for the N-rook problem 0 if there is some algorithm (list of steps) 5 if the algorithm addresses how to place the rooks on the chessboard. If there is no explanation, this is the max score 10 if the algorithm also is mostly correct 15 if the algorithmis correct. 15 for the N-bishop problem 0 if there is some algorithm (list of steps) 5 if the algorithm addresses how to place the rooks on the chessboard. If there is no explanation, this is the max score 10 if the algorithm also is mostly correct 15 if the algorithmis correct. Question 3 (40 points total) Sum the following priority 10 for a working program (no matter what it does) 0 if it is not a program, even if the algorithm is correct 5 for something which resembles a program 10 for a mostly or completely correct program 15 for the algorithm 5 for fuzzy understanding of how to construct the algorithm or for insufficient evidence of understanding. 10 for evidence of a clear understanding of the problem - how to traverse pointers towards the root and how to compare all in lists 15 for evidence of a clearly understood, correct algorithm. 15 for a correct analysis of the function as written 5 for some mention of analysis 10 for a mostly-correct analyisis or a correct analysis without explanation or calculation it 15 for a correct analysis with explanation or calculation Question4 (10 points total) 0 for no answer 10 for any answer