Discrete mathematics

previous year question papers gate in Hindi – GATE 1998 Relation The binary relation R. [fvplayer id=”236″] GATE CSE 1998 के प्रश्नपत्र में एक महत्वपूर्ण प्रश्न था जो बाइनरी रिलेशन (Binary Relation) पर आधारित था। यह प्रश्न सेट थ्योरी और एल्जेब्रा (Set Theory & Algebra) के अंतर्गत आता है। 🧾 प्रश्न विवरण: प्रश्न: सेट A={1,2,3,4}A […]

Previous year gate question paper in Hindi-GATE 2025 Reflexive Relation Mr. X claims the following. [fvplayer id=”235″] GATE CSE 1999 के प्रश्नपत्र में एक महत्वपूर्ण प्रश्न था जो संबंधों (Relations) की गुणात्मक विशेषताओं पर आधारित था, विशेष रूप से रिफ्लेक्सिव (Reflexive), सिमेट्रिक (Symmetric), और ट्रांजिटिव (Transitive) गुणों के संदर्भ में। 📝 प्रश्न विवरण: (a) Mr. […]

Discrete Mathematics previous year-GATE 2025 Equivalence relation Let R and S be any two equivalence. [fvplayer id=”232″] It looks like you are looking for Discrete Mathematics – Equivalence Relations – Previous Year GATE Questions related to GATE 2025. Here’s a conceptual breakdown along with a sample problem:  Equivalence Relation – Definition A relation R on […]

Previous Year gate questions in Hindi- Discrete mathematics-GATE 20259- Consider the well formed [fvplayer id=”188″] आपने GATE 2025 के Discrete Mathematics विषय में Well-formed Formulas (WFFs) से संबंधित प्रश्नों के बारे में जानकारी मांगी है। चूंकि GATE 2025 की परीक्षा हाल ही में फरवरी 2025 में आयोजित हुई है, इसलिए आधिकारिक प्रश्न पत्र और उनकी […]

Tautology Concept- GATE 2025- Previous year paper discrete mathematics consider the following [fvplayer id=”182″] A tautology in propositional logic is a formula that is true in every possible interpretation, meaning it always evaluates to true regardless of the truth values of its constituent propositions. For example, the statement P∨¬PP \vee \neg PP∨¬P (where ∨\vee∨ denotes […]

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

Day 05Part 03- Discrete Mathematics for computer science- Nested Quantifiers and its Application [fvplayer id=”162″]  Day 05 | Part 03 – Discrete Mathematics for Computer Science Nested Quantifiers and Its Applications In Discrete Mathematics, quantifiers are used to express logical statements involving variables. When one quantifier is inside the scope of another quantifier, we call […]

Day 03Part 04- Discrete mathematics – Short trick method for solving Nested Quantifiers problems. [fvplayer id=”161″]  Day 03 | Part 04 – Discrete Mathematics Short Trick Methods for Solving Nested Quantifiers Problems Nested quantifiers can be tricky, but with some simple techniques, you can solve them quickly and accurately. Let’s go through some short tricks […]

Day 06Part 03- Binary Operation CAIIC Axioms Closer Associative Identity Inverse and Commutative. [fvplayer id=”174″] Let’s break down Day 06 Part 03: Binary Operation – CAIIC Axioms step by step. The acronym CAIIC stands for: Closure Associative Identity Inverse Commutative These are axioms (rules) used to describe binary operations on a set, such as addition, […]

Previous year gate question of discrete mathematics in Hindi – GATE 2025 A relation R is defined [fvplayer id=”212″] यहाँ GATE परीक्षा में “Relation R is defined…” से संबंधित कुछ महत्वपूर्ण प्रश्नों का हिंदी में विवरण और विश्लेषण प्रस्तुत किया गया है: 🧮 प्रश्न 1: GATE CSE 2025 प्रश्न: एक संबंध R को पूर्णांकों के […]

Previous year gate question of Discrete in Hindi – GATE 1993 Set theory  Let S be an infinite se [fvplayer id=”271″] यह प्रश्न GATE CSE 1993 के सेट थ्योरी अनुभाग से लिया गया है: ❓ प्रश्न (GATE 1993): मान लीजिए कि SS एक अनंत समुच्चय है और S1,S2,…,SnS_1, S_2, …, S_n ऐसे समुच्चय हैं कि: […]

Day 01- Discrete Mathematics for gate in Hindi CSEIT- Concept of Universal set and Complement of set [fvplayer id=”275″] Day 01: डिस्क्रीट मैथमेटिक्स (Discrete Mathematics) – यूनिवर्सल सेट और कम्प्लीमेंट ऑफ़ सेट यह टॉपिक GATE (CSE/IT) के लिए बहुत महत्वपूर्ण है, क्योंकि सेट थ्योरी (Set Theory) से अक्सर प्रश्न पूछे जाते हैं।  यूनिवर्सल सेट (Universal […]

Day 06Part 08- Discrete mathematics for gate in Hindi- Cube root and Fourth root of unity. [fvplayer id=”166″]  डिस्क्रीट मैथमेटिक्स (Discrete Mathematics) – Cube Root और Fourth Root of Unity (GATE के लिए)  यूनिटी के मूल (Roots of Unity) क्या होते हैं? ➡️ Roots of Unity वे संख्याएँ होती हैं, जिनका कोई घात (Power) लेने […]

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 04Part12-Concept of tautology contradiction and Contigency, Satisfiable and Unsatisfiable case. [fvplayer id=”201″] Day 04 – Part 12: Concept of Tautology, Contradiction, and Contingency In Discrete Mathematics and Logic, statements can be categorized based on their truth values in all possible scenarios. The key concepts are Tautology, Contradiction, and Contingency, along with Satisfiable and Unsatisfiable […]

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) […]

Previous year gate question of Discrete in Hindi – GATE 199 Let A be a finite set of size n. [fvplayer id=”270″]  GATE 1993 | Discrete Mathematics Previous Year Question in Hindi प्रश्न:मान लीजिए कि AAA एक परिमित समुच्चय (Finite Set) है जिसकी आकार (Size) nnn है।इस समुच्चय के Power Set (पॉवर सेट) में कुल […]

Day 04Part 15(B) – Discrete Mathematics – Methods of solving Statements and boolean expressions. [fvplayer id=”195″] Discrete Mathematics – Methods of Solving Statements and Boolean Expressions In Discrete Mathematics, logical statements and Boolean expressions are fundamental concepts used in propositional logic, set theory, and digital logic design. Let’s explore different methods to solve them. 1. […]