Recitation 15 Practice Problems
Parallel and Sequential Data Structures and Algorithms, 15-210 (Spring 2013)
May 1, 2013
1
Practice Problems
1.1
Leftist Heaps
As covered in lecture, a leftist heap is a data structure for priority queues that holds the key

Full Name:
Andrew ID:
Section:
15210: Parallel and Sequential Data Structures and Algorithms
Exam I (Solutions)
February 2013
There are 16 pages in this examination, comprising 6 questions worth a total of 120 points.
The last 2 pages are an appendix wit

Homework 2
15-210: Parallel and Sequential Data Structures and Algorithms (Spring13)
Version 1.1
1
due: Mon, Feb 4 @ 11:59pm
Introduction
Task 1.1 (50%).
See code solutions.
Task 1.2 (10%).
We do not provide a reference solution for testing.
Task 1.3 (30%

Homework 3
15-210: Parallel and Sequential Data Structures and Algorithms (Spring13)
Version 1.0
1
due: Mon, Feb 11 @ 11:59pm
Recurrences
For this section, we will use T (n)
following is true for all n:
f (n) + k g (n) + c to mean that k1 , k2 , c1 , c2 x

Homework 8
15-210: Parallel and Sequential Data Structures and Algorithms (Spring13)
Version 1.0 tag inprogress
1
due: Mon, Apr 8th @ 11:59pm
Introduction
In this assignment you will explore an application of binary search trees to develop efcient algorit

Full Name:
Andrew ID:
Section:
15210: Parallel and Sequential Data Structures and Algorithms
Exam II (Solutions)
4 April 2013
There are 14 pages in this examination, comprising 5 questions worth a total of 105 points.
The last 2 pages are an appendix wit