CS 1502: Formal Methods in Computer Science

Description

The goals of the course are to develop student skills in modeling problems using discrete mathematics, to introduce students to new discrete structures, to further develop students' mathematical and algorithmic reasoning skills, and to introduce students to the theoretical study of information and computations as a physical phenomenon. Topics covered will include: discrete mathematics; algorithm analysis, including asymptotic notation, finding run times of iterative programs with nested loops, and using recurrence relations to find run times of recursive programs; and theory of computation, including finite state machines, regular languages, Kleene's Theorem, Church-Turing Thesis, and non-computability of the Halting Problem.
Prerequisites
- CS 0441 and CS 0445.
Requirements and Grading
- Information not available.
Recitation: A recitation associated with the selected class section is required.

Expected class size: 48 students.

Frequency: This course is usually offered in the Fall and Spring Terms.