(1) The document discusses binary relations and concepts such as ordered pairs, reflexive relations, symmetric relations, inverse relations, and representing relations using matrices.
(2) It also covers topics like equivalence relations, equivalence classes, and partitioning a set based on an equivalence relation.
(3) Examples are provided to illustrate key concepts like inverse relations, representing relations as directed graphs, and determining equivalence classes.
The document defines basic set theory concepts and operations such as sets, subsets, union, intersection, complement and Venn diagrams. It provides examples to illustrate set equality, subset, union, intersection and complement relationships. Formulas for calculating set sizes and operations on multiple sets are also presented.
This document outlines the details of a course on fundamentals of computing including:
1) The course is held on Mondays from 8-10am and 11am-1pm in room 9-307.
2) The course covers discrete computing theory, probability, statistics and their implementation and applications in computer science.
3) Assessment is based on exams, assignments, and a final project with exams accounting for 30% of the grade and the final project accounting for 40% of the grade.