Section outline

  • Highlights from the syllabus


    Requirements and grading:

    1.Attendance 5%

    Participation and contributions to class discussions is part of the attendance evaluation.

    2.Quizzes 10%

    The quizzes are taken during some lectures. They would not be announced in advance. All the quizzes will be graded.

    3.Assignments 10%

    There are approximately 10 assignments that introduce recommended questions/problems to solve by students among which maximum 8 questions/problems in each assignment are marked as required so that the students need to submit their solutions for them. At least one problem in each assignment will be graded. The question(s) to be graded will be chosen by the instructors before handing out the assignments, but will remain secret until the due date.

    4.Three partial exams 15% each (45% total)

    5.Final Exam: 30%

    Time table:

    Lecture

    Number 

    TOPIC

    Sections in

    Textbook

     

    CHAPTER 1

     

    1-2

    Propositional Logic and applications

    1.1, 1.2

    3

    Propositional Equivalences

    1.3

    4

    Predicates and Quantifiers

    1.4

    5

    Nested Quantifiers

    1.5

    6-7

    Mathematical Proof Techniques

    1.6-1.8

    CHAPTER 2

    8-9

    Sets, Set Operations

    2.1-2.2

    10-11

    Functions

    2.3

    12

    Sequences, Summations

    2.4

    Exam1

    CHAPTER 3

    13-14

    Algorithms & Complexity

    3.1-3.3

    CHAPTER 4

    15

    Divisibilty & Modular Arithmatic

    4.1

    16

    Primes andGreatest Common Divisors

    4.3

    CHAPTER 5

    17-18

    Mathematical Induction

    5.1-5.2

    19-20

    Structural Induction

    5.3

    21-22

    Recursive Algorithms

    5.4

                                                  Exam 2

    CHAPTER 6

    23

    Counting Basics

    6.1-6.2

    24

    Permutation & Combinations

    6.3

    CHAPTER 8

    25

    Recurrence Relations

    8.1-8.2

    26

    Inclusion Exclusion

    8.5

    CHAPTER 9

    27

    Relations and Their Properties

    9.1, 9.3

    28

    Equivalence Relations

    9.5

                                             Exam 3                                        

    CHAPTER 10

    29

    Graphs Basics

    10.1-10.3

    30

    Connectivity and Path Problems

    10.4-10.6