Announcements

This is initial information for CS 182 LE1 for Spring 2013. Current course information will be maintained on the Blackboard page for the course during the semester.

Instructors

Alex Pothen

• Office : LWSN 2116G
• Office hours : Mon, Wed 3:00pm-4:00pm and by appointment
• Email address: apothen at cs dot purdue dot edu

Teaching Assistants

Fang-Yu Rao

• Office : LWSN 2161 (#1)
• Office hours : TBD
• Email address: raof at purdue dot edu

Other TAs: Will be announced soon.

Lecture

Place : Lilly G126
Time : Monday, Wednesday, Friday 8:30 - 9:20 AM

PSOs

Place : LWSN B134
Time : Monday and Friday 1:30 - 2:20 PM (PSO P12)

Place : LWSN 1106
Time : Tuesday and Thursday 4:30 - 5:20 PM (PSO P11)

Place : LWSN 1106
Time : Monday and Friday 9:30 - 10:20 AM (PSO P14)

Place : LWSN 1106
Time : Tuesday and Thursday 08:30 - 09:20 AM (PSO P13)

Textbooks

Kenneth H. Rosen,
Discrete Math and Its Applications, Seventh edition, McGraw Hill, 2011.

Efim Kinber and Carl Smith,
Theory of Computing: A Gentle Introduction, Prentice Hall, 2000.

Grades

Grades will be determined based on the following course work:

• Attendance-- 5%
• 5 Quizzes -- 15%
• 6 Homeworks -- 30%
• Midterm -- 20% (TBD)
• Final -- 30% (TBD)

Course grades are maintained on Blackboard (course staff and students only).

Academic Dishonesty Policy

Please read this policy before starting as we intend to enforce it strictly.
For further information, look at the Professional Honesty & Conduct section of this page.

Course Description

In this course, students will learn some of the mathematical foundations needed for further study in computer science. Topics discussed in the course will include: mathematical reasoning, logic, and proof techniques; discrete structures such as sets, relations, sequences, permutations, trees and graphs; algorithmic thinking and complexity analysis; number theory and applications; counting discrete objects; finite state machines and models of computation. Students are encouraged to get engaged in class discussions and raise questions whenever they have a concern.

Prerequisites

CS 18000, MA 16100

Topics Covered (tentative)

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