I500/B609: Fundamental Computer Concepts of Informatics
Discussion problems (week 3, sorting)
1. (Fuzzy sorting) Consider a sorting problem in which the numbers are not known
exactly. Instead, for eac
Introduction to Algorithms
Massachusetts Institute of Technology
Professors Erik Demaine and Sha Goldwasser
March 3, 2004
6.046J/18.410J
Practice Quiz 1
Practice Quiz 1
Do not open this quiz booklet u
EdmondsKarp algorithm
EdmondsKarp algorithm
In computer science and graph theory, the EdmondsKarp algorithm is an implementation of the FordFulkerson
method for computing the maximum flow in a flow ne
I500: Fundamental Computer Concepts of Informatics
HW4 (Due: Nov. 13 Friday BEFORE Lab session)
http:/darwin.informatics.indiana.edu/col/courses/I500-15
(This HW contains 20 bonus points if you answer
Amortized analysis (Cormen et. al., Chapter 17)
Amortized analysis analyzes algorithms that perform a sequence of similar operations.
Instead of bounding the cost of the sequence of operati
I500: Fundamental Computer Concepts of Informatics
HW2 (Due: Sep. 25 Friday BEFORE Lab session)
http:/darwin.informatics.indiana.edu/col/courses/I500-15
1. (10 pts) Illustrate the operation of Radix_s
I500/B609: Fundamental Computer Concepts of Informatics
Discussion problems (week 4, Amortized analysis)
1. Show that if a DECREMENT operation were included in the k-bit counter, n
operations could
I500/B609: Fundamental Computer Concepts of Informatics
HW5 (Due: Dec. 5, BEFORE Lab session)
http:/darwin.informatics.indiana.edu/col/courses/I500-15
(This HW contains 20 bonus points if you answer a