Free PDF Source
Free PDF Source
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. […]
Concept of Pointers in Hindi – An Introduction to Pointers [fvplayer id=”96″] पॉइंटर्स का परिचय (Concept of Pointers in Hindi) पॉइंटर्स क्या होते हैं? पॉइंटर्स (Pointers) C और C++ जैसी प्रोग्रामिंग भाषाओं में उपयोग किए जाने वाले विशेष प्रकार के वेरिएबल होते हैं, जो किसी अन्य वेरिएबल के मेमोरी एड्रेस को स्टोर करते हैं। पॉइंटर […]
Computer network Layers – Data link layer – what is a function of the data link layer and protocols [fvplayer id=”140″] Computer Network Layers – Data Link Layer The Data Link Layer (DLL) is the 2nd layer in the OSI (Open Systems Interconnection) model. It is responsible for reliable data transfer over a physical link […]
Internet and Web Technology Tutorial in Hindi Part 2 [fvplayer id=”94″] इंटरनेट और वेब टेक्नोलॉजी ट्यूटोरियल (भाग-2) 1. इंटरनेट कैसे काम करता है? इंटरनेट एक ग्लोबल नेटवर्क है जो कई कंप्यूटरों और सर्वरों को आपस में जोड़ता है। यह कई तकनीकों और प्रोटोकॉल्स का उपयोग करके डेटा ट्रांसफर करता है। मुख्य घटक:क्लाइंट (Client): उपयोगकर्ता का […]
Day 04Part12-Concept of tautology contradiction and Contigency, Satisfiable and Unsatisfiable case. [fvplayer id=”201″] Day 04 – Part 12: Concept of Tautology, Contradiction, and Contingency In Discrete Mathematics and Logic, statements can be categorized based on their truth values in all possible scenarios. The key concepts are Tautology, Contradiction, and Contingency, along with Satisfiable and Unsatisfiable […]
Introduction of Distributed Computing System using Tightly and loosely coupled system [fvplayer id=”91″] Introduction to Distributed Computing System A Distributed Computing System (DCS) is a network of independent computers that work together as a single system to solve complex problems. These computers communicate and coordinate through a network to perform tasks efficiently. Distributed computing is […]
Short trick method to find Follow of any grammar- Compiler Design [fvplayer id=”128″] Short Trick to Find FOLLOW of Any Grammar in Compiler Design In Compiler Design, the FOLLOW set of a non-terminal helps in parsing and syntax analysis. It determines the set of terminals that can appear immediately after a given non-terminal in the […]
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 […]
Day 04part 10- Discrete mathematics for gate in Hindi – Bi-conditional or if and only if statements. [fvplayer id=”203″] Day 04 Part 10 – Discrete Mathematics for GATE in Hindi Bi-Conditional Statements (If and Only If – IFF) | द्वि-शर्तीय कथन Language: HindiTopic: Bi-Conditional StatementsPart: 10Exam Focus: GATE, UGC-NET, PSU Exams 1. Bi-Conditional Statement (IFF) […]
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 (पॉवर सेट) में कुल […]
AAD- Optimal Binary Search Tree With Practical Example ( for Deeper Understanding) Part 25. [fvplayer id=”120″] Optimal Binary Search Tree (OBST) – Advanced Analysis & Practical Example 1. Introduction to Optimal Binary Search Tree (OBST) An Optimal Binary Search Tree (OBST) is a specialized Binary Search Tree (BST) that is structured in a way that […]
Day 04Part 15(B) – Discrete Mathematics – Methods of solving Statements and boolean expressions. [fvplayer id=”195″] Discrete Mathematics – Methods of Solving Statements and Boolean Expressions In Discrete Mathematics, logical statements and Boolean expressions are fundamental concepts used in propositional logic, set theory, and digital logic design. Let’s explore different methods to solve them. 1. […]
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 […]
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 […]