Parallel and Sequential Data Structures and Algorithms
CS 15210

Fall 2011
15210 Fall 2011
Homework 2
Out: 6 September 2011
Due: 12 September 2011, 23:59 EST
1
Introduction
In this homework you will solve and analyize some geometric questions to explore divideandconquer style algorithms.
1.1
Submission
This assignment is distr
Parallel and Sequential Data Structures and Algorithms
CS 15210

Fall 2011
15210: Parallel and Sequential Data Structures and Algorithms
Midterm Examination II (Solutions)
10 November 2011
There are 8 pages in this examination, comprising 5 questions worth a total of 100 points.
You have 80 minutes to complete this examination
Parallel and Sequential Data Structures and Algorithms
CS 15210

Fall 2011
15210 Fall 2011
Homework 5
Out: 10 October 2011
Due: 17 October 2011, 23:59 EST
1
Introduction
Thus far we have seen algorithms for computing the shortest paths from a single source.
Although this has countless applications, it seems wasteful when we onl
Parallel and Sequential Data Structures and Algorithms
CS 15210

Spring 2016
Lab 1  ParenLab
Parallel and Sequential Data Structures and Algorithms
1
Due: Fri, Jan 22nd , 2016 @ 5:00 pm
15210 (Spring 16)
Introduction
This assignment is designed to give you some practice with brute force and divideandconquer algorithms. You wil
Parallel and Sequential Data Structures and Algorithms
CS 15210

Fall 2011
15210: Parallel and Sequential Data Structures and Algorithms
Exam 1 Practice Problems
Exam on October 6, 78:20pm, DH2210
These problems do not have to be handed in, but we strongly suggest you try all these questions
before recitation on Wednesday Octob
Parallel and Sequential Data Structures and Algorithms
CS 15210

Fall 2011
15210: Parallel and Sequential Data Structures and Algorithms
Homework #7 Exam 2 Practice Problems
Due Tuesday, 8 November 2011, 23:59 EST
Exam on 10 November, 78:20pm, DH2210
These problems cover most of the same topics as will be covered on the exam. M
Parallel and Sequential Data Structures and Algorithms
CS 15210

Fall 2011
15210 Fall 2011
Homework 06
Out: 20th October 2011
Due: 11:59 PM EST, 27th October 2011
1
Introduction
You will begin this assignment by doing a simple analysis of a couple of algorithms from
class. You will then work on the maximal independent set (MIS)
Parallel and Sequential Data Structures and Algorithms
CS 15210

Fall 2011
15210 Fall 2011
Homework 4
Out: 23 September 2011
Due: 29 September 2011, 23:59 EST
1
Introduction
Finding shortest paths in graphs is used all over the place. Of course you have all used some
sort of map program to nd paths between your current location
Parallel and Sequential Data Structures and Algorithms
CS 15210

Spring 2016
Lab 10  DPLab
Parallel and Sequential Data Structures and Algorithms
1
Due: Mon, Apr 18th , 2016 @ 11:59 p.m.
15210 (Spring 16)
Introduction
In this assignment you will be exposed to several dynamic programming (DP) concepts, implementations, and analys
Parallel and Sequential Data Structures and Algorithms
CS 15210

Spring 2016
Lab 3  BignumLab
Parallel and Sequential Data Structures and Algorithms
1
Due: Fri, Feb 5th , 2016 @ 5:00 pm
15210 (Spring 16)
Introduction
In this assignment, you will implement arithmetic operations on a bignum type for natural numbers.
Bignums arent
Parallel and Sequential Data Structures and Algorithms
CS 15210

Spring 2016
Lab 7  BridgeLab
Due:
Parallel and Sequential Data Structures and Algorithms
1
15210 (Spring 16)
Introduction
You have been recently hired as a researcher for Tuber, a San Franhattan based startup that specializes
in widget (see Figure 1) delivery throu
Parallel and Sequential Data Structures and Algorithms
CS 15210

Spring 2016
Lab 5  FingerLab
Parallel and Sequential Data Structures and Algorithms
1
Due: Fri, Feb 26th , 2016 @ 5:00 pm
15210 (Spring 16)
Introduction
This assignment is designed to help strengthen your understanding of binary search trees. You will
implement a s
Parallel and Sequential Data Structures and Algorithms
CS 15210

Spring 2016
Lab 4  RandomLab
Parallel and Sequential Data Structures and Algorithms
1
Due: Fri, Feb 12th , 2016 @ 5:00 pm
15210 (Spring 16)
Introduction
Welcome to RandomLab! This lab will give you practice in analyzing of a variety of randomized
algorithms using t
Parallel and Sequential Data Structures and Algorithms
CS 15210

Spring 2016
Lab 6  RangeLab
Parallel and Sequential Data Structures and Algorithms
1
Due: Fri, Mar 4th , 2016 @ 5:00 pm
15210 (Spring 16)
Introduction
In this assignment you will explore an application of binary search trees to develop efficient algorithms
in compu
Parallel and Sequential Data Structures and Algorithms
CS 15210

Spring 2016
Lab 9  SegmentLab
Parallel and Sequential Data Structures and Algorithms
1
Due: Mon, Apr 4th , 2016 @ 5:00 pm
15210 (Spring 16)
Introduction
Image segmentation is a process that divides an image into many sets of pixels. In this assignment,
you will seg
Parallel and Sequential Data Structures and Algorithms
CS 15210

