Education and Career Forum

Information Technology is a course which explores into the basic technology that helps the conveyance of information through different systems and networks. There are different intricate levels of topics taught through special papers within this course. One of them being Discrete Structures which refer to basically data structures that work through connection and links at different levels. The reason they are called discrete is because they do not come in a continuous link and structural pattern. Represented by integers numerically, these might be studied in both their finite and infinite forms. Some of the topics taught under this are recognizing the reflexive, symmetrical, asymmetrical, transitive, equivalence relation, One to one function, Onto function, Identity function, invertible function, determination of different relations as reflexive or irreflexive, finding the matrix of transitive closure using Warshall’s Algorithm, Hasse diagram, Euler’s formula for a connected plane graph, Hamilonian formula, Kruskal’s algorithm for finding a minimum weight spanning tree for an edge weighted graph. The paper has 12 questions but you have to answer only 50% of them by selecting one questions from a pair of question like any one from question 1 and2 and so on.

If R is a relation %u201CLess Than%u201D from A = {1,2,3,4} to B = {1,3,5} then RoR-1 is