This 3-sentence summary provides the essential information about the course syllabus: The syllabus outlines the topics and requirements for the Foundations of Computer Science course, including two exams, programming assignments, and a final exam that will cover topics in computability theory, formal languages, and automata. The course is divided into two units, the first covering unrestricted languages and grammars and the second focusing on restricted languages and grammars as well as logic. Students will be evaluated based on exams, programming assignments, and final exam scores.

1. Page 1 of 5
Course Syllabus
COSC5315 (Foundations of Computer Science)
Fall 2015
Instructor: Dr. Hikyoo Koh, ProfessorofCS
Office: MA68
Office hours: W: 1PM---3PM (First hour will be in Lab.213 for optional debugging session)
Sat: 1PM---3PM (First hour will be in Lab.213 for optional debugging session)
Phone: 880-8779 (Cell Phone: 808-2554901, you can call any time, day and night)
E-mail: Primary: Blackboard Mail Tool
Alternate:hkoh@lamar.edu (in case of extreme urgency only)
Web: galaxy.cs.lamar.edu/~hkoh
A. Required textbook:
Automata Theory, Languages, and Computation, 3rd Edition, by John E. Hopcroft and Jeffrey D. Ullman,
Addison Wesley, 2007.
B. Other References:
1. Automata, Computability, and Complexity: THEORY AND APPLICATIONS,
by Elaine Rich, Prentice Hall, 2008
2. Computability, Complexity, andLanguages, SecondEdition, by Martin D. Davis, et al, Academic Press, 1994.
3. Introduction to Languages and the Theory of Computation, Fourth Edition, by John Martin,
McGraw-Hill, 2011.
C. Catalog Course Description:
The foundations of computer sciences are studiedin order to give a better understanding of the discipline. Topics include logic,
computational models, formal languages, computability andcomplexity theory. Prerequisite: None.
D. Learning Outcomes:
By completing this course, students will
1. deepen theirunderstanding of measures for separating what computers can do
from what they cannot do,
2. deepen theirunderstanding of hierarchical classifications andclosure properties
of various grammars, languages, andaccepting machines,
3. deepen theirunderstanding of equivalences among grammars, languages andaccepting machines,
4. deepen theirunderstanding of differences and equivalences between determinism
and non-determinism of various computing models, and
5. grasp thorough understanding of predicate logicand computational complexity
E. Topics to cover:
Topics are divided into two units of learning.
Unit-1: Reviews and Unrestricted Languages/Grammars (First six weeks)
1. Review:
Computable functions:
Simple Programming Language
Partially computable functions, Total functions andComputable functions.
Macros.

2. Page 2 of 5
Primitive recursion:
Composition, Recursion.
Initial functions.
Iterated Operations and Bounded Quantifiers andBoundedMinimalization.
Encoding schemes
Universal Programs:
Program Coding and Halting Problem (An Unsolvable Problem)
Recursively enumerable sets
Reducing the numberof function arguments and Practical implication.
2. Turing Machines
Two Roles: Function computers and Language acceptors
Quadruples vs. Quintuples
Determinism vs. Non-determinism
Universal TM
3. Processes and grammars
Simulation of NTM's by Semi-Thue Processes
Post's Correspondence Problem.
Unsolvable problems on Grammars.
Unit-1 Exam
Unit-2: Restricted Languages/Grammars and Logics (Last eight weeks)
4. RegularLanguages and Finite-StateAutomata
Equivalence of DSFAand NDSFA
Pumping Lemma and Closure Properties
Myhill-Nerode Theorem
5. Context-Free Languages
Normal Forms
Closure properties and Pumping Lemma
Push-down Automata
DeterministicCF Languages and theirClosure Properties
Compilerapplications
6. Context-Sensitive languages
Linear bounded automata
Closure properties
7. Quantification
Predicate logicand Semantics
Herbrand's Theorem
Unification
Unit-2 Exam
Final Exam. (Comprehensive, scheduledforSaturday, December5, 11AM---1:30PM)
F. Grading methods:
-----------------------------------------------------------------------------
2 tests: 200 points (100 points each)
Final Exam: 200 points
5 or more programs: 100 points
----------------------------------------------------------------------------
TOTAL MAX: 500 points
Programming assignments will include:
 SIMPLE language Interpreterdesign
 Most General Unifierdesign
 FSA Equivalence Checker
 NTM-to-DTM Converter
 CFG Reduction
 TM design for Binary Adder
If your class average is
90% or higher: A
Else 80% or higher: B
Else 70% or higher: C

3. Page 3 of 5
Else: D
G. Online Course Evaluations.
Lamar University encourages students to evaluate online the courses they take
and the instruction they receive via a contract with a national company,
OnlineCourseEvaluations.com.
The evaluation instruments themselves were developedby LU faculty and administrators.
Evaluation windows for fall and spring courses open two weeks before the final
examination periodand close at the endof the last class day.
The student is notifiedof the specificdates at his/hermyLAMAR e-mail address.
If course evaluations are given during summers, mini semesters, andother
compressed terms, evaluation windows are extendedpast the last class meeting.
Evaluations are completely anonymous, and neitherLU faculty nor LU administrators
have the ability to determine the name of the student who completed a specific evaluation form.
The primary purpose of course evaluation is the improvement of instruction.
That is, afterthe semesterhas endedand grades have been awarded, I am able to access
the results of my course evaluations, to include all student comments.
I analyze the data and read the comments, and often use student observations and
suggestions to make changes in course content anddelivery.
The results of course evaluations are also usedby chairs and deans as one factor
in decisions involving merit pay, tenure, and promotion.
Both the administration andI take your input via course evaluations very seriously,
and I encourage you to participate in this process.
Any questions or comments you have about the process shouldbe addressed to
Dr. Tom Matthews, University Assessment Coordinator, at 409-880-2385 or
tom.matthews@lamar.edu. Thank you.
H. Students with Disabilities:
It is the policy of Lamar University to accommodate students with disabilities pursuant to federal and state laws and the
University’s commitment to equal educational opportunities.
This course complies with the University Policies on Disability, Accommodations and Academic
Honesty as publishedin the Student Handbook and also in the Computer Science Department
Policy (on Academic Honesty). Student needing accommodations must first have them approved
through the Office of Services for Students with Disabilities, Communication Building Room 105, phone number
409-8808347.
Please notify the instructor during the first week of class regarding accommodations neededfor the class.
I. University Policy on Academic Honesty:
The University expects all students to engage in all academicpursuits in a mannerthat is above reproach.
“Cheating” include:
 Copying from anotherstudent’s paper, report, computer files, data listings, and/orprograms.
 Using (during an exam) materials not authorizedby the instructorgiving the exam.
 Collaboration, without authorizations, with anotherperson during an examination orin preparing academic work.
 Knowingly, and without authorization, using, buying, selling, stealing, transporting, soliciting, copying, orpossessing in
