Discrete mathematics

Previous year gate question in Hindi- GATE 2025 Discrete math-Consider the following hasse diagram [fvplayer id=”210″] GATE परीक्षा में Hasse Diagram से संबंधित प्रश्न अक्सर पूछे जाते हैं, विशेषकर Discrete Mathematics विषय के अंतर्गत। यह विषय Partial Orders, Lattices, और Posets की समझ को परखता है। 🧮 Hasse Diagram क्या होता है? Hasse Diagram एक […]

Day 03Part 08-Discrete mathematics for gate- Concept of Least upper bound and greatest lower bound. [fvplayer id=”223″] Least Upper Bound (LUB) and Greatest Lower Bound (GLB) – Discrete Mathematics (GATE) The concepts of Least Upper Bound (LUB) and Greatest Lower Bound (GLB) are essential in partially ordered sets (posets) in Discrete Mathematics. These are also […]

Day 07Part 01 – Discrete mathematics for Gate in Hindi for CSEIT- An Introduction to Graph Theory. [fvplayer id=”172″] आपके अनुरोध के अनुसार, “Day 07 Part 01 – Discrete Mathematics for GATE in Hindi for CSE/IT: An Introduction to Graph Theory” विषय पर जानकारी प्रस्तुत की जा रही है। 📘 ग्राफ थ्योरी का परिचय (Introduction […]

Day 05Part 01-Discrete mathematics-First order Predicate logic or predicate calculus with example [fvplayer id=”206″] Discrete Mathematics – First Order Predicate Logic (Predicate Calculus) | Day 05 Part 01 What is Predicate Logic? Predicate Logic (also known as First-Order Logic or Predicate Calculus) is an extension of propositional logic. It allows expressions with quantifiers and variables, […]

Day 06Part 02- Discrete Mathematics for Gate Computer – Algebraic Structure and Binary operations. [fvplayer id=”175″] Here’s a detailed learning guide for: 📘 Day 06 Part 02 – Discrete Mathematics for GATE CSE 🔢 Topic: Algebraic Structures & Binary Operations ✅ 1. What is a Binary Operation? A binary operation on a set S is […]

Discrete mathematics previous year paper in Hindi – GATE 2025 – If the proposition. [fvplayer id=”190″] ​GATE (ग्रेजुएट एप्टीट्यूड टेस्ट इन इंजीनियरिंग) की परीक्षा में डिस्क्रीट मैथमेटिक्स एक महत्वपूर्ण विषय है, जिसमें प्रोपोजिशनल लॉजिक (विधेयात्मक तर्क) से संबंधित प्रश्न भी शामिल होते हैं। यदि आप हिंदी में पिछले वर्षों के प्रश्न पत्रों की खोज में […]

Day 03Part 03-Discrete mathematics for gate-How to Convert Partial order Relations to hasse diagram. [fvplayer id=”228″] हासे आरेख (Hasse Diagram) बनाने के लिए आंशिक क्रम संबंधों (Partial Order Relations) को कैसे परिवर्तित किया जाए, इसका चरण-दर-चरण तरीका इस प्रकार है: चरण 1: आंशिक क्रम संबंध (Partial Order Relation) को समझें आंशिक क्रम संबंध एक सेट […]

Equivalence table- Previous year gate question paper in Hindi-Gate 2025- Let P and Q be propositions. [fvplayer id=”192″] ​GATE (ग्रेजुएट एप्टीट्यूड टेस्ट इन इंजीनियरिंग) परीक्षा में डिस्क्रीट मैथमेटिक्स एक महत्वपूर्ण विषय है, जिसमें प्रोपोजिशनल लॉजिक से संबंधित प्रश्न भी शामिल होते हैं। यदि आप हिंदी में पिछले वर्षों के प्रश्न पत्रों की खोज में हैं, […]

Part 11-Discrete mathematics for computer science in Hindi- Equivalence class and partitions. [fvplayer id=”239″] अलगात्मक गणित (Discrete Mathematics) – भाग 11 समानता वर्ग (Equivalence Class) और विभाजन (Partitions) Discrete Mathematics में समानता वर्ग (Equivalence Class) और विभाजन (Partition) महत्वपूर्ण अवधारणाएँ हैं, जो समुच्चय सिद्धांत (Set Theory) और संबंधों (Relations) से संबंधित हैं। 1. समानता संबंध […]

Day 04part 10- Discrete mathematics for gate in Hindi – Bi-conditional or if and only if statements. [fvplayer id=”203″]  Day 04 Part 10 – Discrete Mathematics for GATE in Hindi Bi-Conditional Statements (If and Only If – IFF) | द्वि-शर्तीय कथन Language: HindiTopic: Bi-Conditional StatementsPart: 10Exam Focus: GATE, UGC-NET, PSU Exams  1. Bi-Conditional Statement (IFF) […]

Day 02-Discrete mathematics for gate – Concept of Cartesian product and Introduction of Relation. [fvplayer id=”261″] Here’s a clear explanation of Day 02: Discrete Mathematics for GATE focusing on the Concept of Cartesian Product and an Introduction to Relations, tailored for GATE CSE/IT aspirants. ✅ Bilingual format (English + Hindi) for better understanding. 📘 Day […]

New Operator Concept-GATE 2021-Using-Discrete mathematics previous year paper-A binary logic relation [fvplayer id=”183″] Great! Let’s dive into the “New Operator Concept” from GATE 2025 preparation, particularly in Discrete Mathematics — focused on Binary Logical Relations and Previous Year Paper questions. This is especially important because GATE sometimes introduces custom or new operators in logic questions […]

Part 08 – discrete mathematics for computer science-Transitive Relation with basic concept. [fvplayer id=”243″] Discrete Mathematics for Computer Science  Part 08: Transitive Relation – Basic Concept  What is a Transitive Relation? A relation RRR on a set AAA is called transitive if: ∀a,b,c∈A, if (a,b)∈R and (b,c)∈R, then (a,c)∈R.\forall a, b, c \in A, \text{ if } (a, b) \in R […]

Day 03Part 07-Discretse mathematics for cse-Finding of maxiamal, minimal, maximum, minimum points. [fvplayer id=”224″] Discrete Mathematics for CSE Day 03 – Part 07: Finding Maximal, Minimal, Maximum, and Minimum Points In Discrete Mathematics, finding maximal, minimal, maximum, and minimum points is essential in set theory, lattice theory, and optimization. Let’s break down these concepts: 1. […]

Day 01 – Discrete mathematics for computer science set operation Union Intersection. [fvplayer id=”273″]  Discrete Mathematics for Computer Science – Set Operations (Union & Intersection)  Topic: Set Operations – Union & Intersection Subject: Discrete Mathematics Useful For: CSE / IT / GATE / Competitive Exams  What is a Set? A set is a collection of distinct elements. […]

previous year question papers in Hindi – GATE 2025 Set Theory Suppose U is the power set. [fvplayer id=”262″] यहाँ GATE 2025 की तैयारी के लिए सेट थ्योरी (Set Theory), विशेष रूप से पॉवर सेट (Power Set) से संबंधित पिछले वर्षों के प्रश्नों और संसाधनों की जानकारी दी गई है: 📄 GATE 2025 सेट थ्योरी […]

part 05 – Discrete math for gate in Hindi – Concept of Premise, Conclusion and Argument [fvplayer id=”252″] डिस्क्रीट मैथमेटिक्स में, प्रस्तावना (Premise), निष्कर्ष (Conclusion), और तर्क (Argument) महत्वपूर्ण अवधारणाएँ हैं, जो तार्किक विश्लेषण और प्रमाणन में उपयोगी होती हैं। प्रस्तावना (Premise): प्रस्तावना वह कथन या कथन समूह है, जो किसी तर्क में आधार के […]

Implication Concept Discrete mathematics previous year paper – GATE 2025- The following resolution. [fvplayer id=”186″]  Implication Concept in Discrete Mathematics – GATE 2025  What is an Implication? In propositional logic, an implication is a logical statement of the form: P→QP \rightarrow QP→Q This means “If PPP is true, then QQQ must also be true.” Truth […]

Day 03Part 09-CseIt- Cross structure failure case of greatest lower bound and least upper bound. [fvplayer id=”222″] Day 03 Part 09 – CSE/IT: Cross Structure Failure Cases of Greatest Lower Bound (GLB) and Least Upper Bound (LUB) 🔍 Understanding GLB and LUB in Posets In a partially ordered set (poset), for any two elements aaa […]

previous year question papers gate- GATE 1995-relation-Let R be a symmetric and transitive relation. [fvplayer id=”238″] GATE 1995 – Set Theory & Relations Question Question:Let R be a symmetric and transitive relation on a set A. Then which of the following is always true? (A) R is reflexive(B) R is an equivalence relation(C) R is […]