Previous Weeks in the CSci 261 class

Week 1: Monday, August 30

Introduction and basics

Reading:

• Chapters 1, 2

Schedule:

• Monday:
  • Introduction to the course
  • Abstract Data Types
• Tuesday:
  • Analysis of algorithms,
  • Mathematical preliminaries
• Thursday:
  • No class - doctor appt.
• Friday:
  • Mathematical preliminaries

Week 2: Monday, Sept. 6

Introduction and basics

Reading:

• Chapters 2, appendix A

Schedule:

• Monday: Labor Day: No Class
• Tuesday:
  • Analysis of algorithms,
  • Mathematical preliminaries
• Thursday:
  • Mathematical preliminaries: Induction
  • Recursion
  • Review of C++
• Friday:
  • More on recursion and induction

Week 3: Monday, Sept. 13

Review of C++ and an introduction to the analysis of algorithms

Reading:

• Appendix A, Chapter 3

Schedule:

• Monday: Review of C++: struct and file
• Tuesday: An introduction to classes and objects
• Thursday: Analysis of algorithms
• Friday: Analysis of algorithms

Other Notes:

• Monday, Sept. 13, is the last day to drop without record (4:30 PM).
• The first hour exam will be next Friday. A review sheet for the exam should be available some time Friday or during the weekend (please remind me if I delay on this).

Week 4: Monday, Sept. 20

Dynamic Data Structures

Reading:

• Chapters 3,4

Schedule:

• Monday: Analysis of Algorithms
• Tuesday: Analysis of Algorithms
• Thursday: Lists in C++: An introduction
• Friday: First Hour Exam (covering through Monday's lecture).

Week 5: Monday, Sept. 27

Dynamic Data Structures

Reading:

• Chapters 4, 5

Schedule:

• Monday: Friendly functions and operator overloading
• Tuesday: Pointers and linked list structures
• Thursday: No class (instructor out sick)
• Friday: LinkedList::List()

Other Notes:

• Last day to drop with an automatic 'W' Monday, Sept. 27

Week 6: Monday, Oct. 4

Dynamic Data Structures

Reading:

• Chapters 4

Schedule:

• Monday: Discussion of Exam #1
• Tuesday:
  • Constructor for LinkedList
  • Some more on pointers
  • Introduction to the debugger
• Thursday: Insertion and deletion in a linked list
• Friday: Stacks and recursion

Other Notes:

• Exam #2 will be next Friday

Week 7: Monday, Oct. 11

Dynamic Data Structures

Reading:

• Chapters 4, 5

Schedule:

• Monday:
  • Stacks:  array implementation
  • Stacks and recursion
• Tuesday:
  • Stacks:  Pointer implementation
  • Introduction to the debugger
• Thursday:
  • Exam review
• Friday: Second Hour Exam
  • Chapter 3 (definitions of terms, informal and formal, basic calculations)
  • Chapter 4 (through Tuesday's lecture on stacks)

Week 8: Monday, Oct. 18

Trees binary and otherwise

Reading:

• Chapters 4,5

Schedule:

• Monday: Fall Break Day (no class)
• Tuesday:
  • Queues
  • Trees and binary trees
• Thursday: No class
• Friday:
  • Binary search trees
  • Discussion of second hour exam

Other Notes:

•  Monday, Oct. 18, is Fall Break Day (no classes)

Week 9: Monday, Oct. 25

Trees binary and otherwise

Reading:

• Chapters 5-6. Skip the material on Huffman Coding Trees (section 5.4) (for CSci 361) and (for now) the material on heaps (section 5.6)

Schedule:

• Monday:
  • Binary Search Trees
  • Expression trees - traversals
• Tuesday:
  • Binary Search Trees
• Thursday: Insertion in Binary Search Trees
• Friday: Working session on the debugger

Other Notes:

•  Exam #3 will be next Friday

---

Week 10: Monday, Nov. 1

Reading:

• Chapters 6 and 7. In chapter 6, read through 6.3.

Schedule:

• Monday:
  • Deletion in Binary Search Trees
  • More on recursion
• Tuesday: Other tree representations
• Thursday: Graphs and graph traversals (search)
• Friday: Exam #3

Week 11: Monday, Nov. 8

Reading:

• Chapters 7 and 8.

Schedule:

• Monday:
  • Depth-first and breadth-first search:  
  • backtracking
• Tuesday:
  • Depth-first and breadth-first search:  
  • backtracking
• Thursday:
  • Depth-first and breadth-first search:  
  • backtracking
• Friday:
  • Introduction to internal sorting
  • Video:  Sorting out sorting
  • Discussion of Exam #3

  Other Notes:

•  

Week 12: Monday, Nov. 15

Reading:

• Chapters 7 and 8.

Schedule:

• Monday:
  • Best-first search:  shortest path
  • Brief, informal introduction to A* search
  • Minimal Spanning Trees
• Tuesday:
  • n^2 sorts: BubbleSort
• Thursday:
  • Insertion and selection sorts
• Friday:
  • "Better than n^2" sorts
    • heapsort

Week 13: Monday, Nov. 22

Reading:

• Chapters 10 (We will return to chapter 9 next week).

Schedule:

• Monday:
  • Heapsort (conclusion) 
• Tuesday:
  • An introduction to files
  • Merging
  • Distribution merge-sort
• Thursday:
  • Thanksgiving vacation
• Friday:
  • Thanksgiving vacation

  Other Notes: 

  • Thursday: Thanksgiving Vacation
  • Friday: Thanksgiving Vacation
  • Exam #4 will be next Friday