SCIENTIFIC COMPUTING (3 SCU)

Learning Outcomes:

Upon successful completion of this course, students are expected to be able to: Understand the intuitive and analytical thinking for problem-solving situations in related areas of theory in computer science; Demonstrate advanced knowledge of formal computation and its relationship to language; Explain the regular language and finite automata; Apply context‐free languages, push‐down automata, and Turing recognizable languages to computational problems, their role, and limitation; Explain the basis of theory of computation, in particular the role of key problems in defining classes of equivalent problems from a computational perspective.

Topics:

This course introduces formal models of computation and the problems that they can solve. It presents Turing machines and equivalent models of computation. It also discusses the fundamental limitations of what can be computed. It covers finite state machines, regular expressions, and regular grammars as well as context-free languages and grammars and non-context free grammars. It includes algorithms and decision procedures for regular and context-free languages, Turing machine, decidability, and complexity analysis.

Prerequisite(s): None