Which of the following explains why Martin Luther was unable…
Questions
Which оf the fоllоwing explаins why Mаrtin Luther wаs unable to perform the miracle of transubstantiation when it came time for him to administer communion or the Eucharist?
COP 5536 Advаnced Dаtа Structures Fall 2024 Exam 2 CLOSED BOOK 8:30 pm – 10:00 pm (60 Minutes + Extra 30 Minutes fоr scanning & submissiоn) PLEASE READ THE FOLLOWING INSTRUCTIONS CAREFULLY Fоr all problems, use only the algorithms discussed in class. Write your answers directly on your own white blank paper. You may use extra scratch paper for calculation, but these are not to be submitted. All answers will be graded on correctness, efficiency, clarity, elegance, and other normal criteria that determine quality. Late submission will not be accepted. Only submissions made using Honorlock will be graded. You will be monitored through Honorlock. In the response sheet please enter your name and UFID. Note. All answers will be graded on correctness, efficiency, clarity, elegance and other normal criteria that determine quality. The points assigned to each question are provided in parentheses. Last Name: _____________ First Name: _______________ UFID: _______________ Q. 1 (12) Q. 2 (10) Q. 3 (14) Q. 4 (14) Total (50) Question 1 (12): Consider the following min Fibonacci heap in which ChildCut fields are labeled as T for True and F for False (ChildCut is undefined for the root). (a) (6) Perform a DecreaseKey operation by changing 14 to 2. Show each step and clearly label ChildCut values for all nodes. (b) (6) Perform a RemoveMin operation on the original heap. Show each step and clearly label ChildCut values for all nodes. Question 2 (10): Consider the following AVL tree. (a)(5) Delete key 30, show each step and specify each rotation type. (b)(5) Start with the original AVL tree (i.e., the tree before the deletion key 30) and insert 77 and 81 in this order. Show each step and specify each rotation type. Question 3 (14): (a)(7) Insert the keys 9, 8, 7, 2, 6, 1, 3 and 4 into an initially empty red-black tree in the order shown, showing the resulting tree following each insertion. Show each step. (b)(7) For the following Red-Black trees (S) and (B) given below, perform Join (S,8,B) operation. Show each step. In the tree B denotes a black node and R denotes a red node. Question 4 (14): (a) (8) Given the following B-tree of order m = 4, show each corresponding B-tree after deletion of 95, 97, 75, 60, in this order. Use commas (,) to separate the data in a node. Show all the steps. (b) (6) In a B-tree of order m (i.e. m-way search tree) with h as the height of the tree, calculate the minimum number of nodes for the following values of m and h shown in the below table. Show the calculations. m = 20 m = 100 h = 2 h = 3