Free PDF Source
Free PDF Source
TOC Theory Of Computation Introduction. [fvplayer id=”149″] Theory of Computation (TOC) – Introduction What is Theory of Computation? Theory of Computation (TOC) is a fundamental area of computer science that deals with the mathematical models of computation and the capabilities & limitations of computers. It focuses on understanding what problems can be solved by computers […]
TOC HINDI – Introduction to Theory Of Computation In Hindi Part 1 With Real example [fvplayer id=”145″] कंप्यूटेशन का सिद्धांत (Theory of Computation – TOC) कंप्यूटर विज्ञान की एक महत्वपूर्ण शाखा है, जो यह समझने में मदद करती है कि कोई समस्या हल की जा सकती है या नहीं, और यदि हाँ, तो कितनी कुशलता […]
Network Security Secure hashing Algorithm 1 or SHA1 algorithm Attack in network Security Computer [fvplayer id=”135″] Network Security: Secure Hashing Algorithm 1 (SHA-1) and Its Vulnerabilities What is SHA-1? SHA-1 (Secure Hashing Algorithm 1) is a cryptographic hash function developed by the National Security Agency (NSA) and published by the National Institute of Standards and […]
Day 03Part 10- Discrete mathematics – Introduction of Lattices and and it’s type in Very easy ways. [fvplayer id=”221″] Day 03 | Part 10 – Discrete Mathematics Introduction to Lattices & Their Types (Easy Explanation) What is a Lattice? A Lattice is a type of algebraic structure in Discrete Mathematics that helps in organizing elements […]
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 06Part 04 – Discrete Mathematics – Groupoid , Semi group , monoid , Group and abelian group [fvplayer id=”173″] Discrete Mathematics – Groupoid, Semigroup, Monoid, Group & Abelian Group In Discrete Mathematics & Abstract Algebra, different algebraic structures help in understanding mathematical operations and their properties. Let’s go step by step! Groupoid A groupoid […]
Day 04Part 11- discrete mathematics book for computer science- Precedence of logical operator. [fvplayer id=”202″] Precedence of Logical Operators in Discrete Mathematics Logical operators in Discrete Mathematics follow a specific order of precedence, similar to arithmetic operators in algebra. Understanding their precedence is crucial in Boolean algebra, logic circuits, and programming. Logical Operators & Their […]
Day 04Part16(B) – Propositional logic in discrete mathematics – Statements and arguments concept. [fvplayer id=”193″] Propositional Logic in Discrete Mathematics – Statements & Arguments Propositional Logic is a branch of Discrete Mathematics that deals with statements (propositions) and their logical relationships. It helps in mathematical reasoning, computer science, and logic circuits. 1. What is a […]
Day 02-Discrete mathematics for computer science in Hindi – Type of Relation with basic concept [fvplayer id=”258″] बिलकुल! यह है Day 02 का पूरा नोट्स और समझाया हुआ भाग —Discrete Mathematics for Computer Science (CSE/IT) in Hindi 🔹 टॉपिक: Types of Relations (संबंध के प्रकार) और उसका बेसिक कॉन्सेप्ट 📘 रिलेशन (Relation) क्या होता है? […]
Previous year gate question paper Discrete Mathematics – GATE 2025 – which one of the following. [fvplayer id=”191″] Practicing previous years’ GATE questions in Discrete Mathematics is crucial for understanding the exam pattern and enhancing problem-solving skills. Several resources offer compilations of these questions: GeeksforGeeks provides a collection of topic-wise previous year questions with detailed […]
Secure Hashing Algorithm or SHA2 Algorithm best Encryption Algorithm best hashing Algorithm. [fvplayer id=”134″] Let’s break down your question into key parts to give a clear understanding: 🔐 Is SHA-2 an Encryption Algorithm? No, SHA-2 is not an encryption algorithm. It is a hashing algorithm. 🧠 What is SHA-2? SHA-2 (Secure Hash Algorithm 2) is […]
Short trick method for solving propositions argument based problem of discrete mathematics-GATE 2025. [fvplayer id=”185″] Here’s a short-trick method for solving Propositions/Argument-Based Problems in Discrete Mathematics – highly useful for GATE 2025 CSE/IT aspirants. 🧠 Topic: Propositional Logic (Argument Validity) – Shortcut Method 🎯 What is the Goal? You are often asked: “Is this argument […]
DAY 02- Discrete mathematics for computer science gate in Hindi- Reflexive Relation with application. [fvplayer id=”259″] यहाँ GATE कंप्यूटर साइंस के लिए Discrete Mathematics के टॉपिक “Reflexive Relation” का हिंदी में संक्षिप्त और सरल विवरण प्रस्तुत है, जिसमें परिभाषा, उदाहरण, अनुप्रयोग और अध्ययन सामग्री शामिल हैं। 📘 Reflexive Relation (परावर्तनीय संबंध) क्या होता है? यदि […]
previous year question papers gate for cse – GATE 1996 Relations Let R be a non empty relation. [fvplayer id=”237″] In the GATE 1996 Computer Science exam, there was a question regarding a relation RRR defined on a collection of sets, where A R BA \, R \, BARB if and only if A∩B=∅A \cap B = […]
Computer Science/Numerical Methods/ Iteration method ( with it’s convergence condition). [fvplayer id=”106″] Iteration Method in Numerical Methods The Iteration Method is a technique used to find the root of an equation f(x)=0f(x) = 0f(x)=0. It is based on approximating the root through successive iterations, refining the value until it reaches the desired accuracy. 1. General […]
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 […]
Type of C Contants- part 6 [fvplayer id=”97″] Types of Constants in C (Part 6) In the C programming language, constants are fixed values that do not change during program execution. Constants can be classified into different types based on their data type and usage. 1. Integer Constants Integer constants are whole numbers (without decimal […]
Previous year gate question papers in Hindi – GATE 2025 Set Theory What is the cardinality [fvplayer id=”265″] आपने GATE परीक्षा के पिछले वर्ष के प्रश्न पत्र हिंदी में और सेट थ्योरी में कार्डिनेलिटी के बारे में जानकारी मांगी है। आइए इन दोनों विषयों पर चर्चा करते हैं: 1. GATE परीक्षा के पिछले वर्ष के […]
Unless plus concept – previous year paper discrete mathematics- GATE 2025- If X then Y Unless Z [fvplayer id=”187″] “Unless” Concept in Discrete Mathematics – GATE 2025 Understanding “Unless” in Logic In propositional logic, “unless” can be rewritten using logical operators. The statement: “X unless Z”\text{“X unless Z”}“X unless Z” means: ¬Z→X\neg Z \rightarrow X¬Z→X (If Z is false, […]