CS 375 Fall 2017
Logic and Theory of Computing
Required/Elective: required
Prerequisites: MA113, CS215, CS275, and engineering standing
GENERAL INFORMATION

LOCATION: Whitehall Classroom Building 234

TIME: TR 9:30  10:45am

INSTRUCTOR: Dr. Fuhua (Frank) Cheng

OFFICE: Davis Marksbury Building 323

OFFICE HOURS: TR 11am  12pm,
and by appointment;

PHONE: (859) 2576760

EMAIL: cheng@cs.uky.edu

TEXTBOOK: Discrete Structures, Logic, and
Computability (4th Edition)
by James L. Hein

GRADER:
Kyle James (email: kjjames15@uky.edu)
LIST OF TOPICS

Week 1 and 2: Preliminaries: set algebra, relations,
functions  read Chapters 14

Weeks 3  6: Regular languages, finite automata
 Chapter 11

Weeks 7  9: Contextfree languages, pushdown
automata  Chapter 12

Weeks 10  12: Turing Machines  Chapter
13

Week 13: Propositional logic  Chapter
6

Week 13: Predicate logic  Chapter 7

Week 14: Computing with Logic  Chapter 9

Week 14: Algebraic structures  Chapter 10
POLICIES
There will be 810 homework assignments,
due dates will be printed on the assignments.
Homework assignments are to be submitted to the course grader
on the date due.
Submission deadlines will be strictly enforced.
NO LATE HOMEWORKS WILL BE ACCEPTED.
All course materials will be available from the
course home page:
http://www.cs.uky.edu/~cheng/cs375/
I will use email as means of communication. SEND ME
AN EMAIL IMMEDIATELY
if you have not received any email from me yet.
There will be a midterm exam and a final exam.
Final exam is not comprehensive.
The exams are closed notes/books exams.
Final grade will be based on homeworks, class attendance
record and exams, weighted as follows:

homeworks  35%

class attendance  5%

Exams  60% (30 each)
You lose 5 points of your final grade if you miss two lectures.
To compute your final grade, I will use the following scale:

A = 90  100

B = 80  89

C = 70  79

D = 60  69

E = 0  59
COURSE AND PROGRAM OUTCOMES
The students will develop knowledge of a variety of mathematical tools
for the design
and analysis of algorithms and computer programs. They will learn basic
models of
computation based on finite automata, grammars and Turing machines.
Basic concepts of
logic, proof construction, and reasoning with variables and quantifiers
will be reviewed
if time permits. Specific skills as outcomes of the course include:
 A fluency in the elements of automata theory, regular grammars
and regular expressions,
and their uses
 An understanding of the relationship between formal models of
computation and
modern computers
 An understanding of the relevance of logic and theory of computation
to the computer
science curriculum
 An ability to apply knowledge of computing and mathematics
appropriate to the discipline
 An ability to apply mathematical foundations, algorithmic
principles, and computer
science theory in the modeling and design of computerbased systems
in a way that
demonstrates comprehension of the tradeoffs involved in design choices
These course learning outcomes support the following program outcomes:
 Outcome (a): An ability to apply knowledge of computing and mathematics
appropriate
to the discipline;
 Outcome (b): An ability to analyze a problem, and identify and define the
computing
requirements appropriate to its solution;
 Outcome (c): An ability to design, implement and evaluate a computerbased
system,
process, component, or program to meet desired needs;
 Outcome (j): An ability to apply mathematical foundations, algorithmic
principles, and
computer science theory in the modeling and design of computerbased systems
in a way
that demonstrates comprehension of the tradeoffs involved in design choices;
PLAGIARISM and CHEATING are serious academic
offenses. Consult the following links
for more information on what constitutes an academic offense and on
applicable penalties:
I want to emphasize that in this class students
are allowed to discuss ideas and are
allowed to help others by explaininig concepts and possible solutions.
However, all the work that is submitted must be performed by students
individually.
Any sharing of electronic files, printouts and other materials developed
by the students is not allowed. If any fragments of text appearing in
books,
journals, conference proceedings, web pages, etc. are used, students must
provide appropriate citations.
Any help from others must also be acknowledged.
 Important Dates:
 Midterm  10/17/17 (Tuesday)
 Last day to withdraw from a course  11/10/17 (Friday)
 Thanks Giving Holidays  11/22/1711/25/17 (WednesdaySaturday)
 Last day of classes  12/7/17 (Thursday)
 Final Exam  12/11/17 (Monday 10:30 am)