COSC 3327
Dr. Laura J. Baker, Professor
home >>
cosc3327
| Week # | Date | Topics Covered | Assignments |
|---|---|---|---|
| 1 | August 24 and 26 | Review of basic C++ classes, accessors,mutators, user defined types. Overloading of operators for a class. Using g++ on RISC Introduction to UML you may want to see this list of tutorials and examples. UML tutorial/explanation. for more examples. Example of a unit test program for an Employee class consisting of employee.h and employee.cpp . see this another example of uml | Assignment #1
Read Ch 1 and 2 in book |
| 2 | August 31 and Sept. 2 | Review more C++ classes, linked lists, sorting. Quicksort, mergesort - review code/algorithms Selectionsort, insertionsort, - review code/cost binsort - introduce. | Read Chp. 2 and 3 Assignment #2 |
| 3 | Sept 7th and Sept 9th | Code/review binsort, explain radix sort Array addressing schemes, 1-D arrays, 2-D arrays | Read Ch 3 and 4 |
| 4 | Sept 14 and Sept 16th | Dynamically allocating arrays , pointer notation with
arrays. Passing arrays to methods . An
example of implementing a vector class
Example of a program using a dynamically allocated 2-D array | Assignment #3 |
| 5 | Sept 21 and Sept 23 | Exam #1 Thursday, Sept 23 Test bank for Exam #1 Review for exam. Explain format for Portable Grayscale Map(PGM) image. | |
| 6 | Sept 28 and Sept 30 |
Example program Game of Life
for dynamically allocating a 2D array STL in C++ - stack, queue, list, deque, algorithms | |
| 7 | Oct 5th and Oct 7th | Data Compression algorithms for LZW compression
compress.cpp and
decompress.cpp code Huffman Coding algorithm for encode/decode. An article about LZW compression and Baker's help/notes for LZW compression/decompression algorithms | Assignment #4 |
| 8 | Oct 12th and Oct 14th | Huffman coding. Compress and decompress. Intro to Hash tables - chained and linear addressing. | Assignment #5 |
| 9 | Oct 19th and Oct 21st | Hash table operations methods. | |
| 10 | Oct 26th and Oct 28th | Exam #2 TUESDAY, OCT. 26th Further explanation of Hashtable methods and spell check assignment. | |
| 11 | Nov 2nd and Nov 4th | Binary trees, general trees, binary search trees methods create, search, add, remove | Assignment #6 |
| 12 | Nov 9th and Nov 11 | More on binary trees - AVL (balanced) tree rotating and balancing avl trees a nice website for AVL and other trees | Assignment #7 Help file for Avl insert avlinsert.cpp |
| 13 | Nov 16th and Nov 18th | B-trees - creating, adding, removing elements heaps - max heap, heapify, heapsort | |
| 14 | Nov 23rd | Exam #3 Tuesday, Nov 23rd. | |
| 15 | Nov 30th and Dec 2 | Graphs - traversals, searching Review for final exam | Last Extra credit opportunity |
| 16 | Dec 6th | Final Exam as scheduled by Registrar |