UML CS
Analysis of Algorithms 91.404 (section 201)
Spring, 2014
Homework Set #2
Assigned: Thursday, 1/30
Due: Thursday, 2/6 (start of lecture)
This assignment covers textbook material in Chapters1-3.
Note: Refer to course web site for homework policies.
R
UML CS
Analysis of Algorithms 91.404 (section 201)
Spring, 2014
Homework Set #7
Assigned: Thursday, 3/27
Due: Tuesday, 4/1 (start of lecture)
This assignment covers textbook material on in Chapter 8.
Note: Partial credit for wrong answers is only given if
UMass Lowell Computer Science 91.404
Analysis of Algorithms
Prof. Karen Daniels
Spring, 2014
Spring
Lecture 1
Introduction/Overview
I t d ti /O
i
Text: Chapters 1, 2
Tuesday 1/21/2014
Web
W
Web Page eb Page
http:/www.cs.uml.edu/~kdaniels/courses/ALG_404_S
UML CS
Analysis of Algorithms 91.404 (section 201)
Spring, 2014
Homework Set #9
Assigned: Tuesday, 4/8
Due: Tuesday, 4/15 (start of lecture)
This assignment covers textbook material in Chapter 11 on Hash Tables.
Remember to attach signed honor statement.
Text Chapters 1, 2 Ch t 1
Sorting
Algorithm: Algorithm:
well-defined wellsteps
computational procedure that transforms input into output for the computer to follow to solve a problem
instance
Sorting P bl S ti Problem:
Input: A sequence of n numbers <
UML CS
Analysis of Algorithms 91.404 (section 201)
Spring, 2014
Homework Set #1
Assigned: Tuesday, 1/21
Due: Thursday, 1/30 (start of lecture)
This assignment covers textbook material in Chapters1-2.
Note: Refer to course web site for homework policies.
R
UML CS
Analysis of Algorithms 91.404 (section 201)
Spring, 2014
Homework Set #3
Assigned: Thursday, 2/6
Due: Thursday, 2/20 (start of lecture)
This assignment covers textbook material in Chapters1-4.
Note: Refer to course web site for homework policies.
R
UML CS
Analysis of Algorithms 91.404 (section 201)
Spring, 2014
Homework Set #4
Assigned: Thursday, 2/20
Due: Thursday, 2/27 (start of lecture)
This assignment covers textbook material in Chapters 1-5.
Note: Refer to course web site for homework policies.
Algorithms - Ch2 Sorting
(courtesy of Prof.Pecelli with some changes from Prof. Daniels)
1/16/2013
91.404 - Algorithms
1
Algorithm Description
Algorithm Description:
-Pseudocode
see conventions on p. 20-22 of textbook
-Correctness Justification
-Mechanica
Red-black tree properties
Every node in a red-black tree is either black or
red
Every null leaf is black
No path from a leaf to a root can have two
consecutive red nodes - i.e. the children of a red
node must be black
Every path from a node, x, to a d
UML CS
Analysis of Algorithms 91.404 (section 201)
Spring, 2014
Homework Set #8
Assigned: Tuesday, 4/1
Due: Tuesday, 4/8 (start of lecture)
This assignment covers textbook material in Chapter 10 and the enclosed handout from the
Computational Geometry lit
UML CS
Analysis of Algorithms 91.404 (section 201)
Spring, 2014
Homework Set #5
Assigned: Thursday, 2/27
Due: Thursday, 3/6 (start of lecture)
This assignment covers textbook material on HEAPs in Chapter 6.
Note: Partial credit for wrong answers is only g
UML CS
Analysis of Algorithms 91.404 (section 201)
Spring, 2014
Homework Set #10
Assigned: Tuesday, 4/15
Due: Tuesday, 4/29 (start of lecture)
This assignment covers textbook material in Chapters 12-13.
Note: Partial credit for wrong answers is only given
UML CS
Analysis of Algorithms 91.404 (section 201)
Spring, 2014
Homework Set #6
Assigned: Thursday, 3/6
Due: Thursday, 3/27 (start of lecture)
This assignment covers textbook material on in Chapter 7.
Note: Partial credit for wrong answers is only given i