Courses
  /  
Descriptions
EECS 214: Data Structures and Data Management

Quarter Offered

Fall : 12-12:50 MWF ; Jesse A. Tov
Spring : 1-1:50 MWF ; Horswill

Prerequisites

EECS 211 or EECS 230 (Intro C++)

Description

CATALOG 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: 

TBA (Fall)

"Object-Oriented Data Structures Using JAVA," Nell Dale, Daniel Joyce, Chip Weems, Third Edition (Spring)

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

PREREQUISITES: EECS 211 or EECS 230

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

HOMEWORK ASSIGNMENTS: TBA (Fall), Five (Spring)

GRADES: Varies by Instructor

Fall:

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

Spring:

  • Assignments : 20%
  • Test 1: 20%
  • Test 2: 20%
  • Final: 40%

COURSE OBJECTIVES: