CISC-235 Plan/Record

20210908

Class Notes

Setting the stage

20210910

Class Notes

Beginning our complexity study

Notes on Complexity from 2020

• Part 1
• Part 2
• Part 3

20210913

We continued to work through the material in the 2020 Complexity Notes.

20210915

We reached the end of Part 2 of the 2020 Complexity Notes.  (We'll do Part 3 on Friday ... it is the best part!)

20210917

We discussed applying Omega and Theta classification to problems as well as algorithms (Part 3 of the posted notes).

20210920

We discussed stacks very briefly.  Here are the full notes on stacks from the 2020 instance of the course.  It's valuable information but not essential for this year's syllabus. 

• Stacks Part 1
• Stacks Part 2

We began our study of binary trees:

• Binary Trees

20210922

We continued on binary trees and intoduced binary search trees:

• Binary Search Trees Part 1

20210924

The material covered in this class is in the notes already posted.

20210927

We continued to look at binary search trees.

• Binary Search Trees Part 2

20211004

• Red-Black Trees Part 1

20211006

• Red-Black Trees Part 2

20211008

• Red-Black Trees Part 3

20211011

Thanksgiving

20211013

Fall Break

20211015

Fall Break

20211018

• B-Trees

20211020

• Hashing Part 1

20211022

20211025

• Hashing Part 2

20211027

• Hashing Part 3

20211029

• Hashing Part 4

20211103

• Priority Queues (complete notes)
• NOTE:  There was an error in the notes posted here - it has been corrected.

20211112

• Introduction to Graph Theory

20211115

• Depth-First Search

20211117

• Prim's MST Algorithm

20211126

• Kruskal's MST Algorithm

20211201

• Proof of Prim's MST Algorithm