Relations | Transitive Closure | Warshell's Algorithm |

Описание: Definition, Binary Relation, Representation, Domain, Range, Universal
Relation, Void Relation, Union, Intersection, and Complement Operations on
Relations, Properties of Binary Relations in a Set: Reflexive, Symmetric, Transitive, Anti-symmetric Relations, Relation Matrix and Graph of a Relation; Partition and Covering of a Set, Equivalence Relation, Equivalence Classes, Compatibility Relation, Maximum Compatibility Block, Composite Relation, Converse of a Relation, Transitive Closure of a Relation R in Set X

Lec Notes: https://drive.google.com/file/d/1L9Po...


#gtu #gtuexam #maths4 #gtumaths4 #Discretemaths #dm #sem4

Course Outcome ##

Understand the basic principles of sets and operations in sets and apply counting principles to determine probabilities, domain and range of a function, identify one-to- one functions, perform the composition of functions and apply the properties of functions to application problems.

Write an argument using logical notation and determine if the argument is or is not valid. To simplify and evaluate basic logic statements including compound statements, implications, inverses, converses, and contra positives using truth tables and the properties of logic. To
express a logic sentence in terms of predicates, quantifiers, and logical connectives.

Apply relations and to determine their properties. Be familiar with recurrence relations

Use the properties of algebraic structures.

Interpret different traversal methods for trees and graphs. Model problems in Computer Science using graphs and trees.