CS5003 Foundations of Computer Science

Spring 2020

Schedule
20665 	CS 5003 191 	FOUNDATIONS OF CS: AN INTRO 	3.00 	Lec 	M 	6:00-8:50 	SH309 	

Calendar Notes:

   Wednesday, January 15    First day of class. (Monday schedule) DO NOT MISS IT.
   Monday,    January 20    MLK Day, there is no class.
   Monday,    March 9,      Spring Break, there is no class
   Monday,    April 20,     Patroits Day, there is no class.
   Tuesday,   May 5,        Monday Schedule = Final Exam.  This class is not optional if you want to pass.

Text:

Languages and Machines
Thomas A. Sudkamp

Quiz Solutions:

Quiz 1

Quiz 2

Quiz 3

Quiz 4

Quiz 5

Instructor:

Herman Servatius (hservat)
Office Hours: M 5:30-6:00 PM, SH305C - or see me after class

Syllabus

This is the study of mathematical foundations of computing, at a slower pace than that of CS 503 and with correspondingly fewer background assumptions. Topics include finite automata and regular languages, pushdown automata and context-free languages, Turing machines and decidability, and an introduction to computational complexity.

Grading Plan

There will be a quiz each class, with the average of all quizzes making up %70 of your grade.

The remainder of grade will be the final exam.

Any missed quizzes will increase proportionately the amount of your grade allotted to the final exam.

To do well on the quizzes it is very important to do the homework problems. Homework will not be collected. The homework for the first couple classes is at the bottom of this page, and future assignments will appear there.


Homework
Assignment  0:  Read Chapter 1.  
Assignment  1:  a. Exercises from Chapter 1: 1-5.
                b. Prove the distributive laws.  Use the definition of set equality, as we did in class.
                c. Consider the three sets A, B and C.
                      A is the set of integers evenly divisibly by 2. 
                      B is the set of integers evenly divisibly by 3. 
                      C is the set of integers evenly divisibly by 6. 
                   Prove using the definition of set equality that C is the intersection of A and B.
                d. Let X and Y be sets, and let Z be their intersection.  
                   Prove using the definition of set equality that the power set of Z, P(Z), is equal to the
                   intersection of P(X) and P(Y).

                   Give particular examples for X and Y to show that the analogous statement is not true for the 
                   union. 
Assignment  2:  Exercises from Chapter 1: 6-26.
Assignment  3:  Exercises from Chapter 1: 38-41.
Assignment  4:  Exercises from Chapter 1: 42-48.
Assignment  5:  Exercises from Chapter 2: 1 - 13.
Assignment  6:  Exercises from Chapter 2: 14, 15, 20 - 27, 37 - 41, 43, 44, 45, 46, 47, 48