Free PDF Source
Free PDF Source
Day 01 – Discrete mathematics for computer science in Hindi For CSEIT – Power Set with application. [fvplayer id=”272″] Discrete Mathematics for Computer Science – Power Set & Its Applications Topic: Power Set Subject: Discrete Mathematics Useful For: CSE / IT / GATE / Competitive Exams What is a Power Set? A Power Set (P(S)) of a […]
Discrete mathematics for gate- Relation b/w Vertices and Edges in Simple graph [fvplayer id=”160″] Discrete Mathematics for GATE – Relationship Between Vertices and Edges in a Simple Graph In graph theory, a simple graph is an unweighted, undirected graph that does not contain multiple edges or self-loops. The relationship between vertices (V) and edges (E) […]
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. […]
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” अगर राम और श्याम दोस्त […]
Day 03Part 04- Discrete mathematics for computer science in hindi- Example on Hasse Diagram. [fvplayer id=”227″] Day 03 | Part 04 – डिस्क्रीट मैथमेटिक्स (Discrete Mathematics) for Computer Science Hasse Diagram का उदाहरण (Example on Hasse Diagram) Hasse Diagram क्या है? Hasse Diagram एक ग्राफिकल रिप्रेजेंटेशन है जो किसी Partially Ordered Set (Poset) को दिखाने […]
Day 03Part 05- Discrete mathematics for computer science – Finding Relation from Hasse Diagram. [fvplayer id=”226″] Discrete Mathematics – Finding Relations from Hasse Diagram What is a Hasse Diagram? A Hasse Diagram is a graphical representation of a partially ordered set (poset). It simplifies the relation by removing self-loops, transitive edges, and directions. Key Components […]
Day 04 Part 01- Discrete Mathematics for gate in Hindi-Proposition and it’s application [fvplayer id=”255″] Proposition and Its Applications (Discrete Mathematics for GATE – Day 04, Part 01) 1. What is a Proposition? A proposition is a declarative statement that is either true (T) or false (F) but not both simultaneously. Examples: “The sun rises in […]
Day 04 part 03 – Discrete mathematics for gate in Hindi- Atomic and Compound Proposition. [fvplayer id=”254″] It looks like you’re looking for an explanation of Atomic and Compound Propositions in Discrete Mathematics for GATE in Hindi. Here’s a clear and simple explanation: 1. परमाणवीय (Atomic) और मिश्रित (Compound) प्रस्ताव क्या हैं? (A) परमाणवीय प्रस्ताव […]
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 […]
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 […]
Day 06Part 06- Discrete mathematics – Trick for finding of group theory of infinite numbers. [fvplayer id=”167″] Trick for Finding Group Theory of Infinite Numbers – Discrete Mathematics Group Theory is a fundamental topic in Discrete Mathematics that deals with sets and operations satisfying specific properties. When working with infinite groups, understanding how to identify […]
Day 07Part 05- Discrete mathematics Graph Theory-Concept of Complete bipartite graph [fvplayer id=”164″] Complete Bipartite Graph in Discrete Mathematics (Graph Theory – Day 07, Part 05) What is a Bipartite Graph? A bipartite graph is a type of graph G = (V, E) where: The set of vertices V is divided into two disjoint sets […]
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, […]
Day 07Part 02- Discrete- Parallel edge and Self loop , Simple graph , Multi graph , Pseudo graph. [fvplayer id=”171″] Parallel Edge, Self Loop, Simple Graph, Multigraph, and Pseudograph in Discrete Mathematics Graphs are fundamental structures in Discrete Mathematics and Computer Science, used to model relationships between objects. Let’s explore different types of graphs and […]
Previous year question and answer in Hindi – GATE 2025 Set Theory The cardinality of the power set. [fvplayer id=”263″] GATE परीक्षा की तैयारी में पिछले वर्षों के प्रश्न पत्रों का अभ्यास अत्यंत महत्वपूर्ण है, क्योंकि यह परीक्षा के पैटर्न और प्रश्नों के प्रकार को समझने में सहायता करता है। विशेष रूप से, सेट थ्योरी […]
Day 04Part 16(A) – Propositional logic in discrete mathematics in Hindi – Statements and Arguments. [fvplayer id=”194″] Here is a clear and concise explanation of Propositional Logic (Part 16A, Day 04) from Discrete Mathematics, focusing on Statements and Arguments, explained in Hindi for easy understanding. 📚 Day 04 – Part 16(A): Propositional Logic in Discrete […]
Part 01-Discrete mathematics for gate-Partial Order Relations and it’s matrix representation [fvplayer id=”250″] Partial Order Relations and Its Matrix Representation (Discrete Mathematics for GATE) 1. Introduction to Partial Order RelationsA partial order relation (poset) is a binary relation RRR on a set SSS that satisfies the following properties: Reflexivity: aRaaRaaRa for all a∈Sa \in Sa∈S […]
Discrete Mathematics books for computer science gate. [fvplayer id=”249″] Here’s a list of the best Discrete Mathematics books for Computer Science students preparing for GATE (CSE/IT). These books are ideal for concept building, problem-solving, and mastering theory and logic required in competitive exams like GATE, UGC NET, and university exams. 📚 Top Discrete Mathematics Books […]
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 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 […]