Course Description for MTH1137 Discrete Mathematics I

Student Population: Computer Science 1st year students (required); some Mathematics and Engineering students

Goals: The aim of this course is to introduce the students to the fundamental concepts of mathematics that are required in understanding, designing and analyzing algorithms. These concepts come mainly from Set Theory, Logic, Enumeration, and Number Theory. This course is a prerequisite for MTH1237 (Discrete Mathematics II) and is a useful prelude to Number Theory, Combinatorics/Graph Theory, Probability, Data Structures and Analysis of Algorithms.

Topics:

• Binary and other bases
• Set Theory: Venn diagrams, Cartesian products, Inclusion--Exclusion
• Relations and Functions
• Mathematical Induction
• Permutations, Combinations, Binomial coefficients
• GCD's, Euclidean Algorithm, Congruences
• Introduction to (combinatorial) Graphs
• Sequences and Recurrence relations

  ---

  ---

  Math Department Home Page

  NU Home Page

  Directory

  ---

  Last modified May 13, 1996
  
  ---
  
  Send comments and corrections to: alexsuciu@neu.edu