Fall 15: CSci 5421Advanced Algorithms and Data Structures
Out 9/9
Homework 1
Due 9/23
Instructions:
Please be sure to read and understand the sections on assignment submission and academic
integrity in the syllabus (under Class Policies). They apply to t
CSci 5421: Practice Questions for Midterm 1
1. Problem 4-2, p. 107.
2. Suppose that A is a kn n real matrix and B is an n kn real matrix, where k is a positive
integer. Show how you would use Strassens algorithm as a black-box (i.e., as a subroutine) to
c
Fall 15: CSci 5421Advanced Algorithms and Data Structures
Out 10/28
Homework 4
Due 11/11
Please do all problems; we will grade a subset of the assigned problems (same subset for everyone).
Please follow all of the instructions given in the handout for Hom
Fall 15: CSci 5421Advanced Algorithms and Data Structures
Out 9/23
Homework 2
Due 10/7
Please do all problems; we will grade a subset of the assigned problems (same subset for everyone).
Please follow all of the instructions given in the handout for Homew
Fall 15: CSci 5421Advanced Algorithms and Data Structures
Out 11/18
Due 12/2
Homework 5
Please do all problems; we will grade a subset of the assigned problems (same subset for everyone).
Please follow all of the instructions given in the handout for Home
Fall 15: CSci 5421Advanced Algorithms and Data Structures
Sample Solution
(Prepared by Ravi Janardan)
This write-up illustrates what is expected by way of a solution for a problem involving the design and
analysis of an algorithm (cf: Instructions for Hw1
Fall 14: CSci 5421Advanced Algorithms and Data Structures
Out 9/22
Homework 2
Due 10/8
Please do all problems; we will grade a subset of the assigned problems (same subset for everyone).
Please follow all of the instructions given in the handout for Homew
Fall 14: CSci 5421Advanced Algorithms and Data Structures
Out 9/3
Homework 1
Due 9/22
Instructions:
Please be sure to read and understand the sections on assignment submission and academic
integrity in the syllabus (under Class Policies). They apply to th
Fall 15: CSci 5421Advanced Algorithms and Data Structures
Out 12/2
Homework 6
Due 12/16 (note revised date)
Please do all problems; we will grade a subset of the assigned problems (same subset for everyone).
Please follow all of the instructions given in
Fall 15: CSci 5421Advanced Algorithms and Data Structures
Out 10/14
Homework 3
Due 10/28
Please do all problems; we will grade a subset of the assigned problems (same subset for everyone).
Please follow all of the instructions given in the handout for Hom
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by Ca
CSci 5421: Practice Questions for Midterm 2
1. Assume that you are given a set P = cfw_p1 < p2 < < pn of points on the real line; the
distance between consecutive points can be arbitrary. We would like to determine the smallest
number of non-overlapping
CSci 5421: Practice Questions for Midterm 1
1. Solve the following recurrences using the Master Theorem (MT), if it is applicable, and show
your work. If the MT is not applicable, then state clearly why this is so. Assume throughout that
T (1) = 1 and tha
Fall 14: CSci 5421Advanced Algorithms and Data Structures
Out 11/19
Homework 5
Due 12/8
Please do all problems; we will grade a subset of the assigned problems (same subset for everyone).
Please follow all of the instructions given in the handout for Home
CSci 5421: Practice Questions for Midterm 2
1. Suppose that in the 0/1-knapsack problem, the order of the items if sorted by increasing weight
(i.e., wi s) is the same as when they are sorted by decreasing value (i.e., vi s). Assume that you are
given an
CSci 5421: Practice Questions for Midterm 1
1. Solve the following recurrences using the Master Theorem (MT), if it is applicable, and show
your work. If the MT is not applicable, then state clearly why this is so. Assume throughout that
T (1) = 1 and tha
Fall 14: CSci 5421Advanced Algorithms and Data Structures
Out 10/13
Homework 3
Due 10/29
Please do all problems; we will grade a subset of the assigned problems (same subset for everyone).
Please follow all of the instructions given in the handout for Hom
Fall 14: CSci 5421Advanced Algorithms and Data Structures
Out 10/29
Homework 4
Due 11/17
Please do all problems; we will grade a subset of the assigned problems (same subset for everyone).
Please follow all of the instructions given in the handout for Hom
Fall 11: CSci 5421Advanced Algorithms and Data Structures
Out 10/31
Homework 4
Due 11/16
Please do all problems; we will grade a subset of three to four problems. Any Exercise/Problem
numbers refer to the 3rd edition of the text. (Corresponding numbers fo
Fall 11: CSci 5421Advanced Algorithms and Data Structures
Out 11/21
Homework 5
Due 12/12
Please do all problems; we will grade a subset of three to four problems. Any Exercise/Problem
numbers refer to the 3rd edition of the text. (Corresponding numbers fo
Fall 11: CSci 5421Advanced Algorithms and Data Structures
Instructor
Ravi Janardan
Dept. of Computer Science & Engineering
University of MinnesotaTwin Cities
Minneapolis, MN 55455
Oce: 6217 Keller Hall (EE/CSci Bldg.)
Phone: (612)6257338
Email: janardan@c
Fall 11: CSci 5421Advanced Algorithms and Data Structures
Sample Solution
(Prepared by Ravi Janardan)
This write-up illustrates what is expected by way of a solution for a problem involving the design
and analysis of an algorithm (cf: Instructions for Hw1
CSci 5421: Practice Questions for Midterm 1
1. Solve the following recurrences using the Master Theorem (MT), if it is applicable, and show
your work. If the MT is not applicable, then state clearly why this is so. Assume throughout that
T (1) = 1 and tha
CSci 5421: Practice Questions for Midterm 2
1(a) State the properties that a set system M = (S, I ) must satisfy to be a matroid.
(b) Let G = (V, E ) be an undirected graph. Let I be the set of all subsets of E that do not contain
cycles. Prove that M = (
CSci 5421: Practice Questions for Final Exam
Note: These questions pertain to material beyond the syllabus for the second Midterm. The
syllabus for the Final includes all topics covered in the course, however, so be sure to review earlier
material also.
1
Outline
Planar Point Location Using Persistent Search
Trees
Notion of (data structure) persistence
Motivating application (point location)
Sweep + Persistence paradigm
N. Sarnak & R. Tarjan
Making Red-Black trees persistent
CSci 5421: Advanced Algorithms