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
Discrete Mathematics
 | | Discrete Math |
|---|
 |  | Set Theory |
| | Functions (aka Methods) |
| | Numbering Systems (Binary Hex) |
| | Combinatorial Analysis |
|  | Probability Review for CS |
| | Password Encryotion |
| | Public-Private Encryotion |
| | |
| | Problems and Algorithms |
| | Running Times (Masters, Recurrence) |
| | Recurrence Equation (Master's Thm) |
| | Big Oh, Theta, Omega |
| | Amortized Analysis |
| | Graph Theory |
|---|---|---|
| | Graph Theory I |
| | Graph Theory II |
| | Chomsky's Hierarchy |
|---|---|---|
| | Formal Languages and Automata |
| | Regular Languages |
| | Context Free Languages |
| | Context Sensitive Languages |
| | Recursively Enumerable Languages |
| | Chomsky's Hierarchy of Languages |
Discrete Mathematics
| | Discrete Math |
|---|
| | Set Theory |
| | Functions (aka Methods) |
| | Numbering Systems (Binary Hex) |
| | Combinatorial Analysis |
| | Probability Review for CS |
| | Password Encryotion |
| | Public-Private Encryotion |
| | |
| | Problems and Algorithms |
| | Running Times (Masters, Recurrence) |
| | Recurrence Equation (Master's Thm) |
| | Big Oh, Theta, Omega |
| | Amortized Analysis |
| | Graph Theory |
|---|---|---|
| | Graph Theory I |
| | Graph Theory II |
| | Chomsky's Hierarchy |
|---|---|---|
| | Formal Languages and Automata |
| | Regular Languages |
| | Context Free Languages |
| | Context Sensitive Languages |
| | Recursively Enumerable Languages |
| | Chomsky's Hierarchy of Languages |
Office Hours
| Day | Time |
|---|---|
| Tuesday | 4:00pm - 5:00pm |
| Wednesday | 11:00am - Noon |
| Thursday | 4:00am - 5:00pm |
Join Office Hours via Zoom