The course provides an introduction to fundamental discrete mathematical tools, facts, and concepts as well as reasoning methods relevant to all areas of computer science. The class challenges students to rigorously formulate and solve problems. A goal is for students to develop and practice general and formal reasoning abilities. Topics covered include: Logic; proofs; functions, sums, and sets; Big-Oh notation, growth of functions; induction, recursion, and recursive algorithms; basic probability theory; trees and graphs; finite state automata, regular expressions, and context-free languages; Turing machines.
Class Times: Tuesday, Thursday, 10:30 am - 11:45 am, Matthews Hall 210
Instructor:
Prof. Petros Drineas
Head TA: Javad Darivandpour
For Office hours, PSO information, and all other course
information see Blackboard.
Class Times: Tuesday, Thursday, 1:30 pm - 2:45 pm, WALC 1055
Instructor: Prof. Susanne Hambrusch
Head TA: Ahmed Mahmood
For Office hours, PSO information, and all other course information see Blackboard.
Exams
for LE1 and LE2:
Midterm 1: Tuesday, February 13, 6:30-7:30 pm, WALC 1055
Midterm 2: Thursday, April 5, 8:00-9:00 pm, WALC 1055
Final Exam: see University exam schedule. Do not schedule to leave town before the exam date is posted (exam could be on Saturday).
Course
work, standards, and policies.
Make
sure to read and understand all expectations and policies on course work,
homework, grading, and academic honesty described on those pages.
Clickers will be used during class for short answer questions and feedback. If you do not have a clicker, obtain one before the first class. Register your clicker on Blackboard before the first class
Course Textbook.
Kenneth Rosen, Discrete Mathematics and
Its Applications, McGraw-Hill Science/Engineering/Math; 7th edition.
Digital version in Purdue Library.