Discrete mathematics

Part 10 – Discrete mathematics for computer science – Equivalence relation and it’s use. [fvplayer id=”241″] Equivalence Relation in Discrete Mathematics An equivalence relation is a relation that satisfies three key properties: Reflexivity: aRaaRaaRa for all aaa in set AAA. Symmetry: If aRbaRbaRb, then bRabRabRa. Transitivity: If aRbaRbaRb and bRcbRcbRc, then aRcaRcaRc. Example of Equivalence […]

Discrete Mathematics previous year-GATE 2025 Equivalence relation Let R and S be any two equivalence In the context of GATE (Graduate Aptitude Test in Engineering) examinations, understanding the properties of equivalence relations is crucial. An equivalence relation on a set AAA is a relation that is reflexive, symmetric, and transitive. Key Properties of Equivalence Relations: […]

Day 07Part 04 – Discrete Mathematics for Gate 2025 Bipartite graph and it’s Concept. [fvplayer id=”165″] Here’s a clear and concise explanation of the Bipartite Graph concept from Discrete Mathematics, tailored for GATE 2025 preparation (Day 07, Part 04): 📘 Day 07 Part 04 – Discrete Mathematics for GATE 2025 🧮 Topic: Bipartite Graph and […]

Previous year gate question paper discrete mathematics- GATE 2025 lattices [fvplayer id=”214″] GATE CSE/IT परीक्षा में लैटिस (Lattice) विषय से संबंधित प्रश्न अक्सर पूछे जाते हैं, विशेषकर Discrete Mathematics खंड में। यहाँ कुछ महत्वपूर्ण प्रश्नों और संसाधनों की जानकारी दी जा रही है जो आपकी तैयारी में सहायक हो सकते हैं: 📘 GATE CSE 2015 […]

Day 04Part 06- Discrete mathematics for computer science – Dis-junction Operator of proposition. [fvplayer id=”209″] Disjunction Operator (∨) in Propositional Logic – Discrete Mathematics for Computer Science In propositional logic, the disjunction operator (∨) represents the logical “OR” operation. It is used to form compound statements that are true if at least one of the […]

Day 03Part 06-Discrete Mathematics in Hindi-Concept of maximal and minimal with maximum and minimum. [fvplayer id=”225″] ​डिस्क्रीट गणित में, मैक्सिमल (सर्वोच्च) और मिनिमल (न्यूनतम) तत्वों की अवधारणा आंशिक क्रमित समुच्चयों (partially ordered sets) में महत्वपूर्ण भूमिका निभाती है। इन अवधारणाओं को समझने के लिए, हमें पहले आंशिक क्रम और आंशिक क्रमित समुच्चय की समझ होनी […]

Previous year gate question and answer of Discrete in Hindi -GATE 1995 The number of elements [fvplayer id=”269″] GATE 1995 – डिस्क्रीट मैथ्स का प्रश्न और समाधान (हिंदी में): प्रश्न:एक सेट में कुल तत्वों की संख्या कितनी होगी यदि सेट A = {1, 2, 3, 4} और सेट B = {a, b}? सेट A × […]

Previous year gate question in Hindi – GATE 2025  Set theory For a set A the power [fvplayer id=”264″] यहाँ एक GATE CSE 2025 का सेट थ्योरी पर आधारित प्रश्न है, जो पावर सेट की अवधारणा से संबंधित है: 🧾 प्रश्न: For a set A, the power set of A is denoted by 2^A. If […]

Equivalence concept- GATE 2025 Discrete mathematics previous year paper in Hindi [fvplayer id=”179″] तुल्यता (Equivalence) तार्किक गणित में एक महत्वपूर्ण अवधारणा है, जो दो कथनों या सूत्रों के समान सत्य-मूल्य को निरूपित करती है। यदि दो तार्किक कथन सभी संभावित स्थितियों में समान सत्य-मूल्य रखते हैं, तो वे तुल्य कहलाते हैं। उदाहरण के लिए, कथन […]