whole part, the contents of an unadministeredtest.
 In the taking of an examination orin the preparation of academic work to be submittedfor academic credit, (1)
Substituting foranotherstudent, (2) permitting any other person, (3) or otherwise assisting any otherperson to
substitute foroneself oranotherstudent.
 Bribing anotherperson to obtain an unadministeredexam or information about an unadministeredexam.
 Purchasing (or acquiring) and submitting as one’s own work any research paper or otherwriting assignment prepared
by an individual or firm. This does not apply to the typing of the rough and/or final versions fo an assignment by a
professional typist.
“Plagiarism”: The appropriation of another’s work or idea and the unacknowledgedincorporation of that work or idea into
one’s own work offeredfor credit.
“Collusion”: The unauthorizedcollaboration with anotherperson in preparing work offered for credit.
J. Course Attendance Policy:

4. Page 4 of 5
It is the student’s responsibility to make sure that you are officially enrolledin this course. If at any point in time, you decide to
drop the class, it is your responsibility to officially drop. The instructorwill do everything possible to helpyou. Any student who
stops attending the class and does not officially drop the course will be given an “F” as the final grade.
Regularclass attendance is critical to your effective learning. Hence when you miss the class fouror more times without the
instructor’s authorization, yourfinal grade will be loweredby one lettergrade.
Please viewthe Lamar University web page for dates for drops and withdrawals.
K. Student Services:
Some useful student services sites are listed below:
1. Lamar University academic support services
2. General Lamar University Students Services
3. SMARTHINKING
SMARTHINKING connects students to E-structor Certified tutors anytime from any Internet
connection.
Your SMARTHINKINGlogin is your myLamar email address. Your SMARTHINKINGpassword is
constructed as follows:
YY – 2-digit year of birth
MM – 2-digit month of birth
DD – 2-digit day of birth followed by “_” (Use the _ with no quotations)
Last initial – capital letter
First initial – capital letter
Last four digits of your social security number.
Example:
John Doe born January 25, 1981 Social Security Number of 123456789
His Password:810125_DJ6789
L. Emergency Procedures:
Many types of emergencies can occur on campus: instructions for severe weather or
violence/active shooter, fire, or chemical release can be found at:
http://www.lamar.edu/about-lu/administration/risk-management/index.html.
Following are procedures for the first two:
1. Severe Weather:
Follow the direction of the instructor or emergency personnel.
Seek shelter in an interior room or hallway on the lowest floor, putting as many walls as possible between
you and the outside.
If you are in a multi-story building, and you cannot get to the lowest floor, pick a hallway in the center of
the building.
Stay in the center of the room, away from exterior walls, windows and doors.
2. Violence/Active Shooter (CADD)
CALL 8311 from a campus phone (8808311 from a cell phone) Note that calling 911 from either a
campus phone or a cell phone will contact Beaumont City Police Dispatch rather than University Police.
AVIOD: If possible, self-evacuate to a safe area outside the building. Follow directions of police
officers.
DENY: Barricade the door with desks, chairs, bookcases or any other items. Move to a place inside the
room where you are not visible. Turn off the lights and remain quiet. Remain there until told by police it
is safe.
DEFEND: Use chairs, desks, cell phones or whatever is immediately available to distract and/or defend
yourself and others from attack.

5. Page 5 of 5
M. Campus Closure (academic continuity plan):
In the event of campus closure and evacuation due to a hurricane or other disaster, this course will continue
in an online format until campus reopens. After four days of closure (for evacuation and relocation), please
login to this course on Blackboard for any special instructions to continue your learning activities.
These efforts will allow you to complete the course and semester on time.
N. Special Notes:
1. The first violation of the above specified University Policy on Academic Honesty will get a grade of 0 and the second
violation will get a final grade of F.
2. Furthermore, everything you turn in to the instructorto be graded is expected to be your own work at least for the most
part.
In particular, NO solution programs available on a computer locally or through the INTERNET should be copied
without the instructor's prior approval.
3. It is to your advantage if you highlight output statements such as Java System.out.print() or System.out.println() of
your programs to clearly indicate where in your program outputs are being actually done.
4. Each program must have a comment at the VERY beginning of the program.
Without this comment, a program will not be graded at all and no credit is given to the program.
This comment must include:
a. Your full name
b. Course Number and program number
c. Program title
d. Adopted algorithms and their sources.
e. Your own assessment of the program that includes, among others:
i. whether or not the program produces expected correct outputs.
ii. if not, why you think the program is not producing the expected correct outputs.
iii. if not, whether or not the program was compiled at all.
5. If the language allows, the main program/function/method must appear at the very end of the program.