Courses
  /  
Descriptions
COMP_SCI 214: Data Structures and Data Management

Quarter Offered

Fall : 9:30-10:50 TuTh ; Tov
Winter : 4-5:20 TuTh ; St-Amour
Spring : 1-1:50 MWF ; Horswill

Prerequisites

COMP_SCI 211

Description

The design, implementation, and analysis of abstract data types, data structures and their algorithms. Topics include: data and procedural abstraction, amortized data structures, trees and search trees, hash tables, priority queues, graphs, shortest paths, searching, and sorting. Required for computer science majors.

  • This course is a required Core course in the CS curriculum in McCormick and Weinberg

REQUIRED TEXTBOOKS: None

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

INSTRUCTORS: Jesse A. Tov (Fall)Dr. Vincent St-Amour (Winter) Prof. Ian Horswill (Spring)

PREREQUISITES: COMP_SCI 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; see syllabus