Day 06Part 05- Discrete Mathematics for gate computer science – Special Properties of group. [fvplayer id=”169″] ​In Discrete Mathematics, particularly within the context of GATE Computer Science preparation, understanding the special properties of groups is essential. A group is a set combined with a binary operation that satisfies four fundamental properties: closure, associativity, identity, and […]

Day 03Part 13-Example based on lattice in discrete mathematics with all the basic concept. [fvplayer id=”218″]  Examples Based on Lattice in Discrete Mathematics  Recap: What is a Lattice? A lattice is a partially ordered set (poset) (L, ≤) where every pair of elements has:1️⃣ Least Upper Bound (LUB) → Join ( ∨ )2️⃣ Greatest Lower […]

Day 05Part 02- Discrete mathematics for gate in Hindi-Type of quantifiers of predicate logic. [fvplayer id=”207″] यहाँ पर Discrete Mathematics (GATE के लिए) के अंतर्गत Predicate Logic के Quantifiers का सरल और संपूर्ण हिंदी में विवरण दिया गया है: 📘 Day 05 Part 02 – Predicate Logic के Quantifiers (Hindi में) 🔹 Quantifiers क्या होते […]

Day 03Part 10- Discrete mathematics – Introduction of Lattices and and it’s type in Very easy ways. [fvplayer id=”221″]  Day 03 | Part 10 – Discrete Mathematics  Introduction to Lattices & Their Types (Easy Explanation)  What is a Lattice? A Lattice is a type of algebraic structure in Discrete Mathematics that helps in organizing elements […]

Day 03part 14-discrete mathematics for computer science-Principle of Duality and it’s basic concept. [fvplayer id=”217″] Principle of Duality in Discrete Mathematics  What is the Principle of Duality? The Principle of Duality states that every Boolean algebraic expression has a dual expression, which is obtained by interchanging AND (⋅) and OR (+) operators, and swapping 0s […]

Day 03Part 15-Discrete mathematics for computer science-Properties of lattices with example. [fvplayer id=”216″] Here is a concise overview of lattices in discrete mathematics, focusing on their properties with examples, suitable for GATE CSE/IT preparation: 📘 What is a Lattice? A lattice is a partially ordered set (POSET) in which every pair of elements has both: […]

Day 06Part 04 – Discrete Mathematics – Groupoid , Semi group , monoid , Group and abelian group [fvplayer id=”173″]  Discrete Mathematics – Groupoid, Semigroup, Monoid, Group & Abelian Group In Discrete Mathematics & Abstract Algebra, different algebraic structures help in understanding mathematical operations and their properties. Let’s go step by step!  Groupoid A groupoid […]

Day 04Part 11- discrete mathematics book for computer science- Precedence of logical operator. [fvplayer id=”202″]  Precedence of Logical Operators in Discrete Mathematics Logical operators in Discrete Mathematics follow a specific order of precedence, similar to arithmetic operators in algebra. Understanding their precedence is crucial in Boolean algebra, logic circuits, and programming.  Logical Operators & Their […]

Day 04Part16(B) – Propositional logic in discrete mathematics – Statements and arguments concept. [fvplayer id=”193″]  Propositional Logic in Discrete Mathematics – Statements & Arguments Propositional Logic is a branch of Discrete Mathematics that deals with statements (propositions) and their logical relationships. It helps in mathematical reasoning, computer science, and logic circuits.  1. What is a […]

Day 02-Discrete mathematics for computer science in Hindi – Type of Relation with basic concept [fvplayer id=”258″] बिलकुल! यह है Day 02 का पूरा नोट्स और समझाया हुआ भाग —Discrete Mathematics for Computer Science (CSE/IT) in Hindi 🔹 टॉपिक: Types of Relations (संबंध के प्रकार) और उसका बेसिक कॉन्सेप्ट 📘 रिलेशन (Relation) क्या होता है? […]

Previous year gate question paper Discrete Mathematics – GATE 2025 – which one of the following. [fvplayer id=”191″] ​Practicing previous years’ GATE questions in Discrete Mathematics is crucial for understanding the exam pattern and enhancing problem-solving skills. Several resources offer compilations of these questions:​ GeeksforGeeks provides a collection of topic-wise previous year questions with detailed […]