Free PDF Source
Free PDF Source
Parsing and it’s classification in Compiler Design- Top down parsing/bottom up parsing/Crecursive [fvplayer id=”125″] Parsing and Its Classification in Compiler Design What is Parsing? Parsing is the process of analyzing a sequence of tokens (from lexical analysis) to check if they follow the syntax rules of a grammar. It helps in syntax analysis and is […]
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 […]
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 […]
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 […]
Traveling Salesman Problem Using Dynamic Programming With Practical Example [fvplayer id=”116″] Traveling Salesman Problem (TSP) Using Dynamic Programming The Traveling Salesman Problem (TSP) is one of the most famous optimization problems in computer science and operations research. The goal is to find the shortest possible route that visits each city exactly once and returns to […]
Day 03Part 07-Discretse mathematics for cse-Finding of maxiamal, minimal, maximum, minimum points. [fvplayer id=”224″] Discrete Mathematics for CSE Day 03 – Part 07: Finding Maximal, Minimal, Maximum, and Minimum Points In Discrete Mathematics, finding maximal, minimal, maximum, and minimum points is essential in set theory, lattice theory, and optimization. Let’s break down these concepts: 1. […]
GATE 1994 Theory Of Computation Topic -Finite Automata [fvplayer id=”150″] The GATE 1994 exam included Theory of Computation, and one of the fundamental topics in this domain is Finite Automata. Let’s go through the key concepts related to Finite Automata (FA) that might be relevant to GATE questions. What is Finite Automata (FA)? A Finite […]
Concept of Pointers in Hindi – An Introduction to Pointers [fvplayer id=”96″] पॉइंटर्स का परिचय (Concept of Pointers in Hindi) पॉइंटर्स क्या होते हैं? पॉइंटर्स (Pointers) C और C++ जैसी प्रोग्रामिंग भाषाओं में उपयोग किए जाने वाले विशेष प्रकार के वेरिएबल होते हैं, जो किसी अन्य वेरिएबल के मेमोरी एड्रेस को स्टोर करते हैं। पॉइंटर […]
Day 01 – Discrete mathematics for computer science set operation Union Intersection. [fvplayer id=”273″] Discrete Mathematics for Computer Science – Set Operations (Union & Intersection) Topic: Set Operations – Union & Intersection Subject: Discrete Mathematics Useful For: CSE / IT / GATE / Competitive Exams What is a Set? A set is a collection of distinct elements. […]
previous year question papers in Hindi – GATE 2025 Set Theory Suppose U is the power set. [fvplayer id=”262″] यहाँ GATE 2025 की तैयारी के लिए सेट थ्योरी (Set Theory), विशेष रूप से पॉवर सेट (Power Set) से संबंधित पिछले वर्षों के प्रश्नों और संसाधनों की जानकारी दी गई है: 📄 GATE 2025 सेट थ्योरी […]
part 05 – Discrete math for gate in Hindi – Concept of Premise, Conclusion and Argument [fvplayer id=”252″] डिस्क्रीट मैथमेटिक्स में, प्रस्तावना (Premise), निष्कर्ष (Conclusion), और तर्क (Argument) महत्वपूर्ण अवधारणाएँ हैं, जो तार्किक विश्लेषण और प्रमाणन में उपयोगी होती हैं। प्रस्तावना (Premise): प्रस्तावना वह कथन या कथन समूह है, जो किसी तर्क में आधार के […]
Real Performance Analysis Chart for 100% guaranteed result Helpful for both businessman and Student [fvplayer id=”157″] Could you clarify what kind of performance analysis chart you’re looking for? Are you referring to: Business Performance Analysis (e.g., financial growth, sales trends, market analysis) Student Performance Analysis (e.g., academic progress, productivity tracking, skill improvement) Cybersecurity Performance (e.g., […]
Implication Concept Discrete mathematics previous year paper – GATE 2025- The following resolution. [fvplayer id=”186″] Implication Concept in Discrete Mathematics – GATE 2025 What is an Implication? In propositional logic, an implication is a logical statement of the form: P→QP \rightarrow QP→Q This means “If PPP is true, then QQQ must also be true.” Truth […]
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 […]
previous year question papers gate- GATE 1995-relation-Let R be a symmetric and transitive relation. [fvplayer id=”238″] GATE 1995 – Set Theory & Relations Question Question:Let R be a symmetric and transitive relation on a set A. Then which of the following is always true? (A) R is reflexive(B) R is an equivalence relation(C) R is […]
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 […]
Internet and Web Technology Tutorial in Hindi Part 1 [fvplayer id=”95″] इंटरनेट और वेब टेक्नोलॉजी ट्यूटोरियल – भाग 1 (हिंदी में) इंटरनेट क्या है? इंटरनेट कंप्यूटर नेटवर्क्स का एक विशाल नेटवर्क है जो दुनिया भर के कंप्यूटरों को जोड़ता है। यह सूचनाओं का आदान-प्रदान करने और कम्युनिकेशन का माध्यम है। इंटरनेट का पूरा नाम “इंटरकनेक्टेड […]
Discrete Mathematics Question for gate in Hindi CSEIT – GATE 2025 The binary relation [fvplayer id=”234″] यहाँ GATE CSE 2025 के लिए डिस्क्रीट मैथेमेटिक्स में बाइनरी रिलेशन (Binary Relation) पर आधारित कुछ महत्वपूर्ण प्रश्न और उनके समाधान दिए गए हैं, जो हिंदी माध्यम के छात्रों के लिए उपयोगी होंगे। 🧠 बाइनरी रिलेशन की मूल बातें […]
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 Network Layer- Concept of OSI Layer and tcp ip layer or tcp ip protocol. [fvplayer id=”141″] Computer Network Layers – OSI Model & TCP/IP Model Computer networks follow a structured model to enable communication between devices. The two main models used are: OSI Model (Open Systems Interconnection Model) TCP/IP Model (Transmission Control Protocol/Internet Protocol […]