Courses given by:
The aim of this course is to provide students the theoretical knowledge needed to understand and analyze the behavior of discrete computing systems.
Theory of mathematical models of computing devices through the study of abstract machine and corresponding formal languages. Formal languages, grammars, finite state machines, regular sets, regular expressions, limitations of finite state models, pushdown automata, context free languages, Turing machines, effective computability, unsolvable decision problems.
1: Lecture, 2: Question-Answer, 3: Lab, 4: Case-study
Course Evaluation Methods:
A: Testing, B: Experiment, C: Homework, D: Project