//**********************************************************************//
//**************Last Lecture :( - April 24th, 2017*********************//
//********************************************************************//

-...it's actually comical how few people showed up today. From a class of ~300 people only about 20 actually bothered to come to the last class
    -Maybe HB's "By the way, no new test materials will be introduced on Monday" comment should've been held back for a few more days...
    -THE ROOM FEELS SO EMPTY
-So, thus far, only 1 TA has shown up, HB is nowhere to be found, there are literally less than 20 kids in a 300+ person lecture hall and it's already 9:08...
    -...annnnnnd the TA finally spoke up! "Sorry if you guys are waiting for lecture, but we decided to cancel today; I just realized HB forgot to make an announcement. Sorry about that."
        -_-

-This is the way the world ends
    -This is the way the world ends
        -This is the way the world ends
            -Not with a bang, but a whimper...
-ANNNNNNNNND that's a wrap, folks! Final's on Monday @ 11:30 in Clough 152 (this room); good luck and good day to you all!
------------------------------------------------------

-Closing Note from HB on T-Square:
"Announcement:
Subject:	Final Exam Topics
Saved By:	Hudachek-Buswell, Mary Rebecca
Modified Date:	Apr 24, 2017 2:35 pm
Message:
You MUST take the test with the section you are registered for in OSCAR. If you arrive more then 15 minutes late to the exam, then you will not be permitted to take the exam, per Georgia Tech policy, and will receive a 0.  Bring your Buzzcard to the exam as we will be collecting them and returning them to you after you finish taking the exam.

There is a practice exam from a previous semester provided under Resources/Practice Exams. You may discuss this with your classmates and with TAs in office hours. Piazza is also a great resource for this.

Below is a topic list for the exam. Please note that you may be asked questions on anything we covered in-class or on a homework assignment, even if it is not on this list; you may be asked to code anything on this list or that we have covered in class. All code will be required to be written in Java.

-Arrays
-ArrayLists
-LinkedLists (Singular, Doubly, Circular)
-Stack
-Queues
-Deques
-Iterators, Iterable
-Trees
-BST
--Operations
--Traversals
-AVLs
--Rotations
--Height
--Balance Factor
-Splay trees
-2-4 trees
-Heaps
-Priority Queues
-HashTables/HashMaps
--External Chaining
--Probing (Linear and Quadratic)
-SkipLists
-Sorting algorithms
--Bubble
--Insertion
--Selection
--Cocktail Shaker
--Merge
--Quick
--LSD Radix
-Quickselect
-String searching algorithms
--Brute Force
--Boyer Moore
--KMP
--Rabin Karp
-Graphs
--Terminology
--Representation
---Adjacency List
---Adjacency Matrix
---Edge List
--Breadth First Search (BFS)
--Depth First Search (DFS)
--Dijkstra's algorithm
--Minimum Spanning Trees
---Kruskal's algorithm
---Prim's algorithm
-Dynamic Programming
--Longest Common Subsequence (LCS)
-Generics
-Big O for all of the above

-Note from the TAs: Coding questions can be asked about anything we did on Homeworks 1-9; there will NOT be any coding questions on graph algorithms / dynamic programming

I thoroughly enjoyed being your professor this semester, and I hope you learned a lot!  Best of luck on all your finals this semester.
-Dr. HB"