CSC220 Syllabus
- Course number and name
CSC220 – Foundations of Computer Science
- Credits and contact hours
3 Credit Hours
- Instructor’s or course coordinator’s name
Instructor: Dr. Afrand Agah, Associate Professor of Computer Science
- Text book, title, author, and year
Discrete Structure, Logic and Computability, James L. Hein, Jones & Bartlett Learning, 2009.
- Specific course information
- brief description of the content of the course (catalog description)
This course introduces regular and context free grammars and languages, computational logic, finite state machines and parsing.
- prerequisites or co-requisites
Prerequisite: Math 151 (Discrete Math) and Math 161 (Calculus I).
- indicate whether a required, elective, or selected elective course in the program
Required course.
- brief description of the content of the course (catalog description)
- Specific goals for the course
- specific outcomes of instruction
Students will be able to understand Strings, Languages, Regular Expressions, Grammars, Graphs, Tress, Recursion, Inductively Defined Sets, Regular Languages, Finite State Machines, Context-Free Languages and Pushdown Automata.
- explicitly indicate which of the student outcomes listed in Criterion 3 or any other
outcomes are addressed by the course.
Course addresses Student Outcomes (a), (o).
- specific outcomes of instruction
- Brief list of topics to be covered
- Strings, Languages, Regular Expressions
- Grammars, Graphs, Trees
- Recursion, Inductively Defined Sets
- Regular Languages, Finite State Machines
- Context-Free Languages and PDAs.