CS 201 - Spring 2019

Data Structures

Announcements

Homework and Exams

  1. Homework 0, due Wednesday 2/13.
  2. Homework 1, due Wednesday 2/20. Solutions.
  3. Homework 2, due Wednesday 2/27. Solutions.
  4. Homework 3, due Wednesday 3/6. Solutions.
  5. Homework 4, due Wednesday 3/13. Solutions.
  6. Homework 5, due Friday 3/22.
  7. Homework 5.5 (optional), due Wednesday 4/3.

Lectures and Readings

  1. 2/11 - Course info, overview    (Ch 0, App B.1)
  2. 2/13 - Intro to Java, examples    (App B.2.1, B.4, B.5, TIJ 304, Java language basics)
    2/15 - [Winter Carnival]
  3. 2/18 - More Java, examples    (App B.2.2, B.3.3, printf, arrays)
  4. 2/20 - Object-oriented progamming, examples    (Ch 1, objects and classes, Steve Jobs on OOP)
  5. 2/22 - More OO, Buggles, algorithmic complexity, recurrence relations    (Ch 1, Ch 5.1, Handout on recurrence equations)
  6. 2/25 - Interfaces, Vectors, ReadWords.java    (Ch 1.8, 3-3.3)
  7. 2/27 - Vector implementation    (Ch 3.4-5, code developed in class)
  8. 3/1   - Sorting: bubble, selection, insertion sort, Obama on sorting (2008)    (Ch 6.1-3, code developed in class)
  9. 3/4   - Merge sort, quick sort, SortArrays.java, complexity of sorting, xSortLab    (Ch 6.4-5)
  10. 3/6   - Sorting objects, generics, HW 4 code, examples    (Ch 4, Ch 6.7-10)
  11. 3/8   - Spaghetti, counting, bucket, and radix sort; sorting summary    (Ch 6.6, 6.10, JSTOR)
  12. 3/11 - Lists, IntLists, IntListOps
  13. 3/13 - More IntListOps, HW 5
  14. 3/15 - List Interface, SinglyLinkedList, exam info    (Ch 9-9.4)
  15. 3/18 - CircularList, DoublyLinkedList, complexity of list ops, exam review (Ch 9.6, 9.5)
    3/19 - Exam 1, MBH 216, 7-9pm, Study Guide
  16. 3/20 - Stacks, stack applications, postfix notation / RPN    (Ch 10.1, Wikipedia, xkcd)
  17. 3/22 - Queues, MazeRunner.java    (Ch 10.2, 10.3)
    3/25 - [Spring Break]

Links