CS 182: Foundation of Computer Science
Summer 2017
The course covers mathematical aspects of analysis and design of algorithms, recurrences, combinatorics, trees, graphs, boolean algebra, finite state machines, and automata. Detailed syllabus.
The course will use Piazza as a discussion forum and for posting course material (e.g., assignments).
Course
work, standards, and policies for assignment preparation are described here. Note that assignments must
be typed and a PDF file must be submitted using Blackboard using stated
guidelines.
You are expected to follow the
academic integrity policies described here.
Make sure you understand all expectations and rules
PSO Times: 11:00 am - 12:50 pm, Monday Wednesday, LWSN 1106, Rashmi Soni
11:00 am - 12:50 pm, Tuesday Thursday, LWSN 1106, Ramya Vulimiri
Midterm Exam:Monday 7/10/2017 8:00 PM - 9.30 PM MATH 175
Final Exam:Wednesday 08/02/2017 10:30AM - 12:30PM WTHR 172
Ahmed R. Mahmood
LWSN1185, amahmoo@cs.purdue.edu
Office Hours:
Wednesday 2:00-3:00 pm ,
Friday 2:30-3:30 pm, or by appointment
Teaching Assistants
Sneha Balasubramanian :balasub5@purdue.edu
Office Hours: Tuesday Thursday 10:00-11:00 am (HAAS G050)
Rashmi Soni :
soni10@purdue.edu
Office Hours: Tuesday 3:00-5:00 pm (HAAS G050)
Ramya Vulimiri : rvulimir@purdue.edu
Office Hours: Monday Wednesday 10:00-11:00 am (HAAS G050)
Textbooks
Required:
Discrete Mathematics and Its Applications, K. Rosen, McGraw-Hill
Science/Engineering/Math (Latest edition).
Recommended: Theory of Computing – a Gentle Introduction, E. Kinber and C. Smith, Prentice Hall (Latest edition).
- Theoretical Computer Science Cheat Sheet
- Ten pages of mathematical formulas and other useful information for computer scientists compiled by Steve Seiden.