CS3114 Data Structures and Algorithms, Fall 2013
Calendar and Coursenotes for 3:30 Section

This page will show what we cover each day, including the course notes covered in class.

• Week 1: Course introduction; Math background; Introduce Project 1
  • Tuesday, August 27: Course intro
    Handouts: Syllabus, prereq forms, consent forms, force add forms (as needed)
    Survey
    Sign up at Piazza forum for the class
    Look through the Project 1 assignment spec (see Assignments page)
    
  • Wednesday, August 28:
    HOMEWORK DUE BY 11PM WEDNESDAY, 8/28: Summary questions in Module 1.1: Data Structures and Algorithms
    
  • Thursday, August 29: Project 1, heaps, project management
    Today's Coursenotes
    
  • Sunday, September 1
    HOMEWORK DUE BY 11PM SUNDAY, 9/1: Complete all exercises in Chapter 2.
    
• Week 2: Math background topics; algorithm analysis
  • Monday, September 2
    HOMEWORK DUE BY 11PM MONDAY, 9/2: Reflection Assignment #1.
    
  • Tuesday, September 3: Project management; math background topics Today's Coursenotes
    Please complete the survey on procrastination that you should have received by email.
  • Thursday, September 5: Algorithm Analysis Today's Coursenotes
    HOMEWORK DUE BY 11PM SUNDAY, 9/8: Complete all exercises in Chapter 3.
    
  • Sunday, September 8
    HOMEWORK DUE BY 11PM SUNDAY, 9/8: Complete all exercises in Chapter 3.
    
• Week 3: Algorithm Analysis; Linear Structures
  • Tuesday, September 10: Algorithm Analysis; Lists
    Today's Coursenotes, also OpenDSA Modules 5.1-5.4
    
  • Thursday, September 12: Lists, stacks, queues
    Today's Coursenotes: OpenDSA modules 5.5-5.11
  • Friday, September 13
    HOMEWORK DUE BY 11PM FRIDAY, 9/13: Complete all exercises in Modules 5.1-5.8.
    
• Week 4: Binary Trees
  • Tuesday, September 17: Dictionaries, Trees
    Today's Coursenotes
    EARLY BONUS DUE DATE FOR PROJECT 1: 11PM
  • Wednesday, September 17:
    DUE DATE FOR PROJECT 1: 11PM
  • Thursday, September 19: Discuss Project 2; Traversals, Recursion
    Today's Coursenotes
    HOMEWORK DUE BY 11PM THURSDAY, 9/19: Complete all exercises in Chapter 5.
    
  • Sunday, September 22:
    HOMEWORK DUE BY 11PM SUNDAY, 9/22: Complete all exercises in Chapter 6. (You do not need to read Module 6.2)
    
• Week 5: Binary Trees
  • Monday, September 23:
    HOMEWORK DUE BY 11PM MONDAY, 9/23: Reflection Assignment #2.
    
  • Tuesday, September 24: BST, Bintree
    
  • Thursday, September 26: BST, Bintree
    HOMEWORK DUE BY 11PM THURSDAY, 9/26: Complete all exercises in Modules 7.1 to 7.8.
    
• Week 6: Midterm 1
  • Monday, September 30:
    HOMEWORK DUE BY 11PM MONDAY, 9/30: Complete all exercises in Chapter 7
    
  • Tuesday, October 1: Midterm 1
    
  • Thursday, September 26: Return Midterm; Composite design
    
• Week 7: Sorting
  • Monday, October 7
    HOMEWORK DUE BY 11PM MONDAY, 10/7: Complete all exercises in Modules 8.1-8.7
    
  • Tuesday, October 8: Simple sorts; exchange sorting
    
  • Thursday, October 10: Shellsort, Mergesort
    
• Week 8: Sorting
  • Tuesday, October 15: Quicksort, Heapsort
    
  • Thursday, October 17: Bin and Radix Sort; Lower bounds proof for sorting
    HOMEWORK DUE BY 11PM THURSDAY, 10/17: Complete all exercises in Chapter 8
• Week 9: File Processing
  • Tuesday, October 22: Model for a disk drive
    Today's Coursenotes
    
  • Wednesday, October 23:
    HOMEWORK DUE BY 11PM Wednesday, 10/23: Reflection Assignment #3.
    
  • Thursday, October 24: Buffering and buffer pools
    Today's Coursenotes
    
• Week 10: File Processing
  • Tuesday, October 29: External Sorting
    Today's Coursenotes
    
  • Thursday, October 31: Hashing: Hash functions
    Coursenotes: OpenDSA Modules 10.1-10.5
• Week 11:
  • Tuesday, November 5: Hashing: Collision resolution
    Coursenotes: OpenDSA Modules 10.6-10.9
  • Wednesday, November 6: Early bonus day for Project 3
    
  • Thursday, November 7: Hashing: Analysis, deletion; Memory Management
    DUE DATE FOR PROJECT 3: 11PM
    Coursenotes: OpenDSA Modules 10.1-10.8
• Week 12: Midterm 2 on OpenDSA Chapters 8 (Sorting) and 10 (Hashing)
  • Sunday, November 10:
    HOMEWORK DUE BY 11PM: Complete all exercises in Chapter 10
  • Tuesday, November 12: Midterm 2
    
  • Wednesday, November 13:
    HOMEWORK DUE BY 11PM Wednesday, 11/13: Reflection Assignment #4.
    
  • Thursday, November 14: Go over Midterm, Linear Indexing
    Today's Coursenotes
    
• Week 13: Indexing
  • Tuesday, November 19: Tree indexing, 2-3 trees, B-trees
    Today's Coursenotes
    
  • Thursday, November 21: B+-trees
    Today's Coursenotes
    
• Thanksgiving Break: 11/26, 11/28
• Week 14: Project 4, Union/Find
  • Tuesday, December 5: Project 4 discussion
    
  • Thursday, December 7: Union/Find, Project 4 discussion
    Today's Coursenotes
    
• Week 15:
  • Tuesday, December 12: Final, Evaluation
    
• Final Exam: Friday, December 13, 10:05-12:05
  All OpenDSA exercises due prior to the final.

Return to class home page.