CS3114 Data Structures and Algorithms
Calendar and Coursenotes: Fall 2012

This page will show what we cover each day, including the course notes covered in class as they are presented on the screen.

Reading assignments are also posted for each week. You can find the textbook here. The intention is that you will have finished the reading for that week by the end of the week (that is, typically you would be expected to read material after the associated lecture).

• Week 1: Course introduction; Introduce Project 1
  • Tuesday, August 28: Course intro
    Coursenotes: 2-15
    Handouts: Syllabus, prereq forms, force add forms (as needed)
    Reading Assignment: Chapter 1 in the textbook
    Homework: Sign up at Piazza forum for the class; Look through the Project 1 assignment spec
    
  • Thursday, August 30: Project scheduling and time management; Introduce Project 2
    
• Week 2: Math background; Algorithm Analysis
  • Tuesday, September 4: Math background, algorithm analysis
    Coursenotes: 16-37
    Project 1 initial schedule sheet due to Web-CAT by 11pm
    Reading Assignment: Chapter 2 in the textbook
    
  • Thursday, September 6: Algorithm analysis
    Coursenotes: 38-62
    Reading Assignment: Chapter 3 in the textbook
    
• Week 3: Lists, Stacks, and Queues
  • Tuesday, September 11: Lists
    Coursenotes: 63-87
    Project 1 intermediate schedule sheet due to Web-CAT by 11pm
    Michael Naper's project workshop session @ 5:00 in McBryde 110
    
  • Thursday, September 13: Freelists, doubly-linked lists, stacks, queues
    Coursenotes: 88-105
    Reading Assignment: Chapter 4 in the textbook
    
• Week 4: Dictionaries, Binary Trees
  • Tuesday, September 18: Dictionaries, Binary tree terminology
    Coursenotes: 106-117
    Project 1 due to Web-CAT by 11pm
    
  • Thursday, September 20: Discuss Project 2; Binary tree representation
    Coursenotes: 118-131
    
• Week 5: BST, heaps
  • Tuesday, September 25:Composite design, BST
    Coursenotes: 132-143
    Homework 1 due to Web-CAT by 11pm
    
  • Wednesday, September 26:
    Project 2 initial schedule sheet due to Web-CAT by 11pm
    
  • Thursday, September 27:BST, heaps
    Coursenotes: 144-162
    Reading Assignment: Chapter 5 in the textbook (through Section 5.5)
    Links to visualizations shown in class for heaps:
    
    • Delete from minheap
    • Insert one-at-a-time
    • Build a heap
• Week 6: Midterm
  • Tuesday, October 2: Midterm I on Chapters 1-5
  • Thursday, October 4: Go over Midterm I
• Week 7: Sorting
  • Tuesday, October 9: Quadratic Sorts
    Reading Assignment: OpenDSA tutorials 1.1-1.7
    Project 2 intermediate schedule sheet due
    
  • Thursday, October 11: Shellsort
    Reading Assignment: OpenDSA tutorials through 1.8
    
• Week 8: Sorting
  • Monday, October 15:
    Early bonus date for Project 2
    
  • Tuesday, October 16: n log n sorts
    Lecture on analysis of sorting algorithms
    Reading Assignment: OpenDSA tutorials through 1.12
    Project 2 due
    
  • Thursday, October 18: Binsort, Radix Sort, Lower Bounds for Sorting
    Lecture on sorting lower bounds
    Reading Assignment: OpenDSA tutorials through 1.17
    
• Week 9: Files and Buffers; Hashing
• Tuesday, October 23: Files and Buffers
  Coursenotes: 163-186
  Reading Assignment: Sections 8.1-8.4 in the textbook
  
• Thursday, October 25: Hashing
• Week 10: Hashing
  Tuesday, October 30: Hashing
  • Thursday, November 1: Midterm II on Sorting and Hashing
• Week 11: Buffer Pools and External Sorting
  • Tuesday, November 6: Go over midterm, review buffer pools
  • Thursday, November 8: External Sorting
    Coursenotes: 187-205
    Reading Assignment: Section 8.5 in the textbook
    
• Week 12: Indexing and B-Trees
  • Tuesday, November 13: Indexing
    Discuss Project 4
    Coursenotes: 206-210
    
  • Thursday, November 15: B-Trees
    Coursenotes: 211-217
    Initial Schedule Sheet for Project 4 due
• Thanksgiving Break: 11/17-11/25
• Week 13:
  • Tuesday, November 27: B-trees
    Discuss Project 4
    Coursenotes: 218-227
    
  • Thursday, November 29: B-Trees
    Discuss Project 4
    Coursenotes: 228-229
    
• Week 14: Graphs
  • Tuesday, December 4:
    Intermediate Schedule Sheet for Project 4 due
• Week 15:
  • Tuesday, December 11:
    Project 4 due
  • Thursday, December 13:
    Homework 3 due
• Monday, December 17: Final Exam @ 1:05-3:05

Go to the CS3114 Homepage.