CSCE 235 – Discrete Mathematics CSCE 235 Course Info Schedule Resources Assignments Assignment 1 Assignment 2 Assignment 3 Assignment 4 Assignment 5 Assignment 6 CSCE 235 – Discrete Mathematics Spring 2018 Survey of elementary discrete mathematics. Elementary graph and tree theories, set theory, relations and functions, propositional and predicate logic, methods of proof, induction, recurrence relations, principles of counting, elementary combinatorics, and asymptotic notations. Course Info Syllabus Details on the policies, grading, expectations, etc. for this course can be found in the course syllabus. Venue Lecture TR 12:30PM – 1:45PM, Brace Lab 206 Recitations 151: M 4:30PM – 5:20PM, Avery Hall 19 (Shruti) 152: M 3:30PM – 4:20PM, Avery Hall 19 (Shruti) 153: M 5:30PM – 6:20PM, Avery Hall 19 (Molly) 154: M 12:30PM – 1:20PM, Brace Lab 310 (Shruti) 155: M 6:30PM – 7:20PM, Avery Hall 108 (Molly) Instructor Dr. Chris Bourke cbourke@cse.unl.edu Avery 363 Office Hours: MW 1:30PM – 2:30PM; T 11:00AM – 12:00Noon; R 10:00AM – 11:00AM Teaching Assistants All office hours are held in the Student Resource Center, open 9AM – 7PM Monday through Friday. Shruti Daggumati Office Hours: T 1:45PM – 3:45PM Molly Lee Office Hours: R 1:45PM – 3:45PM Renjie Gui Office Hours: R 3:00PM – 5:00PM Undergraduate Teaching Assistants Bhandari, Dipal: M 9-11:30 and 1-3, W 9-11:30, R 3:30-6:30 Eckloff, Joel: TW: 4:00PM – 6:00PM, F 3-5PM Jhi, Riley: MW 1:30PM – 2:45PM, R, 12:15 – 2PM, F 1:30 – 12:30 Kracl, Marek: TR 1:30PM – 3:30PM Le, Duc: TR 10:30AM – 12:30PM, MWF 12:30 – 2:30PM May, Jessica: R 11:30 – 1:30PM Nguyen, Anh: M 2:30PM – 4:30PM; T 1PM - 3PM Rawal, Shreya M-F 9:00AM – 10:00AM Saxena, Aniruddh: M3-4, R4-6, F2-4 Tamkiya, Shivani: R 3:30 – 5PM, F 9:00AM – 10:15AM Course Schedule Week Dates Topics Reading(s) Recitation Notes 1 Jan 8 – 12 T: Course Introduction, Logic R: Propositional Logic, Logical Equivalences Logic: AIDMA (Cusack): Chapter 4 MCS (Meyer): Chapter 3 BoP (Hammack): Chapter 2 Quick Introduction to LaTeX 2 Jan 15 – 19 T: Logical Equivalences, Quantified Logic R: Quantifiers, Proofs Proofs: AIDMA (Cusack): Chapter 2 MCS (Meyer): Chapter 1 BoP (Hammack): Chapters 4, 5, 6 No Recitation (MLK) 3 Jan 22 – 26 T: Proofs R: Sets Sets: AIDMA (Cusack): Sections 5.1, 5.2 MCS (Meyer): Section 4.1 BoP (Hammack): Chapters 1, 8 No Recitation (Weather) Assignment 1 due 4 Jan 29 – Feb 2 T: Sets R: Functions Functions: AIDMA (Cusack): Sections 5.3 MCS (Meyer): Section 4.3 BoP (Hammack): Chapter 12 Proof Exercises 5 Feb 5 – 9 T: Functions R: Relations Relations: AIDMA (Cusack): Sections 5.4 MCS (Meyer): Section 4.4 BoP (Hammack): Chapter 11 Quiz 1 Assignment 2 due 6 Feb 12 – 16 T: Relations R: Relations Function/Relation Exercises 7 Feb 19 – 23 T: Relations/Posets R: Algorithms See week 9 Quiz 2 8 Feb 26 – Mar 2 T: Review R: Midterm Midterm Review Assignment 3 due 9 Mar 5 – 9 T: Algorithms R: (Algorithms) Watch my Video Series on Algorithms & Algorithm Analysis Chapter 5, in Computer Science II AIDMA (Cusack): Chapter 7 Algorithm Practice 10 Mar 12 – 16 T: Recurrences R: Recurrences AIDMA (Cusack): sections 8.2 – 8.3 11 Mar 19 – 23 No Class, Spring Break 12 Mar 26 – 30 T: Induction R: Combinatorics Induction Exercises AIDMA (Cusack): section 8.1 AIDMA (Cusack): Chapter 9 BoP (Hammack): Chapters 10, 3 MfCS (Meyer): Section 1.8, Unit 3 Assignment 4 due 13 Apr 2 – 6 T: Combinatorics R: Combinatorics Quiz 3 14 Apr 9 – 13 T: Combinatorics R: Graphs Combinatoric Exercises Assignment 5 due 15 Apr 16 – 20 T: Graphs: Graph Isomorphism R: (Graphs) TBD AIDMA (Cusack): Chapter 10 MfCS (Meyer): Chapters 8, 10 16 Apr 23 – 27 T: (Graphs) R: (Review) TBD Dead Week Assignment 6 due 17 Apr 30 – May 4 Final Exam: Friday, May 4th, 10AM – 12 Noon Dead Week Resources Course Resources Canvas Piazza Web Handin Web Grader Department Resources Student Resource Center CSE Anonymous Feedback Academic Integrity Policy Account Management System FAQ Twitter Facebook Textbooks An Active Introduction to Discrete Mathematics and Algorithms by Charles Cusack Mathematics for Computer Science Book of Proof by John Hammack Mathematics for Computer Science by Albert R. Meyer Notes on Discrete Mathematics by James Aspnes Discrete Mathematics (wikibook) Thinking in Java by Bruce Eckel Lecture Notes Logic & Proofs Logic Logical Equivalences Cheat Sheet Predicates & Quantifiers Proofs Set Theory Sets ZFC ZFC Axioms Functions & Relations Functions Relations PartialOrders Number Theory Number Theory Number Theory Applications Recurrence Relations Recurrences Master Theorem Induction Induction Combinatorics Combinatorics Graphs & Trees Graphs Trees Computational Models Computational Models Java Resources Oracle's Java Turtorial Oracle's Object-Oriented Programming tutorial Java Debugging with Eclipse Java Debugging Video Learn Java Online MIT OpenCourseWare Java Course LaTeX Resources Getting Started With Latex Not So Short Introduction to LaTeX2e LaTeX Templates TeXworks Additional Discrete Math Resources Project Euler Stanford Cryptography Course Graph Theory by Reinhard Diestel Assignments Assignment 01 Logic and Proofs Handout Assignment 02 Quantified Logic, Set Theory Handout SetUtils.java Pair.java Assignment 03 Functions and Relations Handout Relation.java Assignment 04 Algorithms, Asymptotics Handout Assignment 05 Recurrence Relations, Induction Handout Assignment 06 Combinatorics, Graph Theory Handout GraphUtils.java JgraphDemo.java jgrapht-core-1.1.0.jar
