Chengjiang Long 龙成江

ICEN/ICSI-210: Discrete Structures

Term: 2018 Fall

Instructor: Dr. Chengjiang Long

Email: clong2@albany.edu

Time: Monday, Wednesday and Friday, 9:20am – 10:15am

Building/Room: Lecture Center 25, University at Albany, SUNY

Office Hour: Friday 10:30 am - 12:00 pm at UAB 412 B (by appointment)

TA Office Hour: Thursday 12:00-3:00 pm at UAB 412 E

Teaching Assistant: Sourav Dutta (sdutta2@albany.edu)

Student Assistant: Jonathan P Mulhern (jmulhern@albany.edu) and Prachi D Vachhani (pvachhani@albany.edu)

Course Website: www.chengjianglong.com/teaching_UAlbanyDS.html

Course Overview

The course is to introduce students to the techniques that may be used and enhanced later in professions related to Computer Science. Computer Science specialists could choose a career of developer, analyst, manager, etc. It is important for all of them to understand or to create formal (most often mathematical) description of the problem to be solved. This course covers a wide range of different aspects of discrete mathematics that are applicable to solving programming problems: proofs by induction; mathematical reasoning, propositions, predicates and quantifiers; sets; relations, graphs, and trees; functions; counting, permutations and combinations.

Prerequisites

Students should have a fundamental understanding of mathematical reasoning as well as be competent in solving applied algebra problems. The most important prerequisites are interest in the subject, willingness to dedicate necessary resources in terms of time and intellectual effort, and willingness to actively participate in the learning process. No programming skills are required to pass the course.

Text Books

Kenneth Rosen, Discrete Mathematics and Its Applications, 7th Edition, McGraw Hill, 2012.

Grading

The students will be graded based on course/discussion participation (10%), homework assignments (40%), two midterm exams (20%), one final exam (30%).

Final grade: A(>=92), A-(>=90), B+(>=87), B(>=82), B-(>=80), C+(>=77), C(>=72), C-(>=70), D+(>=67), D(>=62), D-(>=60) and F(<60).

Late Submission Policy

Exponential penalty -- late for one day loses half, two day loses another half of the remaining, and so on and so forth.

Topics

• Introduction to Discrete Structures
• Logic Inference, Predicates, Qualifiers
• Boolean Algebra, Logic Gates, Logic Minimization
• Sets, Functions, Sequences, Sums, Matrices, Matrix Algebra
• Algorithms, Searching, Sorting, Complexity of Algorithms
• Number Theory, Cryptography, Modular Arithmetic
• Induction and Recursion
• Counting
• Relations
• Graphs
• Trees

Course Schedule