Course Description

Instructor: Prof. Seth Fogarty Email: sfogarty@trinity.edu

Office: CSI 270M Office Hours: See webpage

Meets: MWF 10:30-11:20 (Section 2) or 11:30-12:20 (Section 3) Classroom: CSI 104

Textbook: Discrete Mathematics and Its Applications, 7th Edition, by Kenneth Rosen.

This is a discrete mathematics course for computer science majors, designed to introduce students to the kind of mathematical thinking employed in computer science. This course covers a variety of topics that can be broadly split into three categories.

Discrete Structures: A variety of discrete structures: the abstract mathematical structures used to represent discrete objects and relationships between these objects. These discrete structures include graphs, sets, tuples, permutations, and sequences.
Formal Logic: An introduction to formal logic, sometimes called the calculus of computer science. Formal logic will be used as an introduction to mathematical reasoning and to elucidate the structure of mathematical arguments.
Combinatorics: The mathematics behind counting and enumerating objects, with an emphasis on performing combinatorial analysis to solve counting problems and analyze algorithms.

Objectives

Discrete mathematics is both fundamental and vast. This course will not be able introduce every area of mathematics necessary for success in computer science. Thus the primary objectives of this course are not to grant students familiarity with a wide variety of topics, but to promote understanding, depth, and mathematical maturity. In specific, the objectives include:

Mathematical Reasoning: Students should be able to comprehend and construct arguments about discrete mathematics. Notably, this includes the science and art of constructing proofs.

Communicating Mathematics: Students should be able to communicate algorithmic and mathematical concepts in a variety of contexts with appropriate levels of formality.

Independent Learning: Students should be able to independently read and absorb the mathematical knowledge required to solve problems in areas of discrete mathematics they are not familiar with.

Honor Code

Students are expected by abide the Trinity University Honor code. Collaboration is explicitly allowed on homework assignments, but must be documented in all submissions. Further, the use of laptops, tablets, or cell phones during class is prohibited. Exceptions for the use of a laptop or during class can be given for compelling reasons.

Attendance Policy

Students are expected to attend class regularly. Students who will miss class should contact me before their absence, and complete all homework assignments ahead of time. Having the camera on during class is highly encouraged, but not required.

Accessibility

In line with the Trinity University policy on equal access and equal opportunity, this course will be made accessible to all students. Any student who feels they may need accommodations based on the impact of a disability or long illness should contact me and the office of Disability Student Services to discuss your specific needs. Any student who feels they may need accommodations due to remote learning, technology, environment, or other issues should contact me.

Report abuse