This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Fall 11: CSci 5421—Advanced Algorithms and Data Structures Out 10/31 Homework 4 Due 11/16 Please do all problems; we will grade a subset of three to four problems. Any Exercise/Problem numbers refer to the 3rd edition of the text. (Corresponding numbers for the second edition are given, where available, in parentheses.) Please follow all of the instructions given in the handout for Homework 1. 1. (12 points) Problem 121, p. 303–304. (Problem 121, p. 268–269.) 2. (10 points) Ex. 13.24, p. 314. (Ex. 13.24, p. 279.) A careful, wellarticulated answer should be given. Pseudocode is not required. 3. (15 points) Problem 132, p. 332333. (Problem 132, p. 295296.) Supplement your answer with short code fragments, as appropriate. 4. (10 points) Let T be a redblack tree with n nodes, where each node has the usual fields: key, color, and pointers to its parent and children. In addition, each internal node x has an auxiliary field, diff , whose value is the difference between x ’s key and the minimum key in the subtree rooted...
View
Full
Document
This note was uploaded on 01/28/2012 for the course CSCI 5421 taught by Professor Sturtivant,c during the Fall '08 term at Minnesota.
 Fall '08
 Sturtivant,C
 Algorithms, Data Structures

Click to edit the document details