Free PDF Source
Free PDF Source
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 […]
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 […]
Lamports Mutual exclusion algorithm lamport logical clock program in c [fvplayer id=”87″] Lamport’s Mutual Exclusion Algorithm uses Lamport’s Logical Clocks to order events in a distributed system and ensure mutual exclusion. This algorithm ensures that only one process can access the critical section at a time in a distributed environment. Below is a simplified C […]
Short trick to find the given grammar is (LL1) or not in Compiler Design In Hindi. [fvplayer id=”124″] LL(1) Grammar पहचानने की Short Trick | Compiler Design (in Hindi) LL(1) Grammar एक Top-Down Parsing तकनीक है, जिसमें Left-to-Right scanning और Leftmost derivation का उपयोग किया जाता है, और इसमें 1 Lookahead symbol होता है। Short […]
Day 03Part 06-Discrete Mathematics in Hindi-Concept of maximal and minimal with maximum and minimum. [fvplayer id=”225″] डिस्क्रीट गणित में, मैक्सिमल (सर्वोच्च) और मिनिमल (न्यूनतम) तत्वों की अवधारणा आंशिक क्रमित समुच्चयों (partially ordered sets) में महत्वपूर्ण भूमिका निभाती है। इन अवधारणाओं को समझने के लिए, हमें पहले आंशिक क्रम और आंशिक क्रमित समुच्चय की समझ होनी […]
AAD- Dynamic Programming Introduction and General Method multistage graphs with example Part 15 [fvplayer id=”122″] Dynamic Programming (DP) is a method for solving complex problems by breaking them down into simpler subproblems. It is particularly effective for optimization problems where decisions are made in stages, and each decision affects subsequent choices. A classic application of […]
AAD- Dynamic Programming In Hindi%20%20 Introduction and%20 General Method multistage graphs Part 1 [fvplayer id=”121″] डीynamic Programming (डीपी) – परिचय और सामान्य विधि (Multistage Graphs) डायनेमिक प्रोग्रामिंग (Dynamic Programming, DP) एक शक्तिशाली तकनीक है जिसका उपयोग समस्याओं को हल करने के लिए किया जाता है जिन्हें छोटे-छोटे उप-समस्याओं में विभाजित किया जा सकता है। इस […]
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 […]
Previous year question and answer in Hindi – GATE 2025 Set Theory The cardinality of the power set. [fvplayer id=”263″] GATE परीक्षा की तैयारी में पिछले वर्षों के प्रश्न पत्रों का अभ्यास अत्यंत महत्वपूर्ण है, क्योंकि यह परीक्षा के पैटर्न और प्रश्नों के प्रकार को समझने में सहायता करता है। विशेष रूप से, सेट थ्योरी […]
Previous year gate paper Discrete Mathematics Gate 2025Consider the following expressions. [fvplayer id=”200″] Certainly! Let’s delve into a notable GATE CSE previous year question on Discrete Mathematics, specifically focusing on Propositional Logic: 🧩 GATE CSE 2025 (Set 2) – Propositional Logic Question Question: Consider the following expressions: (i) false (ii) Q (iii) true (iv) P […]
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 […]
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 […]
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) क्या होता है? […]
Day 02 – Discrete mathematics for gate in Hindi – Symmeteric Relation and it’s application. [fvplayer id=”256″] Here’s a detailed explanation of Symmetric Relation and its application, tailored for Day 02 of Discrete Mathematics for GATE (CSE/IT), explained in Hindi-English (Hinglish) for better understanding. 📘 Day 02 – Discrete Mathematics for GATE 🔹 Topic: Symmetric […]
Day 04 part 04- Discrete mathematics for computer science Negation Operator of Proposition [fvplayer id=”253″] The Negation Operator (¬) in Propositional Logic is one of the fundamental logical operators in Discrete Mathematics. It is used to reverse the truth value of a given proposition. Definition: If P is a proposition, then the negation of P, […]
Part 02- Properties of Proposition law of excluded middle and law of contradiction. [fvplayer id=”251″] Here is Part 02 of Discrete Mathematics – Properties of Proposition, focusing on two fundamental logical laws: the Law of Excluded Middle and the Law of Contradiction. These are essential for understanding propositional logic, used in mathematics, computer science, and […]
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 […]
Part 05- Discrete Mathematics for computer science- Anti Symmetric Relation with core Cocept [fvplayer id=”248″] Here is Part 05 of Discrete Mathematics for Computer Science, focused on the Anti-Symmetric Relation, explained with core concepts, examples, and logic — especially useful for GATE, CS/IT, and university-level understanding. 🧠 What is an Anti-Symmetric Relation? A binary relation […]
Part 06 – Discrete Mathematics in Hindi- Asymmetric Relation in easy language. [fvplayer id=”247″] असमान्य (Asymmetric) संबंध – सरल भाषा में समझें परिचय:Asymmetric Relation (असमान्य संबंध) गणितीय संबंधों (Relations) का एक प्रकार है, जिसमें यदि (a, b) संबंध में है, तो (b, a) संबंध में नहीं होगा। असमान्य (Asymmetric) संबंध की परिभाषा एक संबंध R […]