Welcome to CS 182: Foundations of Computer Science
- December 16: Grades for HW #7 are posted on WebCT (Statistics: Out of 65, Maximum 65, Minimum 10, Average 42.8, Median 42).
- December 14: Grades for HW #6 are posted on WebCT (Statistics: Out of 85, Maximum 85, Minimum 12, Average 54.3, Median 56).
- December 10: Solutions for both HWs #6 and #7 are posted here.
- December 6: Notes on Bayes' Theorem can be found here.
- December 2: Grades for HW #5 are posted on WebCT (Statistics: Out of 75, Maximum 74,
Minimum 15, Average 55, Median 64). Moreover, solutions are posted here.
- December 1: Click here for the 2nd midterm solutions.
- November 30: Grades for 2nd midterm are posted on WebCT (Statistics: Out of 70, Maximum 65,
Minimum 20, Average 42, Median 42).
- November 29: HW #7 is posted here.
- November 14: HW #6 is posted here.
- November 9: HW3 papers may be picked from the professor's office at 3:00pm this afternoon.
- November 8: Grades for HW #4 are posted on WebCT.
- November 5: Solutions for HW #4 are posted here.
- November 3: Class is cancelled on Monday (Nov 6). A makeup class will
be held later this month.
- November 3: HW #5 is posted here.
- November 2: Grades for HW #3 are posted on WebCT.
- October 18: HW #4 is posted here.
- October 18: Solutions for HW #3 are posted here.
- October 11 (Makeup exam for the 1st midterm): Everyone who has permission from the professor to
take a makeup exam needs to let him know what his good times are in the range:
9:30 - 11:30 AM (M, T, W, F) and
1:15 - 3:30 PM (M, W).
- October 11: Grades for HW #2 are posted on WebCT. A revised solution
is posted here.
- October 4: HW #3 is posted here.
- September 28: The midterm exam is in class tomorrow (Friday). Questions will not include
multiple choice and will be much similar to the homework questions covering all the materials explained in class thus far.
- September 27: The lecture on Complexity of Algorithms is posted here.
- September 17: HW #2 is posted here.
- September 14: Solutions for HW #1 are posted here.
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.
C S 180, MA 161
Prof. Ananth Grama
- Office : LWSN 3154G
- Office hours : Wednesday 3:00 - 4:00pm or
Place : LWSN B155
Time : Monday, Wednesday, and Friday 12:30 - 1:20pm
- Efim Kinber and Carl Smith,
Theory of Computing: A Gentle Introduction, Prentice Hall, 2001.
- Kenneth H. Rosen,
Discrete Math and Its Applications, fifth edition, McGraw Hill, 2003.
- Place: PAO B157 Time: Thursday 9:30 - 11:20am
- Place: LILY G401 Time: Thursday 1:30 - 3:20pm
Click here for the course assignments.
Course grades are maintained on
WebCT Vista (course staff and students only).
Academic Dishonesty Policy
Please read this policy before starting as I intend on enforcing it strictly.
Topics Covered (tentative)
Sets, sequences, functions, and relations
Logic and proofs
Boolean algebra and combinatorial circuits
Graphs and trees
Algorithms and their complexities
Finite state machines
Complexity classes, computability, and undecidability
Last updated August 21, 2006.