Week Lecture topics Notable Events Recitation topic
1. Jan 16
  • Topics: Administrative aspects of CSE 250, Unix, separate compilation, Makefile, C++ syntax, plain old data types, operators, control structures, pointers and references, functions, pass-by-value, pass-by-reference, function pointers, user defined data types
  • Reading Assignment:
    • Textbook: Chapter P.
 Wed Jan 18: Assignments 0 and 1 out. Unix, edit files with vi/vim/emacs or other editor, Makefile
2. Jan 23
  • Topics: C++ standard libraries, C++ strings, iostream, fstream, client use of arrays, vectors
  • Reading Assignment:
    • Textbook: Chapter P.
 Mon Jan 23: Assignment 0 due.
Last day to drop the course (see here for more details) 		debugging, string, iostream, fstream, output formatting
3. Jan 30
  • Topics: Client use of queue, stack, map, set
  • Reading Assignment:
    • Textbook: Sections 1.2 to 1.4, Sections 5.1, 5.2, 5.4, Scan Chapter 2
Wed Feb 01: Assignment 1 due.
Assignment 2 out. 		File IO, basic C++
4. Feb 06
  • Topics: Recursion, iteration, and asymptotic analysis, binary search, sorting
  • Reading Assignment:
    • Textbook: Chapter 7.
 Client use of Lexer class
5. Feb 13
  • Topics: More asymptotic analysis, heap, sorting algorithms
  • Reading Assignment:
    • Textbook: Chapter 10.
 Wed Feb 15: Assignment 2 due.
I will be out of town on Feb 13 and 15. Professor Ken Regan will cover for me 		Playing with asymptotic notations.
6. Feb 20
  • Topics: Sorting algorithms
  • Reading Assignment:
    • Textbook: Chapter 10.
 Wed Feb 22 Midterm 1.
Fri Feb 24 Project 1 out.
7. Feb 27
  • Topics: Vectors and amortized analysis
  • Reading Assignment:
    • Textbook: Chapter 4.
8. Mar 05
  • Topics: Linked lists
  • Reading Assignment:
    • Textbook: Chapter 4.
 Fri Mar 09: Project 1 due.
Assignment 3 out.
9. Mar 12
 Spring Break!
10. Mar 19
  • Topics: Linked lists and skip list, iterator
  • Reading Assignment:
    • Textbook: chapter 4.
 Wed Mar 21: Assignment 3 due.
11. Mar 26
  • Topics: Trees, Heap and Priority Queues
  • Reading Assignment:
    • Textbook: Chapter 8.
 Mon Mar 26 Midterm 2.
Assignment 4 out.
12. Apr 02
  • Topics: Trees, Heap and Priority Queues
  • Reading Assignment:
    • Textbook: Chapter 8.
 Mon Apr 02: Assignment 4 due.
Assignment 5 out.
13. Apr 09
  • Topics: Self-balancing search trees
  • Reading Assignment:
    • Textbook: Chapter 11.
 Fri Apr 13: Assignment 5 due.
Assignment 6 out.
14. Apr 16
  • Topics: Self-balancing search trees
  • Reading Assignment:
    • Textbook: chapter 11.
 Fri Apr 20: assignment 7 out
Sun Apr 22: assignment 6 due
15. Apr 23
  • Topics: Sets, Maps, Hash tables
  • Reading Assignment:
    • Textbook: Chapter 9.
 Fri Apr 28: assignment 7 due
16. Apr 30
  • Topics: Graphs
  • Reading Assignment:
    • Textbook: Chapter 12.
 Apr 30 is the last day of classes
Final exam: Friday, May 04, 3:30PM – 6:30PM, Norton 112