PDF

Free PDF Source

PDF

Free PDF Source

Author : seron

Part 07-Discrete Mathematics for gate- Example based on symmetry anti-symmetry and asymmetry.

Part 07-Discrete Mathematics for gate- Example based on symmetry anti-symmetry and asymmetry. [fvplayer id=”246″] Part 07 – Discrete Mathematics for GATE: Examples on Symmetry, Anti-Symmetry, and Asymmetry 1. Symmetric Relation (सममित संबंध) यदि (a,b)∈R(a, b) \in R(a,b)∈R है, तो (b,a)∈R(b, a) \in R(b,a)∈R भी होना चाहिए। Example 1: “Friendship Relation” अगर राम और श्याम दोस्त […]

Part 08 – discrete mathematics for computer science-Transitive Relation with basic concept.

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

Part 10 – Discrete mathematics for computer science – Equivalence relation and it’s use.

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 Question for gate in Hindi CSEIT – GATE 2025 The binary relation

Discrete Mathematics Question for gate in Hindi CSEIT – GATE 2025 The binary relation [fvplayer id=”234″] यहाँ GATE CSE 2025 के लिए डिस्क्रीट मैथेमेटिक्स में बाइनरी रिलेशन (Binary Relation) पर आधारित कुछ महत्वपूर्ण प्रश्न और उनके समाधान दिए गए हैं, जो हिंदी माध्यम के छात्रों के लिए उपयोगी होंगे। 🧠 बाइनरी रिलेशन की मूल बातें […]

Methods of Algorithm – Independent Experimental.

Methods of Algorithm – Independent Experimental. [fvplayer id=”113″] “Methods of Algorithm – Independent Experimental” एक व्यापक विषय हो सकता है, इसलिए मैं इसे दो मुख्य भागों में स्पष्ट रूप से समझा रहा हूँ: 🧠 I. Algorithm Methods (Types/Approaches of Algorithms) एल्गोरिदम डिज़ाइन के विभिन्न तरीकों (methods) को algorithmic paradigms कहा जाता है। ये सभी problem-solving […]

Discrete Mathematics for Gate in Hindi Introduction of syllabus marks distribution

Discrete Mathematics for Gate in Hindi Introduction of syllabus marks distribution [fvplayer id=”280″]  GATE 2025: Discrete Mathematics Syllabus & Marks Distribution (In Hindi)  विषय: डिस्क्रीट मैथमेटिक्स (Discrete Mathematics) GATE Exam के लिए एक बहुत ही महत्वपूर्ण टॉपिक है, जो कंप्यूटर साइंस और इलेक्ट्रॉनिक्स के स्टूडेंट्स के लिए ज़रूरी होता है। यह विषय लॉजिक, सेट्स, रिलेशन्स, […]

Day 01-Discrete mathematics for computer science in Hindi – Set theory with conceptual understanding.

Day 01-Discrete mathematics for computer science in Hindi – Set theory with conceptual understanding. [fvplayer id=”278″] Day 01: डिस्क्रीट मैथमेटिक्स (Discrete Mathematics) – सेट थ्योरी (Set Theory) का कांसेप्ट डिस्क्रीट मैथमेटिक्स कंप्यूटर साइंस का एक महत्वपूर्ण हिस्सा है, जिसमें सेट थ्योरी (Set Theory) की एक महत्वपूर्ण भूमिका होती है।  सेट (Set) क्या है? सेट समान […]

Day 01-Discrete mathematics for gate in Hindi -Type of sets Roster or Tabular Set-Builder Method

Day 01-Discrete mathematics for gate in Hindi -Type of sets Roster or Tabular Set-Builder Method [fvplayer id=”277″] Day 01 – Discrete Mathematics for GATE (in Hindi)🎯 Topic: Types of Sets – Roster (Tabular) & Set-Builder Method 📘 डिस्क्रीट मैथमेटिक्स GATE के लिए क्यों जरूरी है? Discrete Mathematics GATE CSE में एक महत्वपूर्ण विषय है, खासकर […]

Computer Science/Numerical Methods/ Bisection method example

Computer Science/Numerical Methods/ Bisection method example [fvplayer id=”110″] Bisection Method – Numerical Methods (Computer Science) The Bisection Method is a root-finding technique that applies to continuous functions where the root lies between two given points. It is a simple and reliable method based on the Intermediate Value Theorem.  Algorithm of Bisection Method  Select two points […]

Computer Science/Numerical Methods/ Bisection method ( With complete introduction)

Computer Science/Numerical Methods/ Bisection method ( With complete introduction) [fvplayer id=”107″] Bisection Method in Numerical Methods (Complete Introduction)  What is the Bisection Method? The Bisection Method is a numerical technique used to find the roots of a function f(x) = 0 in a given interval [a, b]. It is based on the Intermediate Value Theorem […]

Day 01- Discrete Mathematics for gate in Hindi CSEIT- Difference b/w Subset and Proper subset.

Day 01- Discrete Mathematics for gate in Hindi CSEIT- Difference b/w Subset and Proper subset. [fvplayer id=”274″] ज़रूर! आइए GATE 2025 के लिए Discrete Mathematics के Day 01 टॉपिक पर चर्चा करते हैं —“Subset और Proper Subset में अंतर (Difference between Subset and Proper Subset)” — हिंदी में। 📚 Day 01 – Discrete Mathematics (CSE/IT) […]

Short trick method for solving propositions argument based problem of discrete mathematics-GATE 2025.

Short trick method for solving propositions argument based problem of discrete mathematics-GATE 2025. [fvplayer id=”185″] Here’s a short-trick method for solving Propositions/Argument-Based Problems in Discrete Mathematics – highly useful for GATE 2025 CSE/IT aspirants. 🧠 Topic: Propositional Logic (Argument Validity) – Shortcut Method 🎯 What is the Goal? You are often asked: “Is this argument […]

New Operator Concept-GATE 2025-Using-Discrete mathematics previous year paper-A binary logic relation

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

Scroll to top