MATH-260(b) / 5 credits

Teacher(s): Viazovska Maryna, De Courcy-Ireland Matthew

Language: English


Summary

Study of structures and concepts that do not require the notion of continuity. Graph theory, or study of general countable sets are some of the areas that are covered by discrete mathematics. Emphasis will be laid on structures that the students will see again in their later studies.

Content

Keywords

Combinatorics, graphs, set systems

Learning Prerequisites

Required courses

Linear algebra, Analysis

Learning Outcomes

By the end of the course, the student must be able to:

  • Analyze Analyze discrete structures
  • Formulate Formulate main theorems of the course
  • Solve Solve typical combinatorial problems

Transversal skills

  • Use a work methodology appropriate to the task.

Teaching methods

Ex cathedra lecture with exercises in the classroom.

Expected student activities

Solving homework problems

Assessment methods

Written exam.

Supervision

Office hours Yes
Assistants Yes

In the programs

  • Semester: Spring
  • Exam form: Written (summer session)
  • Subject examined: Discrete mathematics
  • Lecture: 2 Hour(s) per week x 14 weeks
  • Exercises: 2 Hour(s) per week x 14 weeks
  • Semester: Fall
  • Exam form: During the semester (winter session)
  • Subject examined: Discrete mathematics
  • Lecture: 2 Hour(s) per week x 14 weeks
  • Exercises: 2 Hour(s) per week x 14 weeks

Reference week

 MoTuWeThFr
8-9     
9-10     
10-11     
11-12     
12-13     
13-14     
14-15     
15-16     
16-17     
17-18     
18-19     
19-20     
20-21     
21-22