﻿ CS320L - Spring 2018

Computer Science/Mathematics 320L: Applied Discrete Mathematics

Spring 2018

Tuesday & Thursday  5:30pm - 6:45pm in W2-200

Welcome to "Applied Discrete Mathematics"! This page provides current information on the CS/MATH 320L course. Please come back regularly during and after the course to check for updates on assignment deadlines, office hours etc. Most importantly, all PowerPoint slides etc. I use in class will be uploaded and available from the syllabus table at the bottom of this page. These files will be uploaded immediately after each class, to make classes more surprising and exciting ;-). If you have any questions whatsoever, please don't hesitate to send me an e-mail. Also note that we have a Piazza page for discussons and announcements.

The course is aimed at the following outcomes:

• Understand the most important concepts of discrete mathematics such as sets, mathematical induction, Boolean algebras, predicate calculus, graphs, trees and relations. (B.S. in Computer Science Program Outcomes: 2a, 2b)
• Learn to apply these concepts to solve computational problems. (B.S. in Computer Science Program Outcomes: 1a, 2a, 2b)

Last updated on May 8, 2018

Evaluation (assignments are posted here)

Syllabus (PowerPoint slides are posted here)

Instructor:   Marc Pomplun
Office: S-3-171
Office Hours: Tuesdays 4:30 - 5:30pm and 7:00 - 8:00pm, Thursdays 4:30 - 5:30pm, and by appointment
Office Phone: (617) 287-6443
e-mail: marc@cs.umb.edu
Homepage: http://www.cs.umb.edu/~marc

Teaching Assistants:      Hinalikumari Chovatiya (Assigments 1 to 2)    Hinalikumari.Chov001@umb.edu

Xiaoqian Zhang (Assignments 3 to 5)   Xiaoqian.Zhang001@umb.edu

Course Description:  An introduction to the mathematical structures and concepts used in computing: sets, mathematical induction, ordered sets, Boolean algebras, predicate calculus, graphs, trees and relations. Formal and informal theories and corresponding mathematical proofs are taught. Prerequisites are CS 110 and MATH 260 or permission of the instructor.

 Text:       Discrete Mathematics and Its Applications, Seventh Edition, by Kenneth H. Rosen, WCB/McGraw-Hill, ISBN 0073383090 (available at the UMB Bookstore but may be cheaper on the web) Fourth to Sixth Edition are also OK.

Evaluation: There will be five homework assignments, three of them before spring break and the other three afterwards. A midterm exam will take place on Thursday, March 22, while the final exam is scheduled for the period from May 12 to 18 (see syllabus below). No make-up exams will be given. Your final grade will be computed as follows:

Homework:         15% (each assignment 3%)
Midterm Exam:  39%
Final Exam:         46%

 Assignment/Exam (PDF) Posted/Given on Due Date Sample Solution/Marking Guide Assignment #1 February 8 February 15 Assignment #1 Solutions Assignment #2 March 2 March 20 Assignment #2 Solutions Practice Midterm Exam March 8 March 20 Practice Midterm Solutions Midterm Exam March 22 Assignment #3 April 3 April 12 Assignment #3 Solutions Assignment #4 April 18 April 26 Assignment #4 Solutions Assignment #5 May 1 May 8 Assignment #5 Solutions Practice Exam May 1 May 8 Practice Exam Solutions Final Exam May 15

Suggested Exercises: These exercises in the textbook can help you practice applying the concepts taught in class. They are not mandatory and will not be evaluated. Their solutions are provided in the book, and you can come to my office hours to discuss the questions and solutions.

Section 1.7 (Introduction to Proofs): Questions 7, 17a
Section 3.1 (Algorithms): Questions 3, 5, 9
Section 3.2 (The Growth of Functions): Questions 1, 5, 7, 15
Section 4.2 (Integer Representations and Algorithms ): Questions 1, 3
Section 4.3 (Primes and Greatest Common Divisors): Questions 5, 17, 25
Section 5.1 (Mathematical Induction): Questions 5, 15
Section 6.1 (The Basics of Counting): Questions 3, 11, 15

Syllabus

(note: PDF files are in grayscale for better printing, PPTX files are just for playing around with)

Week

Topic

Book Chapters

Session Dates

Session Info

Slides

1

Logic and Sets

4th Edition:

1.1 - 1.5

5th Edition:

1.1 - 1.4,

1.6, 1.7

6th, 7th Edition:

1.1 - 1.5,

2.1, 2.2

Tuesday,
January 23

Logic and Sets I

[PDF]

[PPTX]

Thursday,
January 25

Logic and Sets II

[PDF]

[PPTX]

2

Functions and Sequences

4th Edition:

1.6 - 1.8

5th Edition:

1.8, 2.2, 3.2

6th Edition:

2.3, 2.4, 3.2

7th Edition:

2.3, 2.4

Tuesday,
January 30

Functions and Sequences I

[PDF]

[PPTX]

Thursday,
February 1

Functions and Sequences II

[PDF]

[PPTX]

3

Algorithms

4th Edition:

2.1 - 2.3

5th Edition:

2.1, 2.3, 2.4

6th Edition:

3.1, 3.3, 3.4

7th Edition:

3.1 - 3.3

Tuesday,
February 6

Algorithms

[PDF]

[PPTX]

Thursday,
February 8

Integers and Algorithms

[PDF]

[PPTX]

4

Applications of Number Theory

4th Edition:

2.4, 2.5

5th Edition:

2.5, 2.6

6th Edition:

3.6, 3.7

7th Edition:

4.1 - 4.3

Tuesday,
February 13

Number Theory I

[PDF]

[PPTX]

Thursday,
February 15

Number Theory II

[PDF]

[PPTX]

5

Mathematical Reasoning

4th Edition:

3.1 - 3.5

5th Edition:

3.1 - 3.6

6th Edition:

1.6, 4.1, 4.3, 4.4

7th Edition:

1.6, 1.7, 5.1 - 5.3

Tuesday,
February 20

Mathematical Reasoning I

[PDF]

[PPTX]

Thursday,
February 22

Mathematical Reasoning II

[PDF]

[PPTX]

6

Counting

4th Edition:

4.1 - 4.3

5th Edition:

4.1 - 4.3

6th Edition

5.1 - 5.3

7th Edition

6.1- 6.4

Tuesday,
February 27

Basics of Counting

[PDF]

[PPTX]

Thursday,
March 1

Permutations and
Combinations

[PDF]

[PPTX]

7

Probability

4th Edition:

4.4 - 4.5

5th Edition:

5.1 - 5.3

6th Edition:

6.1, 6.2, 6.4

7th Edition:

7.1 - 7.4

Tuesday,
March 6

Probability Theory I

[PDF]

[PPTX]

Thursday,
March 8

Probability Theory II

8

Spring Break!

Tuesday,
March 13

No Class!

Thursday,
March 15

No Class!

9

Midterm Week

Tuesday,
March 20

Review, Practice Exam

Thursday,
March 22

Midterm Exam

10

4th Edition:

5.1 - 5.3

5th Edition:

6.1 - 6.3

6th Edition:

7.1 - 7.3

7th Edition:

8.1 - 8.3, 8.5

Tuesday,
March 27

[PDF]

[PPTX]

Thursday,
March 29

[PDF]

[PPTX]

11

Introduction to Relations

4th Edition:

6.1 - 6.4

5th Edition:

7.1 - 7.4

6th Edition:

8.1 - 8.4

7th Edition:

9.1 - 9.4

Tuesday,
April 3

Relations I

[PDF]

[PPTX]

Thursday,
April 5

Relations II

12

Equivalence Relations

4th Edition:

6.5 - 6.6

5th Edition:

7.5 - 7.6

6th Edition:

8.5 - 8.6

7th Edition:

9.5 - 9.6

Tuesday,
April 10

Equivalence Relations I

[PDF]

[PPTX]

Thursday,
April 12

Equivalence Relations II

[PDF]

[PPTX]

13

Graphs

4th Edition:

7.1 - 7.4, 7.6

5th Edition:

8.1 - 8.4, 8.6

6th Edition:

9.1 - 9.4, 9.6

7th Edition:

10.1 - 10.4, 10.6

Tuesday,
April 17

Graphs I

[PDF]

[PPTX]

Thursday,
April 19

Graphs II

[PDF]

[PPTX]

14

Trees

4th Edition:

8.1 - 8.6

5th Edition:

9.1 - 9.5

6th Edition

10.1- 10.5

7th Edition

11.1- 11.5

Tuesday,
April 24

Trees I

[PDF]

[PPTX]

Thursday,
April 26

Trees II

[PDF]

[PPTX]

15

Boolean Algebra

4th Edition:

9.1 - 9.3

5th Edition:

10.1 - 10.3

6th Edition

11.1- 11.3

7th Edition

12.1- 12.3

Tuesday,
May 1

Trees III

[PDF]

[PPTX]

Thursday,
May 3

Boolean Algebra

[PDF]

[PPTX]

16 Final Exam Review

Tuesday,
May 8

Review of the Course,
Practice Exam

17

Final Exam

Some day
between
May 12 and 18

Final Exam

Accommodations:  Section 504 of the Americans with Disabilities Act of 1990 offers guidelines for curriculum modifications and adaptations for students with documented disabilities. If applicable, students may obtain adaptation recommendations from the Ross Center for Disability Services, Campus Center, UL Room 211, (617-287-7430). The student must present these recommendations and discuss them with each professor within a reasonable period, preferably by the end of Drop/Add period.

Student Conduct:  Students are required to adhere to the University Policy on Academic Standards and Cheating, to the University Statement on Plagiarism and the Documentation of Written Work, and to the Code of Student Conduct as delineated in the catalog of Undergraduate Programs. The Code is available online at: http://www.umb.edu/life_on_campus/policies/code/