SE 251a/b

Course List Course Info

Discrete Structures for Software Engineers

1999-2000

Objective

This course introduces the necessary mathematical tools necessary for Software Engineering. Topics include logic, sets, and functions, algorithms, mathematical reasoning, counting, relations, graphs, trees, Boolean Algebra and computation modeling.

Contact hours

3 lecture hour per week

Topics

  1. The foundations: logic, sets and functions
  2. The fundamentals: algorithms, the integers and matrices
  3. Mathematical reasoning
  4. Counting
  5. Advanced counting techniques
  6. Relations
  7. Graphs
  8. Trees
  9. Boolean Algebra
  10. Modeling computation

Textbook

Rosen, Kenneth, "Discrete Mathematics and Its Applications" 4th edition, WCB/McGraw-Hill 1999

Evaluation

In order to pas the course, a student must obtain a passing grade in each component. A student who fails any component shall receive a final grade not greater than 48%. The approximate weights for each component in shown below. Note that these are maximums; if less than the stated number is given, the rest of the marks will be pro-rated.

  • 30% written assignments (10)
  • 20% midterm
  • 50% final examination