Dphn 142 May 2026

Based on the code DPHN 142 , this refers to a specific previous question paper from the Indira Gandhi National Open University (IGNOU) for the course Discrete Mathematics . Here is a helpful guide and breakdown of the key concepts typically covered in this paper (Discrete Mathematics) to assist you in your preparation. Course Context

Course Code: DPHN-142 (Discrete Mathematics) Level: Diploma in Computer Applications / Bachelor’s Degree Programs. Focus: The course deals with mathematical structures that are fundamentally discrete, rather than continuous. It is the backbone of computer science logic.

Key Topics & Quick Revision Notes To solve DPHN 142 effectively, focus on these four major pillars: 1. Set Theory & Logic

Set Operations: Understand Union, Intersection, Difference, and Complement. dphn 142

Tip: Remember De Morgan’s Laws :

$(A \cup B)' = A' \cap B'$ $(A \cap B)' = A' \cup B'$

Relations: Know the definitions of Reflexive, Symmetric, Transitive, and Equivalence relations. Based on the code DPHN 142 , this

Equivalence Relation: Must satisfy all three properties above.

Functions: Know the difference between One-to-One (Injective), Onto (Surjective), and Bijective.

2. Combinatorics (Counting)

Permutations ($P(n,r)$): Order matters. (e.g., arranging books on a shelf).

Formula: $P(n, r) = \frac{n!}{(n-r)!}$