Homepage  Syllabus  Schedule  Homework 
Course Description 
This course teaches fundamental tools, ideas, and principles underlying the field of computer science. The class trains students to rigorously formulate and solve problems relevant to all areas of computer science. It challenges students to develop their general reasoning ability.
The course will include topics such as: logic and proofs; sets, functions, relations, sequences and summations; counting; fundamentals of the analysis of algorithms; proof techniques; recursion; finite state machines; pushdown automata; computability and undecidability. 

Location  EABA 130  
Time  MWF 3:00pm  3:50pm  
Instructor 
Philip C. Ritchey


Teaching Assistants 
Le Zhang


Changjoo Nam


Peer Teachers 
Bailey Bauman Nathan De Jong Amelia Gaughan Sarah Sahibzada The website containing the office hours for the peer teachers is http://engineering.tamu.edu/cse/academics/peerteachers/currentpeerteachers 

LaTeX  Homework must be typeset using LaTeX.  
See Dr. Lee's slides for details.  
Please check on this webpage for downloading LaTex and getting started with it.  
(The Not So Short) Introduction to LaTex  
Short Math Guide for LaTex (for reference)  
Comprehensive LaTex Symbol List (for reference) 