Office Hours
| Day | Time |
|---|---|
| Tuesday | 4:00pm - 5:00pm |
| Wednesday | 11:00am - Noon |
| Thursday | 4:00am - 5:00pm |
Join Office Hours via Zoom
Passcode: Monmouth
Data Structures
 | | Discrete Math |
|---|
 | Classic Data Structures | |
 | | Problems and Algorithms |
| | Running Times (Masters, Recurrence) |
| | Recurrence Equation (Master's Thm) |
| | Big Oh, Theta, Omega |
| | Amortized Analysis |
| | Sorting |
| | QuickSort |
| | HeapSort |
| Binary Search | |
| | Searching Algorithms |
| | Shortest Path |
| | Minimum Spanning Trees |
| | Dynamic Programming |
| | Theory |
|---|---|---|
| | Graph Theory |
| | Formal Languages and Automata |
| Theory Of Computation |
| | C++ |
|---|---|---|
| | C++ Templates |
| Standard Template Library |
| | Java |
|---|---|---|
| | Generics |
| Collections |
Data Structures
| | Discrete Math |
|---|
| Classic Data Structures | |
| | Problems and Algorithms |
| | Running Times (Masters, Recurrence) |
| | Recurrence Equation (Master's Thm) |
| | Big Oh, Theta, Omega |
| | Amortized Analysis |
| | Sorting |
| | QuickSort |
| | HeapSort |
| Binary Search | |
| | Searching Algorithms |
| | Shortest Path |
| | Minimum Spanning Trees |
| | Dynamic Programming |
| | Theory |
|---|---|---|
| | Graph Theory |
| | Formal Languages and Automata |
| Theory Of Computation |
| | C++ |
|---|---|---|
| | C++ Templates |
| Standard Template Library |
| | Java |
|---|---|---|
| | Generics |
| Collections |
Office Hours
| Day | Time |
|---|---|
| Tuesday | 4:00pm - 5:00pm |
| Wednesday | 11:00am - Noon |
| Thursday | 4:00am - 5:00pm |
Join Office Hours via Zoom