CS:3330 (22C:031) Algorithms, Spring 2018
CS:3330:0001: 9:30-10:45, TTh 110 MLH
You may make an appointment to see us outside of the regular office hours.
Syllabus,
Announcements,
Homeworks,
Projects,
Exams,
Lecture Notes,
Sample code,
Online Resources
You may either hand over a homework in class on the due day, or
submit it to ICON before the midnight of the due day.
Please start each question with the number of the question.
For online submissions, only a single word or pdf file is accepted. If you use pictures, please insert all pictures into a word file. Other types of files are ignored.
Each homework counts for 2.5% of the final grade.
- Homework 1 is due on 1/25/18 (10 points)
Pages 42-46: R-1.7, R-1.14, R-1.15, R-1.20, R-1.26, C-1.2, C-1.4, C-1.13.
- Homework 2 is due on 2/1/18 (10 points)
P1: Convert the recursive selection sort, ssort_rec, on page 47 of lecture notes, to an interactive one, using the pattern from lecture notes, page 43-45.
P2: Prove formally that len(xw) = len(w)+1 from the definition of len over the set of strings, where w is a string and x is a letter (see lecture notes, page 51-53)
The following problems come from supplemental
Chapter 1A::
R-5.7, R-5.8, C-5.11, C-5.12, C-5.21, C-5.23
- Homework 3 is due on 2/8/18 (10 points)
(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) C-3.1, C-3.2.
- Homework 4 is due on 2/15/18 (10 points)
(p.149-152) R-4.1, C-4.1, C-4.3, C-4.7, A-4.2
- Homework 5 is due on 2/22/18 (10 points)
(p.86-88) C-2.14, C-2.17, A-2.3;
(p.149-152) R-4.3 (draw the tree after each insertion),
R-4.15, C-4.14;
(p.600) R-20.4.
- Homework 6 is due on 3/1/18 (10 points)
(p.182) R-5.9, R-5.11, C-5.2, C-5.6; (p.215) R-6.6, R-6.7, C-6.5, C-6.7.
- Homework 7 is due on 3/8/18 (10 points)
(p.236) R-7.7, R-7.8, C-7.6, C-7.8;
(p.259) C-8.2, C-8.3, C-8.5, C-8.6.
- Homework 8 is due on 3/29/18 (10 points)
(p.281) A-9.4, A-9.7; (p.298) R-10.3, C-10.4, C-10.5, C-10.7, C-10.10, A-10.1.
- Homework 9 is due on 4/10/18 (12 points)
(p.319) R-11.1, R-11.4, C-11.3;
(p.346-347) R-12.1, R-12.2, R-12.5, R-12.6, R-12.8, C-12.1, C-12.3, C-12.6, C-12.10.
- Homework 10 is due on 5/1/18 (12 points)
(p.392) R-13.6 (using recursive DFS), C-13.3, C-13.10;
(p.418) R-14.6, C-14.4, C-14.5;
(p.439) C-15.4, C-15.10.
Each project counts for 5% of the final grade.
All submissions are online.
As these lecture notes are updated before each class, please don't
download them all in advance.
Please send your feedback to hantao-zhang@uiowa.edu