CSCI 2115

This course introduces students to fundamental ideas in computer science. The first part of the course is an introduction to finite state machines and automata theory and its applications. Students will be introduced to finite automata, push-down automata, Turing machines, and other models of computation, with particular emphasis on finite automata. The second part of the course introduces students to asymptotic notation, complexity, and culminates with an introduction to NP-completeness.