Skip to the content.

CSE-211

CSE 211 Discrete Mathematics Using Programming Assignments

Homework 1

Mathematical Induction (No Code)

Homework 2

Code contains algorithms that determine if a given relation R is reflexive, symmetric, anti-symmetric or transitive.

Homework 3

Code contains work to draw HASSE diagram after determining if a given relation R is reflexive, symmetric, anti-symmetric or transitive.

Homework 4

Recurrence Relation (No code)