Introduction to Discrete Structures I

198:205

Sections 1,2,3    Fall 2014

 

Instructor: Shubhangi Saraf

Email:   shubhangi.saraf@rutgers.edu

Timing:  MW 1:40 pm - 3:00 pm 

Location:  Lsh AUD (Livingston Campus)

Office hours:  Monday 11 am – 12 noon (Hill 426, Busch Campus)

 

----------------------

 

Teaching assistants: 

Section 1: Amey Bhangale  

Location: Til 253 (Monday 12:15 pm – 1:10 pm)

Email:  arb182@cs.rutgers.edu

Office hours: Monday 10 am – 12 noon (Hill 268, Busch Campus)

 

Section 2: Edan Harel:

Location: Sec 203 (Wednesday 10:35 am – 11:30 am)

Email: edharel@scarletmail.rutgers.edu

Office hours: Wednesday 10-10:30 am, 11:30 am – 1pm (Hill 257, Busch Campus)

 

Section 3: Mrinal Kumar

NEW LOCATION:  LSH B117 (Wednesday 12:30 pm – 1:25 pm)

Email: mk1029@cs.rutgers.edu

Office hours: Friday 12 pm – 2 pm (Hill 418, Busch Campus)

----------------------

 

 

 

Text: Kenneth H. Rosen, Discrete Mathematics and its Applications, 7th edition. Note that the bookstore is selling a "custom edition" of this textbook (ISBN 1259152154) that contains only the chapters that we will be using. This may be less expensive than buying a new book. However, you may also be able to find a used version of the complete book at a low price. Either one is OK. 

 

Please be aware of our Departmental Academic Integrity Policy.

 

 

Please also carefully read the Class Policy

 

 

 

Homework:

Click here to find out about the homework assignments.

 

 

Schedule:

Click here to find out about what was covered in class and what you should be reading next.

 

 

 

ROUGH COURSE OUTLINE

• Basics and motivation; set notation; relations; functions
  (Sections 2.1 - 2.3)
• Propositional Logic
  (Sections 1.1 - 1.3)
• Tautologies, Normal Forms, Hardware Implementations
  (Sections 12.1 - 12.3)
• First-Order Logic; quantifiers, predicates, truth and validity
  (Sections 1.4 - 1.6)
• Methods of Proof, Induction, Recursive Definitions
  (Sections 1.7 - 1.8, 5.1 - 5.3)
• MIDTERM: Wednesday Oct 15 (tentative)
• Induction; Relations; Graphs
  (Sections 9.1 - 9.6)
• Countability; Regular Expressions; Finite Automata; Computability
  (Sections 2.5, 13.1 - 13.5)
• Preliminaries for Algorithm Analysis, Cryptography
  (Sections 3.2, 4.3 - 4.6)
• Final Exam:  Dec 17 8:00 AM – 11:00 AM