| Instructor: | Hantao Zhang | TA: Md Daniyal Dar | |
| Email: | hantao-zhang@uiowa.edu | muhammaddaniyal-dar@uiowa.edu | |
| Phone: | 319-353-2545 | ||
| Office: | 2-3:30, Tue., Wed., 201B MLH | 1:30-3pm, Mon., 2:30-4pm, Thu., 101N MLH |
Syllabus, Announcements, Homeworks, Exams, Projects, Lecture Notes,
Please start each question with the number of the question. For online submissions, only a single word file or pdf file is accepted. If you use pictures, please insert all pictures into a word file. Other types of files are ignored.
There are 10 homeworks, each counts for 3% of the final grade.
Sample solutions
Sample solutions
Sample solutions
Sample solutions
(p. 47) C-1.24, C-1.29;
(p.84) R-2.7, R-2.8 (assume each internal node has two children), C-2.4, C-2.6 (using O(n) space), C-2.11.
(p. 111-112) C-3.1, C-3.2, C-3.3, C-3.4, C-3.7, C-3.12.
(p.149-152) R-4.1,
R-4.3 (draw the tree after each insertion),
C-4.1, C-4.3, C-4.7, A-4.2.
(p.182) R-5.9 (show the content of max-heap after each removeMax operation), R-5.11, C-5.1, C-5.2, C-5.6, C-5.9 (one algorithm for min-heap and one for max-heap).
(p.236-237) R-7.3, R-7.7, C-7.6, C-7.8.
(p.259-261) C-8.2, C-8.3, C-8.5, C-8.6.
(p.260-261) C-8.9, C-8.11, C-8.12, A-8.1;
(p.279-281) C-9.2, C-9.3, C-9.5, C-9.6, A-9.4.
(p.298) C-10.4, C-10.5, C-10.7, C-10.10, A-10.1;
(p.319) R-11.1, R-11.4, C-11.3, C-11.5.
(p.346-347) R-12.1, R-12.2, R-12.5, R-12.6, R-12.8, C-12.1;
(p.392) C-13.3, C-13.10, C-13.12.
(p.418-419) R-14.6, C-14.4, C-14.5, C-14.6;
(p.439-441) C-15.3, A-15.2.
There are four projects, each counts for 5% of the final grade.
Partial solutions for midterm questions: bule sheet and yellow sheet
Have a great day!