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
Theory Of Computation
Intro Theory | ||
---|---|---|
Set Theory | ||
Problems and Algorithms | ||
Big Oh, Theta, Omega |
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 |
NP - Completeness | ||
---|---|---|
Theory Of Computation | ||
NP-Completeness | ||
Approximation Algorithms |
Theory Of Computation
Intro Theory | ||
---|---|---|
Set Theory | ||
Problems and Algorithms | ||
Big Oh, Theta, Omega |
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 |
NP - Completeness | ||
---|---|---|
Theory Of Computation | ||
NP-Completeness | ||
Approximation Algorithms |