Department of Computer Science

CS 182: Foundations of Computer Science

Fall 2012


Home | Announcements | Schedule | Assignments | Course Info | Policies | Blackboard

Announcements

Instructors

Ananth Grama

Teaching Assistants

Fang-Yu Rao Azfar Khandoker Weihang Wang

Class

Place : ARMS 1010
Time : Tuesday and Thursday 4:30 - 5:45 PM

PSOs

Place : LWSN 1106
Time : Monday and Wednesday 01:30 - 02:20 PM (PSO1)

Place : LWSN B134
Time : Tuesday and Thursday 08:30 - 09:20 AM (PSO2)

Place : LWSN 1106
Time : Monday and Wednesday 02:30 - 03:20 PM (PSO3)

Place : LWSN 1106
Time : Monday and Wednesday 04:30 - 05:20 PM (PSO4)

Textbooks

Efim Kinber and Carl Smith,
Theory of Computing: A Gentle Introduction, Prentice Hall, 2000.

Kenneth H. Rosen,
Discrete Math and Its Applications, seventh edition, McGraw Hill, 2011.

Grades

Grades will be determined based on the following course work: Course grades are maintained on Blackboard (course staff and students only).

Academic Dishonesty Policy

Please read this policy before starting as I intend on enforcing it strictly.
For further information, look at the Professional Honesty & Conduct section of this page.

Course Description

In this course, students learn many interesting principles and aspects of computer
science that comprise the basic tools of solving different problems related to computer
science. Students should be able to develop analytical skills and become very well
acquainted with enormous computer science terminologies. Students are encouraged to
get engaged in class discussion and raise any question whenever they have a concern.

Prerequisites

CS 18000, MA 16100

Topics Covered (tentative)

Sets, sequences, functions, and relations
Number representations
Logic and proofs
Boolean algebra and combinatorial circuits
Mathematical proofs
Counting
Discrete probability
Graphs and trees
Algorithms and their complexities
Finite state machines
Pushdown automata
Complexity classes, computability, and undecidability

Last updated: September 09, 2012