CSE 261 Discrete Structures Total Credits (3)

Instructors:

Xiaolei Huang, Shahida Parvez (Spring 2016)

Current Catalog Description

Topics in discrete structures chosen for their applicability to computer science and engineering. Sets, propositions, induction, recursion, combinatorics; binary relations and functions; ordering, lattices and Boolean algebra; graphs and trees; groups and homomorphisms. Various applications. Prerequisite:MATH 21 or MATH 31 or MATH 51 or MATH 76

Textbook

Kenneth H. Rosen, "Discrete Mathematics and its Applications", 7th Ed., McGraw-Hill, 2011, ISBN 978-0073383095

COURSE OUTCOMES:

Students will:

  1.  Know how to think logically and mathematically
  2.  Have the ability to construct formal proofs in propositional and predicate logic
  3.  Have the ability to judge the validity of arguments
  4.  Have the ability to construct algorithms
  5.  Have the ability to assess the complexity of algoithms
  6.  Have the ability to use abstract structures to represent discrete objects and their interrelationships
  7.  Have the abiltiy to model using sets, functions, relations, trees, and graphs.

RELATIONSHIP BETWEEN COURSE OUTCOMES AND STUDENT ENABLED CHARACTERISTICS:

CSE 261 substantially supports the following student enabled characteristics:

A. An abiltiy to apply knowledge of computing and mathematics appropriate to the discipline

Prerequisites by Topic:

  • Math 21/ Calculus 1
  • Functions and graphs
  • Limits and continuity
  • Derivative, differential, and applications
  • Indefinite and definite integrals
  • Trigonometric, logarithmic, exponential, and hyperbolic functions
  • Growth and decay

Major Topics Covered in the Course

  1. Propositional Logic
  2. Logical Equivalences
  3. Quantifiers and Predicate Logic
  4.  Rules of Inference
  5. Varieties of Formal Proofs
  6. Proof Methods and Strategies
  7.  Sets and Set Operations
  8.  Functions
  9. Sequences
  10. Summations
  11. Matrices
  12.  Algorithms
  13.  Growth of Functions -Big O, Big Omega, Big Theta
  14.  Complexity of Algorithms
  15.  Integers and Division
  16.  Prime Numbers and Euclidean Algorithm for GCD
  17.  Applications of Number Theory
  18. Emnumerations
  19. Permutations and combinations
  20.  Mathematical Induction
  21.  Recursive Definitions and Algorithms
  22.  Relations and their Properties
  23.  Graphs
  24.  Trees

Assessment Plan for the Course

The students are given 10 medium-length homework assignments, two one-hour and fifteen minute tests, and a three-hour final examination. Each homework assignment typically covers two topics, and each test has seven questions. The final examination typically has eighteen questions and covers the whole range of topics. The performance of each student on each assignment and test and the final is rigorously tracked. Mean scores are computed for each assignment.

How Data in the Course are Used to Assess Program Outcomes:(unless adequately already in the assessment discussion under Criterion 4)

Each semester I include the above data from the assessment plan for the course in my self-assessment of the course. This report is reviewed by the Curriculum Committee of the CSE Department.

© 2014-2016 Computer Science and Engineering, P.C. Rossin College of Engineering & Applied Science, Lehigh University, Bethlehem PA 18015.