Ananth Grama
- Office : LWSN 3154G
- Office hours : TBD
Fang-Yu RaoAbhinav Dangeti
- Office : LWSN B116A (#1)
- Office hours : PSO3
Venkata Surya Srikanth Gandikota
- Office : LWSN B116F (#3)
- Office hours : PSO1
- Office : LWSN B116J (#2)
- Office hours : PSO2
Place : LILY G126
Time : MWF 1:30 - 2:20 PM
Place : HAAS G066
Time : Monday and Friday 02:30 - 03:20 PM (PSO1)
Place : HAAS G066
Time : Tuesday and Thursday 07:30 - 08:20 AM (PSO2)
Place : HAAS G066
Time : Monday and Wednesday 07:30 - 08:20 AM (PSO3)
- Efim Kinber and Carl Smith,
Theory of Computing: A Gentle Introduction, Prentice Hall, 2000.
- Kenneth H. Rosen,
Discrete Math and Its Applications, sixth edition, McGraw Hill, 2006.
Grades will be determined based on the following course work:Course grades are maintained on WebCT Vista (course staff and students only).
- 8 Homeworks -- 40%
- Midterm -- 25% (TBD)
- Final -- 35% (TBD)
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.
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.
CS 18000, MA 16100
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