CSCE 222: Discrete Structures for Computing

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

Email:
Office:	HRBB 326
Office Hours:	TWR 10:20am - 11:10am, and by appointment

Teaching Assistants

Le Zhang

Email:	lezhang@cse.tamu.edu
Office:	ETB 2004
Office Hours:	T 3:30pm - 6:00pm, W 4:30pm-6:00pm, and by appointment

Changjoo Nam

Email:	cjnam@cse.tamu.edu
Office:	HRBB 214
Office Hours:	MW 1:30pm - 3:30pm, and by appointment

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/peer-teachers/current-peer-teachers

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)