Free PDF Source
Free PDF Source
Layering in Distributed System operating system layered. [fvplayer id=”89″] Layering in Distributed System & Operating System Layers What is Layering in Distributed Systems? Layering in a Distributed System is a method of organizing system functions into different levels, where each layer provides services to the layer above it. This modular approach simplifies system design and […]
Part 06 – Discrete Mathematics in Hindi- Asymmetric Relation in easy language. [fvplayer id=”247″] असमान्य (Asymmetric) संबंध – सरल भाषा में समझें परिचय:Asymmetric Relation (असमान्य संबंध) गणितीय संबंधों (Relations) का एक प्रकार है, जिसमें यदि (a, b) संबंध में है, तो (b, a) संबंध में नहीं होगा। असमान्य (Asymmetric) संबंध की परिभाषा एक संबंध R […]
Discrete Mathematics Gate Question-GATE 2025 equivalence class A relation R is defined on the set [fvplayer id=”233″] It looks like you’re looking for a GATE 2025 Discrete Mathematics question related to Equivalence Classes and Relations. Here’s a general breakdown to help you understand how to solve such problems. Equivalence Class & Relation Definition A relation […]
GATE CSEIT / Algorithm Analysis and Design/ Introduction to Algorithm – Understanding with real life Example [fvplayer id=”112″] GATE CSE/IT – Algorithm Analysis and Design Introduction to Algorithm with Real-Life Examples What is an Algorithm? An algorithm is a step-by-step procedure or a set of rules to solve a specific problem. It acts as a […]
GATE 1990 Subject – Theory Of Computation Topic -Finite Automata. [fvplayer id=”153″] बिलकुल! नीचे GATE 1990 के अनुसार Theory of Computation विषय में से Finite Automata (FA) टॉपिक का हिंदी में एक स्पष्ट और संक्षिप्त सारांश दिया गया है, जो तैयारी में मदद करेगा। 📘 GATE 1990 – Theory of Computation 🔹 विषय (Topic): Finite […]
Day 01- Discrete Mathematics for gate in Hindi CSEIT- Concept of Universal set and Complement of set [fvplayer id=”275″] Day 01: डिस्क्रीट मैथमेटिक्स (Discrete Mathematics) – यूनिवर्सल सेट और कम्प्लीमेंट ऑफ़ सेट यह टॉपिक GATE (CSE/IT) के लिए बहुत महत्वपूर्ण है, क्योंकि सेट थ्योरी (Set Theory) से अक्सर प्रश्न पूछे जाते हैं। यूनिवर्सल सेट (Universal […]
The C Character Set – part 4. [fvplayer id=”99″] Here’s Part 4 of an overview of the C character set, assuming you’re continuing a breakdown of the C programming language’s fundamental elements. If you’d like this to match a previous format or style, feel free to share that. The C Character Set – Part 4: […]
TOC Hindi – Introduction of Formal Language and It’s Type With real example for better understand [fvplayer id=”144″] Here is a TOC (Theory of Computation) explanation in Hindi covering the Introduction to Formal Language and its types, with real-life examples for better understanding: 📘 Formal Language का परिचय (Introduction of Formal Language in Hindi) 🔤 […]
Day 01part 05- An Introduction to theory of computation for gate computer science [fvplayer id=”143″] थ्योरी ऑफ कंप्यूटेशन (Theory of Computation – TOC) कंप्यूटर विज्ञान की एक महत्वपूर्ण शाखा है, जो यह निर्धारित करती है कि कौन-से समस्याएँ एल्गोरिदम द्वारा हल की जा सकती हैं और कौन-से नहीं। यह विषय GATE कंप्यूटर साइंस परीक्षा में […]
Language processing system – Pre-processor/Compiler Assembler /Linker/ Loader/Relocatable. [fvplayer id=”130″] Language Processing System The Language Processing System is responsible for converting high-level programming code into machine-executable code. It consists of various phases, including Pre-processing, Compilation, Assembly, Linking, and Loading. Stages of the Language Processing System Stage Function Pre-Processor Handles macro expansion, header files, and conditional […]
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 […]
Previous year gate question of Discrete in Hindi – GATE 1993 Set theory Let S be an infinite se [fvplayer id=”271″] यह प्रश्न GATE CSE 1993 के सेट थ्योरी अनुभाग से लिया गया है: ❓ प्रश्न (GATE 1993): मान लीजिए कि SS एक अनंत समुच्चय है और S1,S2,…,SnS_1, S_2, …, S_n ऐसे समुच्चय हैं कि: […]
Day 04Part 14- Discrete mathematics for computer science – Example based on implication part 02 [fvplayer id=”197″] Implication, often expressed as “if ppp, then qqq” (denoted p→qp \rightarrow qp→q), is a fundamental concept in discrete mathematics and computer science. Understanding its nuances is crucial for logical reasoning and problem-solving. Truth Table for Implication: ppp qqq […]
Meaning of lot size in Option in Hindi Understand option lot size with live practical. [fvplayer id=”597″] Option Lot Size का मतलब होता है किसी ऑप्शन कॉन्ट्रैक्ट में शामिल होने वाली यूनिट्स की संख्या। ये फ़िक्स्ड संख्या होती है, जिसे एक्सचेंज द्वारा निर्धारित किया जाता है। उदाहरण के लिए, अगर NIFTY 50 का एक ऑप्शन […]
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 10 – Discrete mathematics for computer science – Equivalence relation and it’s use. [fvplayer id=”241″] Equivalence Relation in Discrete Mathematics An equivalence relation is a relation that satisfies three key properties: Reflexivity: aRaaRaaRa for all aaa in set AAA. Symmetry: If aRbaRbaRb, then bRabRabRa. Transitivity: If aRbaRbaRb and bRcbRcbRc, then aRcaRcaRc. Example of Equivalence […]
Discrete Mathematics previous year-GATE 2025 Equivalence relation Let R and S be any two equivalence In the context of GATE (Graduate Aptitude Test in Engineering) examinations, understanding the properties of equivalence relations is crucial. An equivalence relation on a set AAA is a relation that is reflexive, symmetric, and transitive. Key Properties of Equivalence Relations: […]
Methods of Algorithm – Independent Experimental. [fvplayer id=”113″] “Methods of Algorithm – Independent Experimental” एक व्यापक विषय हो सकता है, इसलिए मैं इसे दो मुख्य भागों में स्पष्ट रूप से समझा रहा हूँ: 🧠 I. Algorithm Methods (Types/Approaches of Algorithms) एल्गोरिदम डिज़ाइन के विभिन्न तरीकों (methods) को algorithmic paradigms कहा जाता है। ये सभी problem-solving […]