CS 5800 Exam 1 | Questions and Answers | 2025 Update.

Exam1  Graded


Student
John Ayush Xavier

Total Points
pts

Question 1
(no title) pts

 − 0 pts Correct


Question 2
(no title) pts

 − 6 pts 3 incorrect running times


 − 8 pts Incorrect explanation


 Stacks are LIFO, meaning you only need access to the first element (L.head) for Pop in any case: O(1).
-Sean


Question 3
(no title) pts

 − 0 pts Correct, Good Job!


Question 4
(no title) pts

 − 2 pts Minor Math error
its summation 0 to n-1 . so the correct form is
1
T(n) = T(0) + n(n+1) /2 + nb


Question 5
(no title) pts

 − 10 pts Some mistakes when using substitution method.


2 This step is wrong.


Question 6
(no title) pts

 − 12 pts Incorrect after first instance


 First instance of array (post-BUILD-MAX-HEAP) correct. Incorrect after that. - Kiersten


3 Correct second instance: [23, 4, 21, 3, 2, 25]

,Question 7
(no title) pts

 − 15 pts approach doesn't work, less than half of logic implemented

,