CPE/CSC/EE/SE Programs Course Syllabus

chatventriloquistAI and Robotics

Dec 1, 2013 (3 years and 10 months ago)

92 views

CPE/CSC/EE/SE Programs Course Syllabus

CSC 540
:
Theory of Computation II

(
4

credits

)

Prepared by
:

Hasmik Gharibyan
, 11/15/2007


Course Description
:

(2007
-
2009 Catalog)

Advanced topics in theoretical computer science from such areas as automata
theory, ce
llular automata theory, computational complexity, and program
verification. 4 seminars.

Required/Elective
:


CPE

CS

EE

SE

Required





Elective

X

X


X


Prerequisite Courses
:

CSC445 and graduate standing, or consent of instructor.

Prerequisites by Top
ic
:

The student should know mathematical concepts and proof techniques, and be
comfortable with the mathematical language used in research papers on
theoretical computer science. The student should also have a basic knowledge of
topics covered in CSC 445 (
Theory of Computation I) such as: theory of formal
languages and automata, Turing machines, theory of decidability, theory of
computability, etc.


Textbook
:

(and/or other required material)

“An Introduction to the Theory of Computer Science. Languages an
d Machines”
by Thomas A. Sudkamp,
third

edition, Addison
-
Wesley, 2005,

ISBN 0
-
321
-
32221
-
5.

Additionally
, reprints of research papers and online resources are used.


References
:


Course Coordinator
:

Hasmik Gharibyan

URL

(if any)




Course Goals/Learnin
g Outcomes/Performance Criteria



The student will study advanced topics in
t
heory of
c
omputation and will also learn about different
applications of this theory to practical design not only in the CS field but in other disciplines as well. The
student wil
l study classical, as well as current research papers on different topics in theoretical computer
science. The student will improve his/her ability to read and understand texts/papers on advanced topics
in theoretical computer science, and will practice pr
esenting such material to the audience of peers.



Course Assessment Methods


-

Graded
oral presentations

of assigned topics and/or research papers on theoretical
c
omputer
s
cience.


-

Quizzes on the material presented by other

s
tudents

in the class
.



Rel
ationship of Course to EAC

Program Outcomes


(H=high, M=medium, L=low, N=none; n/a=not applicable)



3
a

3
b

3
c

3
d

3
e

3
f

3
g

3
h

3
i

3
j

3
k

8l

8m

8n

CPE

L

L

L

L

L

L

L

L

L

L

L

L

L

L

EE

n/a

n/a

n/a

n/a

n/a

n/a

n/a

n/a

n/a

n/a

n/a

n/a

n/a

n/a

SE

L

L

L

L

L

L

L

L

L

L

L









Major Topics Covered: (number of hours each)


Material

of this course may include (but are not limited to) such topics as:

-

t
heory of languages and automata, and its applications in different disciplines

(3)

-

Turing
m
achines and their use

as a model of computation in different disciplines

(3)

-

o
ther types of abstract machines

(e.g. cellular automata);
their properties

and applications

(3)

-

c
omputational
c
omplexity

(3)

-

NP
-
completeness

(3)

-

u
ndecidable problems

(3)



Laboratory Projects

and Schedule

(specify number of weeks on each)


None
.



Contribution of Course to meeting EAC Category 5 Requirements


Not applicable.



Curriculum Category Content

(
specify
hours per quarter)

Area

Core

Advanced

Area

Core

Advanced

Algorithms


5

Data S
tructures



Software Design



Prog. Languages


5

Comp. Arch.








Oral and Written Communications


Every student is required to submit at least

0


written reports (not including exams, tests, quizzes, or
commented programs) of typically
_
0


pages
and to make
_
2
-
3


oral presentations of typically
_
40
-
45
minutes duration. Include only material that is graded for grammar, spelling, style, and so forth, as
well as for technical content, completeness, and accuracy.


Throughout the course students will
be required to make

2
-
3 oral presentations (40
-
45 minutes each)

on assigned
topics from the textbook and/or

research papers

on theoretical computer science
.



Social and Ethical Issues

Please list the topics that address the social and ethical implication
s of computing covered in all course
sections. Estimate the class time spent on each topic. In what ways are the students in this course
graded on their understanding of these topics (e.g., test questions, essays, oral presentations, and so
forth)?


None
.



Theoretical Content

Please list the types of theoretical material covered, and estimate the time devoted to such coverage.


The cou
rse content is 100% theoretical


Problem Analysis

Please describe the analysis experiences common to all course sections.


None.



Solution Design

Please describe the design experiences common to all course sections.


None.