Free PDF Source
Free PDF Source
Day 03Part 08-Discrete mathematics for gate- Concept of Least upper bound and greatest lower bound. [fvplayer id=”223″] Least Upper Bound (LUB) and Greatest Lower Bound (GLB) – Discrete Mathematics (GATE) The concepts of Least Upper Bound (LUB) and Greatest Lower Bound (GLB) are essential in partially ordered sets (posets) in Discrete Mathematics. These are also […]
Day 03Part 09-CseIt- Cross structure failure case of greatest lower bound and least upper bound. [fvplayer id=”222″] Day 03 Part 09 – CSE/IT: Cross Structure Failure Cases of Greatest Lower Bound (GLB) and Least Upper Bound (LUB) 🔍 Understanding GLB and LUB in Posets In a partially ordered set (poset), for any two elements aaa […]
Internet and Web Technology lecture – Concept of HTML,Java Script,Php [fvplayer id=”93″] Internet and Web Technology Lecture Concept of HTML, JavaScript, and PHP The Internet and Web Technology domain consists of three key technologies:HTML (HyperText Markup Language) → Structure of Web PagesJavaScript → Adds InteractivityPHP (Hypertext Preprocessor) → Server-Side Scripting HTML (HyperText Markup Language) HTML […]
Six Phases of compiler – Lexical /Syntax /Semantic /Intermediate code generation/code optimization [fvplayer id=”131″] Six Phases of Compiler A compiler translates high-level code into machine code through six main phases: Lexical AnalysisSyntax AnalysisSemantic AnalysisIntermediate Code GenerationCode OptimizationCode Generation Lexical Analysis (Scanning) Input: Source Code (High-level language)Output: TokensPurpose: Converts the source code into tokens (smallest units […]
Day 03 Part 02- Discrete mathematics for cse-Total order relation and it’s graph representation. [fvplayer id=”229″] Day 03 Part 02: Discrete Mathematics for CSE – Total Order Relation and Its Graph Representation 📘 Total Order Relation (पूर्ण क्रम संबंध) क्या है? Total Order Relation एक विशेष प्रकार का Partial Order Relation है, जिसमें किसी भी […]
Day 03Part 12- Discrete mathematics – Examples based on lattice for finding lattice in faster speed [fvplayer id=”219″] To efficiently determine whether a partially ordered set (poset) is a lattice, especially in the context of GATE or other competitive exams, you can follow a systematic approach. Here’s a step-by-step guide with examples to help you […]
Day 03Part 03-Discrete mathematics for gate-How to Convert Partial order Relations to hasse diagram. [fvplayer id=”228″] हासे आरेख (Hasse Diagram) बनाने के लिए आंशिक क्रम संबंधों (Partial Order Relations) को कैसे परिवर्तित किया जाए, इसका चरण-दर-चरण तरीका इस प्रकार है: चरण 1: आंशिक क्रम संबंध (Partial Order Relation) को समझें आंशिक क्रम संबंध एक सेट […]
Day 03Part 13-Example based on lattice in discrete mathematics with all the basic concept. [fvplayer id=”218″] Examples Based on Lattice in Discrete Mathematics Recap: What is a Lattice? A lattice is a partially ordered set (poset) (L, ≤) where every pair of elements has:1️⃣ Least Upper Bound (LUB) → Join ( ∨ )2️⃣ Greatest Lower […]
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 14-discrete mathematics for computer science-Principle of Duality and it’s basic concept. [fvplayer id=”217″] Principle of Duality in Discrete Mathematics What is the Principle of Duality? The Principle of Duality states that every Boolean algebraic expression has a dual expression, which is obtained by interchanging AND (⋅) and OR (+) operators, and swapping 0s […]
Day 03Part 15-Discrete mathematics for computer science-Properties of lattices with example. [fvplayer id=”216″] Here is a concise overview of lattices in discrete mathematics, focusing on their properties with examples, suitable for GATE CSE/IT preparation: 📘 What is a Lattice? A lattice is a partially ordered set (POSET) in which every pair of elements has both: […]
Day 03Part 16-Discrete mathematics – Concept of lattices and Complemented and Distributive lattices. [fvplayer id=”215″] Discrete Mathematics – Lattices, Complemented & Distributive Lattices What is a Lattice? A lattice is a partially ordered set (poset) (L, ≤) where every pair of elements has:1️⃣ A Least Upper Bound (LUB) → called Join ( ∨ )2️⃣ A […]
Lexical Analysis in simple words – token generation, blank space, symbol table, lexical error [fvplayer id=”129″] Lexical Analysis in Simple Words Lexical Analysis is the first phase of a compiler that breaks down the source code into smaller meaningful units called tokens. This process is done by a program called the Lexical Analyzer (Lexer). How […]
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 […]
Previous year gate question paper discrete mathematics- GATE 2025 lattices [fvplayer id=”214″] GATE CSE/IT परीक्षा में लैटिस (Lattice) विषय से संबंधित प्रश्न अक्सर पूछे जाते हैं, विशेषकर Discrete Mathematics खंड में। यहाँ कुछ महत्वपूर्ण प्रश्नों और संसाधनों की जानकारी दी जा रही है जो आपकी तैयारी में सहायक हो सकते हैं: 📘 GATE CSE 2015 […]
Short trick method to find First of any grammar- Compiler Design [fvplayer id=”127″] ✅ Short Trick to Find FIRST of Any Grammar (Compiler Design) In Compiler Design, computing the FIRST set is essential for parsing table construction in LL(1) parsers. Here’s a short trick method with rules to find the FIRST set quickly and accurately. […]
Example of phase of compiler – Lexical/Syntax/Semantic Intermediate Code Target [fvplayer id=”126″] Phases of a Compiler – Examples for Each Phase A compiler translates high-level code into machine code through multiple phases. These phases can be categorized into front-end (analysis) and back-end (synthesis) processes. 1. Lexical Analysis (Tokenization) Purpose: Converts source code into a sequence […]
Discrete mathematics previous year paper in hindi – GATE 2025 POSET diagram consider the set S [fvplayer id=”211″] GATE CSE/IT परीक्षा में Discrete Mathematics के अंतर्गत Partial Order Sets (POSET) और Hasse Diagrams से संबंधित प्रश्न महत्वपूर्ण होते हैं। यहाँ एक उदाहरण प्रस्तुत है जो पिछले वर्षों के प्रश्नों पर आधारित है:YouTube 🧮 उदाहरण प्रश्न: […]
Day 07Part 01 – Discrete mathematics for Gate in Hindi for CSEIT- An Introduction to Graph Theory. [fvplayer id=”172″] आपके अनुरोध के अनुसार, “Day 07 Part 01 – Discrete Mathematics for GATE in Hindi for CSE/IT: An Introduction to Graph Theory” विषय पर जानकारी प्रस्तुत की जा रही है। 📘 ग्राफ थ्योरी का परिचय (Introduction […]
Previous year gate question in Hindi- GATE 2025 Discrete math-Consider the following hasse diagram [fvplayer id=”210″] GATE परीक्षा में Hasse Diagram से संबंधित प्रश्न अक्सर पूछे जाते हैं, विशेषकर Discrete Mathematics विषय के अंतर्गत। यह विषय Partial Orders, Lattices, और Posets की समझ को परखता है। 🧮 Hasse Diagram क्या होता है? Hasse Diagram एक […]