Academics
  /  
Courses
  /  
Descriptions
COMP_SCI 214: Data Structures and Algorithms

Quarter Offered

Fall : 9:30-10:50 TuTh ; St-Amour
Winter : 11-12:20 TuTh ; St-Amour
Spring : 3:30-4:50 TuTh ; St-Amour & Bhagavatula
Summer : Async:Remote (Optional office hours TuTh 3:30 – 4:50) ; Rasmussen

Prerequisites

COMP_SCI 111 and (COMP_SCI 150 or 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

INSTRUCTORS: Vincent St-Amour (Fall, Winter & Spring), Sruti Bhagavatula (Spring), Leif Rasmussen (Summer)

DETAILED COURSE TOPICS:

  • Abstract data types
  • Asymptotic complexity
  • Lists
  • Stacks and queues
  • Dictionaries
  • Graphs (search, shortest paths, spanning trees)
  • Priority queues
  • Disjoint sets
  • Amortized analysis
  • Self-adjusting data structures

GRADES: Varies by instructor; see syllabus