Duke Computer Science Shield

CompSci 201: Data Structures & Algorithms

Spring 2013
Duke University Computer Science

Official description:

Analysis, use, and design of data structures and algorithms using an object-oriented language like Java to solve computational problems. Emphasis on abstraction including interfaces and abstract data types for lists, trees, sets, tables/maps, and graphs. Implementation and evaluation of programming techniques including recursion. Intuitive and rigorous analysis of algorithms.

Unofficial description:

Become proficient in tradeoffs involving data, information, and programming so you can understand how to change the world the way you want to, or how to live interestingly in the world. Using computer science to: empower, educate, enlighten, and explore.

Information:

Calendar
     Due dates for Assignments and APTs, and links to readings, class notes, and in-class activities.
Recitations
     We hold weekly recitations to reinforce material, no new material is covered in recitation.
About
     General information about the class, including collaboration policies, grading information, books,      information about utas and TAs, report a grading error etc.
Help
     Links to previous tests, Sakai, the online Piazza/discussion board, reference materials, etc.

When:
     Monday, Wednesday, and Friday at 10:05-11:20
Where:
     The Love Auditorium (LSRC B101).

Announcements

  • February 19, 2013: Markov due by 11:59pm

  • February 12, 2013: APT Set 3 due by 11:59pm

  • February 5, 2013: Jotto due by 11:59pm

  • January 29, 2013: APT Set 2 due by 11:59pm

  • January 24, 2013: Hangman due by 11:59pm

  • January 17, 2013: APT Set 1 due by 11:59pm

  • January 9, 2013: First day of class.