Department: Mathematics
Course: MAT 2440
Title: Discrete Structures and Algorithms I
Description: This course introduces the foundations of discrete mathematics as they apply to computer science, focusing on providing a solid theoretical foundation for further work. Topics include functions, relations, sets, simple proof techniques, Boolean algebra, propositional logic, elementary number theory, writing, analyzing and testing algorithms.
Text: Kenneth H. Rosen, Discrete Mathematics and its Applications , 7th Edition,
Credits: 3 (4 class hours)
Prerequisite: (MAT 1375 or higher) and (CST 1201 or CST 2403)
Course outline prepared by: A. Taraporevala, Fall 2011

Section: D651
Schedule: Tuesdays & Thursdays, 2:15-3:55pm
Classroom: Namm 923
Instructor: Kate Poirier
Office: Namm 707
Office hours: Tuesdays, 11:00am-1:00pm or by appointment

Learning outcomes:

  • Use the rules of logic to understand mathematical statements and prove propositions using
    • A direct proof.
    • An indirect proof.
    • A proof by contradiction.
    • Mathematical induction
  • Write simple algorithms using pseudocode.
  • Perform the following for trees:
    • Traverse trees.
    • Represent an expression using a binary tree and write it in prefix, postfix, and infix notation.
    • Build spanning trees.
  •  Use computer technology to assist in the above

Mathematics Department Policy on Lateness/Absence:
A student may be absent during the semester without penalty for 10% of the class instructional sessions. Therefore, if the class meets 2 times per week, the allowable absence is 3 absences per semester. Students who have been excessively absent and failed the course at the end of the semester will receive either

  • the WU grade if they have attended the course at least once. This includes students who stop attending without officially withdrawing from the course.
  • the WN grade if they have never attended the course.

In credit bearing courses, the WU and WN grades count as an F in the computation of the GPA. The official Mathematics Department policy is that two latenesses (this includes arriving late or leaving early) is equivalent to one absence. Every withdrawal (official or unofficial) can affect a student’s financial aid status, because withdrawal from a course will change the number of credits or equated credits that are counted toward financial aid.

New York City College of Technology Policy on Academic Integrity:
Students and all others who work with information, ideas, texts, images, music, inventions, and other intellectual property owe their audience and sources accuracy and honesty in using, crediting, and citing sources. As a community of intellectual and professional workers, the College recognizes its responsibility for providing instruction in information literacy and academic integrity, offering models of good practice, and responding vigilantly and appropriately to infractions of academic integrity. Accordingly, academic dishonesty is prohibited in The City University of New York and at New York City College of Technology and is punishable by penalties, including failing grades, suspension, and expulsion. The complete text of the College policy on Academic Integrity may be found in the catalog.

Course-specific addendum: Any student suspected of obtaining and/or using the Instructor’s Resource Guide corresponding to the official course textbook  will be referred to the Committee on Academic Integrity and is subject to the strictest punishment allowable according to College guidelines.