Free PDF Source
Free PDF Source
Day 06Part 01- Discrete Mathematics for Gate Hindi – Group theory and it’s application. [fvplayer id=”177″] Would you like a summary of Group Theory and its Applications in Discrete Mathematics for GATE, explained in Hindi? Or are you looking for study materials, video links, or solved problems? Let me know how I can help! Here […]
Day 07Part 06- Examples based on Bipartite graph and Complete bipartite graph. [fvplayer id=”163″] A Bipartite Graph is a graph whose vertices can be divided into two disjoint sets such that no two vertices within the same set are adjacent. A Complete Bipartite Graph is a special type of bipartite graph where every vertex from […]
Previous year Discrete mathematics question paper- GATE 2025 Lattices The following is the hasses. [fvplayer id=”213″] I understand you’re seeking previous GATE exam questions on Lattices in Discrete Mathematics. While I don’t have access to the exact 2025 GATE question paper, I can provide you with a relevant example from past exams to aid your […]
Binary Operator concept- GATE 2021 Discrete mathematics tutorial in Hindi The binary operator [fvplayer id=”178″] Binary Operator Concept – GATE 2025 Discrete Mathematics Tutorial in Hindi क्या है Binary Operator? Binary Operator एक ऐसा ऑपरेटर होता है जो दो ऑपरेटिंग वैल्यू (Operands) पर काम करता है और एक सिंगल रिजल्ट देता है। इसे इस प्रकार […]
TOC Introduction Of Grammer [fvplayer id=”147″] Introduction to Grammar in Theory of Computation (TOC) In Theory of Computation (TOC), Grammar is a set of rules that defines how strings in a language are formed. It is mainly used to generate and analyze formal languages. What is Grammar in TOC? A Grammar (G) in TOC is […]
Compiler Design Introduction. [fvplayer id=”133″] Introduction to Compiler Design What is a Compiler? A compiler is a special program that translates high-level programming language (like C++, Java) into machine language (binary code) that a computer’s processor can execute. Why Do We Need a Compiler? Computers only understand machine language (binary code). High-level languages are user-friendly […]
Day 04Part 15(A) – Discrete Mathematics -Methods of solving Statements and boolean expression. [fvplayer id=”196″] In Discrete Mathematics, particularly in computer science, effectively solving statements and Boolean expressions is crucial for designing and optimizing logical circuits and algorithms. Here’s a structured approach to understanding and simplifying these expressions: 1. Understanding Boolean Algebra Boolean algebra is […]
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. […]
An Introduction to Distributed Computing System with real examples. [fvplayer id=”92″] Here’s a clear and concise introduction to Distributed Computing Systems along with real-world examples to help you understand the concept easily: 🖥️ Introduction to Distributed Computing System 🔹 What is a Distributed Computing System? A Distributed Computing System (DCS) is a network of independent […]
Day 06Part 07- Discrete mathematics for computer engineering- Trick for finding of group of finite numbers. [fvplayer id=”168″] Trick for Finding a Group of Finite Numbers in Discrete Mathematics In Discrete Mathematics, a group is a set of finite numbers with a binary operation that satisfies the following properties:Closure – If a,ba, ba,b are in […]
Theory of computation- Concept of string ,string length,empty string and epsilon [fvplayer id=”142″] Theory of Computation – Concept of String, String Length, Empty String, and Epsilon (ε) In the Theory of Computation (TOC), strings play a fundamental role in defining languages and automata. Let’s break down these concepts in a structured way: 1. What is […]
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 […]
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 (पॉवर सेट) में कुल […]
Part 09- Discrete mathematics in Hindi – Short trick for transitive relation to solve quick. [fvplayer id=”242″] ट्रांज़िटिव रिलेशन (सांक्रमिक संबंध) गणित में एक महत्वपूर्ण अवधारणा है, विशेष रूप से डिस्क्रीट मैथमेटिक्स में। यदि किसी सेट AAA पर एक संबंध RRR के लिए, यदि aRbaRbaRb और bRcbRcbRc से aRcaRcaRc होता है, तो RRR को ट्रांज़िटिव […]
Previous year gate question of Discrete in Hindi – GATE 1996 Let A and B be sets. [fvplayer id=”268″] आपने GATE 1996 के डिस्क्रीट मैथमेटिक्स से संबंधित प्रश्न के बारे में पूछा है, विशेष रूप से सेट थ्योरी के संदर्भ में। हालांकि मेरे पास सीधे उस वर्ष का प्रश्न उपलब्ध नहीं है, लेकिन मैं आपको […]
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 में एक महत्वपूर्ण विषय है, खासकर […]
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) लेने […]
Computer Science/Numerical Methods/ Finite difference method( backward difference) [fvplayer id=”108″] Finite Difference Method: Backward Difference The Finite Difference Method (FDM) is a numerical technique used for approximating derivatives. The backward difference method is a commonly used approach when calculating derivatives at a given point using previous data points. Definition of Backward Difference The backward difference […]
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 […]
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 […]