Courses
  /  
Descriptions
EECS 214: Data Structures and Data Management

Quarter Offered

Fall : 12-12:50 MWF ; Tov
Spring : 1-1:50 MWF ; Horswill

Prerequisites

EECS 211

Description

The design, implementation, and analysis of abstract data types, data structures and their algorithms. Topics include: data and procedural abstraction, linked lists, stacks, queues, binary trees, searching, and sorting. Required for computer science majors.

  • (Formerly EECS 311)
  • Can be taken as EECS 395 during Spring 15'
  • This course is a required Core course in the CS curriculum in McCormick and Weinberg

REQUIRED TEXTBOOKS: 

"Object-Oriented Data Structures Using JAVA," Nell Dale, Daniel Joyce, Chip Weems, 3rd Edition (Fall)

"Introduction to Algorithms", Cormen, Leiserson, Rivest, and Stein, 3rd Edition, MIT Press 2009 (Spring)

INSTRUCTORS: Jesse A. Tov (Fall), Prof. Ian Horswill (Spring)

PREREQUISITES: EECS 211

DETAILED COURSE TOPICS:

  • Lists
  • Queues, stacks
  • Algorithm analysis
  • Skip lists
  • Binary search trees
  • Balanced trees
  • Priority queues
  • Huffman encoding
  • Self-adjusting structures
  • Splay trees
  • Tries
  • B-trees
  • Hash tables
  • Disjoint sets
  • Graphs
  • Sorting

GRADES: Varies by Instructor

Fall:

  • Exam 1: 20%
  • Exam 2: 30%
  • Assignments: 50%

Spring:

  • (Roughly Weekly) Assignments: 40%
  • Micro Quizzes: 10%
  • Quizzes (2 in class, 1 in the normal final exam slot for the class on Monday, June 8, at 9am): 50%