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 each number, we know an interval on the real line to which
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 until you are directed to do so. Read all the instructio
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 network in O(V E2) time. It is asymptotically slower than
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 all questions correctly.)
1. (20 pts) Consider the fol
I500: Fundamental Computer Concepts of Informatics
HW3 (Due: Oct. 9, Friday 5:00 PM EDT)
http:/darwin.informatics.indiana.edu/col/courses/I500-15
Please submit your completed homework through Oncourse using pdf file format
1. (10 pts) For the set of cfw_1
I500/B609/B503: Fundamental Computer Concepts of Informatics
HW1 (Due: Sep. 12 Friday BEFORE Lab session)
http:/darwin.informatics.indiana.edu/col/courses/I500-15
1. (10 pts) Illustrate the operation of Insertion-sort algorithm on array
A=<31,41,59,26,41,
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 operations by bounding the cost of each
operation separately,
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_sort on the following list of English
words: cow, dog, 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 cost as much as (nk) time.
2. Consider the implementati
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 all questions correctly.)
1. (10 pts) Show how to find t