CSE 355
| Offered in: | Fall, Spring, and Summer |
| Credits: | 3 |
| Prerequisites: | CSE 310 |
Theoretical Computer Science
Section titled “Theoretical Computer Science”Course Description: This course covers the theoretical foundations of computer science, including computability, complexity, and formal languages.
Course Objectives:
- Regular Language, which model computing machines with finite fixed memory, and the class of regular languages, which is used for pattern matching languages
- Context-free Language, which facilitate declarative specifications of language syntax
- Computability Theory, which addresses the inherent limits of what can be solved by a computer (decidability)
- Complexity Theory, which helps us measure the time and space used to solve a problem.
Useful Tools
Section titled “Useful Tools”These are some of the tools that are useful for this course (contributions welcome!)
- NFA to DFA Converter - Convert NFA to DFA, with cool visualizations.
- Regex Tester and Debugger - Test and debug your regexes.
- Veritasium Video - 33 mins banger video on the halting problem, covers a huge chunk of the syllabus and my professor even played it in class.
- Easy Theory (Previous Prof.) - These videos are a life saver, they cover a lot of the material and are very easy to understand.
- CFG Visualizer - Create strings from your grammer and test candidate strings
Student Reviews
Section titled “Student Reviews”- Review 1: “Literally the best course I’ve taken at ASU. My professor was very engaging, hilarious in class, and the material is very well explained. The only downside is that the exams are hard, but that’s expected for a theoretical course and EasyTheory is a lifesaver. We also took a group photo at the end of the semester :)”
Fill out this form to add your review!