Course Information

• Course: CS 201: Data Structures
  • Term: Fall 2018
  • Section: 01
  • Room: CMC 102
  • Time: MW 12:30–1:40pm and F 1:10–2:10pm
  • Piazza: https://piazza.com/carleton/fall2018/cs201/home
• Instructor: Titus Klinge
  • Email: tklinge@carleton.edu
  • Homepage: https://cs.carleton.edu/faculty/tklinge
  • Office: CMC 318
  • Phone: x6194
  • Office Hours:
    • Tuesday, 10:30–noon
    • Wednesday, 10:30–11:30 AM
    • Thursday, 2:30–4:00 PM
• Prefect: Ellie Mamantov (mamantove)
  • Review Time(s): Tue @ 8:00 PM; Sun @ 4:00 PM
  • Review Location: CMC 210
• Course Staff: Owen Szafran (szafrano) and Quinn Mayville (mayvilleq)

Course Description

Think back to your favorite assignment from Introduction to Computer Science. Did you ever get the feeling that “there has to be a better/smarter way to do this problem”? The Data Structures course is all about how to store information intelligently and access it efficiently. How can Google take your query, compare it to billions of web pages, and return the answer in less than one second? How can one store information so as to balance the competing needs for fast data retrieval and fast data modification? To help us answer questions like these, we will analyze and implement stacks, queues, trees, linked lists, graphs, and hash tables.

(Taken directly from the Carleton College Computer Science Academic Catalog, August 2018)