CSC220 Syllabus

  1. Course number and name

    CSC220 – Foundations of Computer Science

  2. Credits and contact hours

    3 Credit Hours

  3. Instructor’s or course coordinator’s name

    Instructor: Dr. Afrand Agah, Associate Professor of Computer Science

  4. Text book, title, author, and year

    Discrete Structure, Logic and Computability, James L. Hein, Jones & Bartlett Learning, 2009.

  5. Specific course information
    1. 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.

    2. prerequisites or co-requisites

      Prerequisite: Math 151 (Discrete Math) and Math 161 (Calculus I).

    3. indicate whether a required, elective, or selected elective course in the program

      Required course.

  6. Specific goals for the course
    1. 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.

    2. 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).

  7. 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.