Fall 2011
15210 Fall 2011
Homework 09
Out: 29th November 2011
Due: 11:59 PM EST, 8th December 2011
1
Introduction
This assignment is about dynamic programming. In particular we will consider two problems:
seam carving and word breaking. In the rst problem you will
Parallel and Sequential Data Structures and Algorithms
CS 15210

Fall 2011
15210 Fall 2011
Homework 06
Out: 20th October 2011
Due: 11:59 PM EST, 27th October 2011
1
Introduction
You will begin this assignment by doing a simple analysis of a couple of algorithms from
class. You will then work on the maximal independent set (MIS)
Parallel and Sequential Data Structures and Algorithms
CS 15210

Fall 2011
15210: Parallel and Sequential Data Structures and Algorithms
Homework #7 Exam 2 Practice Problems
Due Tuesday, 8 November 2011, 23:59 EST
Exam on 10 November, 78:20pm, DH2210
These problems cover most of the same topics as will be covered on the exam. M
Parallel and Sequential Data Structures and Algorithms
CS 15210

Fall 2011
15210: Parallel and Sequential Data Structures and Algorithms
Final Exam Practice Problems
Exam on 12 December, 5:308:30pm, WeH 7500
These problems do not have to be handed in, but we strongly suggest you try all these questions
and nish as many as you c
Parallel and Sequential Data Structures and Algorithms
CS 15210

Fall 2011
15210 Fall 2011
Homework 08
Out: 15th November 2011
Due: 11:59 PM EST, 22th November 2011
1
Introduction
In this assignment you will explore an application of binary search trees to develop ecient
algorithms in computational geometry, which also happen t
Parallel and Sequential Data Structures and Algorithms
CS 15210

Fall 2011
15210 Fall 2011
Homework 3
Out: 15 September 2011
Due: 22 September 2011, 23:59 EST
1
Introduction
In this assignment you will program thousands of monkeys on typewriters to generate Shakespeare and pass spam lters.
With evil robots ubiquitous in our liv
Parallel and Sequential Data Structures and Algorithms
CS 15210

Fall 2011
15210 Fall 2011
Homework 01
Out: 30 August 2011
Due: 6 September 2011, 23:59 EST
1
Introduction
This assignment is meant to help you shake o some of the dust from summer, give you a
chance to remember SML syntax, and to familiarize yourself with the hand
Parallel and Sequential Data Structures and Algorithms
CS 15210

Fall 2011
15210 Fall 2011
Homework 2
Out: 6 September 2011
Due: 12 September 2011, 23:59 EST
1
Introduction
In this homework you will solve and analyize some geometric questions to explore divideandconquer style algorithms.
1.1
Submission
This assignment is distr
Parallel and Sequential Data Structures and Algorithms
CS 15210

Fall 2011
15210 Fall 2011
Homework 4(Solutions)
Out: 23 September 2011
Due: 29 September 2011, 23:59 EST
1
Unweighted Shortest Paths
Task 1.1 (20%). In your writeup le (hw04.pdf), you must explain why
your functions match these bounds. You might nd Lemma 2.1 in l
Parallel and Sequential Data Structures and Algorithms
CS 15210

Fall 2011
15210: Parallel and Sequential Data Structures and Algorithms
Midterm Examination I (Solutions)
6 October 2011
There are 11 pages in this examination, comprising 5 questions worth a total of 100 points.
The last 2 pages are an appendix with costs of sequ
Parallel and Sequential Data Structures and Algorithms
CS 15210

Fall 2011
15210 Fall 2011
Homework 3
Out: 15 September 2011
Due: 22 September 2011, 23:59 EST
1
Introduction
In this assignment you will program thousands of monkeys on typewriters to generate
Shakespeare and pass spam lters.
With evil robots ubiquitous in our liv
Parallel and Sequential Data Structures and Algorithms
CS 15210

Fall 2011
1
Topics
1. Shortest Paths:
A*, all pairs shortest paths
2. Probability:
Events, random variables, expectations, linearity of expectations, union bound.
Problem with nonlinearity of max and composing expectations with span.
Law of large numbers, notion o
Parallel and Sequential Data Structures and Algorithms
CS 15210

Fall 2011
15210 Fall 2011
Homework 08
Out: 15th November 2011
Due: 11:59 PM EST, 22th November 2011
1
Introduction
In this assignment you will explore an application of binary search trees to develop ecient
algorithms in computational geometry, which also happen t
Parallel and Sequential Data Structures and Algorithms
CS 15210

Fall 2011
15210 Fall 2011
Homework 5
Out: 10 October 2011
Due: 17 October 2011, 23:59 EST
1
Introduction
Thus far we have seen algorithms for computing the shortest paths from a single source.
Although this has countless applications, it seems wasteful when we onl
Parallel and Sequential Data Structures and Algorithms
CS 15210

Fall 2011
15210 Fall 2011
Homework 01
Out: 30 August 2011
Due: 6 September 2011, 23:59 EST
1
Introduction
This assignment is meant to help you shake o some of the dust from summer, give you a
chance to remember SML syntax, and to familiarize yourself with the hand
import sys
import string
import random
template = "structure Tests =
struct
type point = int * int
type box = (int * int) * (int * int)
val tests : (point * int) list * box) list = [
]
end"
# Create a lattice of random points
def genLattice(lRange = 20,