Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network

  Advanced Search  

CSE 241 Algorithms and Data Structures Lab 3: Skip Lists

Summary: CSE 241 Algorithms and Data Structures
Lab 3: Skip Lists
Assigned: 03/30/2011 Due Date: 04/27/2011
You must read and sign the following statement to get credit for this assignment:
I have read and understood the CSE 241 collaboration policy posted on the course web site. I understand
that these rules govern homeworks, labs, and exams assigned in this class, and that violations are subject to
severe penalties. I have neither violated the collaboration policy nor helped others to violate it in completing
this assignment.
1 Overview
This lab is intended to give you some practice with the skip list data type. We'll use the skip list as a database
indexing strategy that lets us make useful queries quickly. The specific application will be an interface to a
good-sized database of historical events collected from several sources around the Web.
Our event database will contain objects of type Event. Events are pairs of the form (year, description),
where year is an integer value denoting the date of the event (negative numbers for BC/BCE dates), and
description is an arbitrary text string. I have provided you with code to read an event database from a file
into an array of Event objects. Your job is to implement an EventList, a collection type that organizes


Source: Agrawal, Kunal - Department of Computer Science and Engineering, Washington University in St. Louis


Collections: Computer Technologies and Information Sciences