EECS 214: Data Structures

Syllabus – Fall 2016

Tech M345, TuTh, 9:30–10:50 AM

Course staff & office hours

Instructor: Jesse Tov jesse@eecs Ford 2-215 TuTh 3–4 PM
TA: Kaicheng Zhang kaichengzhang2016@u Tech L476 Tu 1–2 PM

General information

EECS 214 teaches the design, implementation, analysis, and proper application of abstract data types, data structures, and their algorithms. Topics include: data versus information, correctness, asymptotic analysis, and a wide variety of data structures.


This course assumes familiarity with programming as taught in EECS 111 and 211.


We will have two in-class examinations:

There will be no final exam.



We will be using a programming language called Data Structures Student Language, or DSSL for short. It runs inside the Dr Racket environment, so you will need to install the latest version of that.

To install DSSL, you must first run Dr Racket. Then copy this URL to your clipboard:

Go the the File menu in Dr Racket, and choose Install Package…. In the box that appears, paste the URL from above, and then click the Install button. When it’s done, the Install button will change to Update, indicating that the package is installed. (If changes are made to DSSL in the future then you will use this same procedure to update it.)


There is no required textbook, but you may find these books useful:

Online resources


This table specifies the lecture schedule; topics are tentative.

Tu Th
20 Intro: What’s a data structure? [slides] 22 Structs and arrays in DSSL [slides: 1 2]
27Linked lists [slides] 29Big-O notation [slides]
4Abstract data types; stack and queue ADTs [slides, code: 1 2] 6Dictionary ADT; binary search trees [slides: 1 2]
11Trees and tree walks [slides, code] 13Graphs and their representations [slides]
18Graph search [slides] 20Review session
25Exam 1 27 Dijkstra’s algorithm; priority queue ADT; binary heaps [slides: 1 2]
1 Minimum spanning tree; disjoint sets ADT; union-find [slides: 1 2] 3 Amortized analysis; dynamic arrays [slides]
8 Hashing; hash tables [slides, code] 10 Random binary search trees [slides, exercise, full code]
15 AVL trees; representation invariants [slides, code] 17 Red-black trees [slides, code]
22 Bloom filters [code] 24 – Thanksgiving —
29Review session
1Exam 2

Homework schedule

General homework policies are here.

Link Assigned Due
Homework 0: DSSL Warmup Thu., Sept. 22 Thu., Oct. 6 at 11:59 PM
Homework 1: Dictionaries Thu., Oct. 6 Thu., Oct. 13 at 11:59 PM
Homework 2: Graph Thu., Oct. 13 Thu., Oct. 27 at 11:59 PM
Homework 3: Binary heap Thu., Oct. 27 Thu., Nov. 3 at 11:59 PM
Homework 4: Union-find Thu., Nov. 3 Thu., Nov. 17 at 11:59 PM

Course policies

Collaboration and academic integrity

You may not collaborate with anyone on any of the exams. You may not use any electronic tools, including phones, tablets, netbooks, laptops, desktop computers, etc. If in doubt, ask a member of the course staff.

Some homework assignments might be completed with an assigned partner, and some may involve a larger team (TBD). You must collaborate with your assigned partner or team, as specified, on homework assignments. You may request help from any staff member on homework. (When you are working with a partner, we strongly recommend that you request help with your partner.) You may use the Piazza bulletin board to ask questions regarding assignments, so long as your questions (and answers) do not reveal information regarding solutions. You may not get any help from anyone else on a homework assignment; all material submitted must be your own. If in doubt, ask a member of the course staff.

Providing illicit help to another student is also cheating, and will be punished the same as receiving illicit help. It is your responsibility to safeguard your own work.

Students who cheat will be withdrawn from the course and reported to the appropriate dean.

If you are unclear on any of these policies, please ask a member of the course staff.


In general, you should submit your homework according to the instructions on the web page for the individual assignments.

Late work

No late work will be accepted.


Your grade will be based on your performance on five programming assignments (worth 10% each) and two in-class exams (worth 25% each). There will be no final exam.

The mapping of raw point totals to letter grades is at the discretion of the instructor.