Free PDF Source
Free PDF Source
Day 03Part 11-Discrete Mathematics-Example on lattice How to find a hasse diagram is lattice or not [fvplayer id=”220″] Day 03 | Part 11 – Discrete Mathematics Example on Lattice: How to Check if a Hasse Diagram is a Lattice? What is a Hasse Diagram? A Hasse diagram is a graphical representation of a partially ordered […]
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 […]
Day 03Part 05- Discrete mathematics for computer science – Finding Relation from Hasse Diagram. [fvplayer id=”226″] Discrete Mathematics – Finding Relations from Hasse Diagram What is a Hasse Diagram? A Hasse Diagram is a graphical representation of a partially ordered set (poset). It simplifies the relation by removing self-loops, transitive edges, and directions. Key Components […]
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 […]
Previous year Discrete mathematics question paper- GATE 2025 Lattices The following is the hasses. [fvplayer id=”213″] I understand you’re seeking previous GATE exam questions on Lattices in Discrete Mathematics. While I don’t have access to the exact 2025 GATE question paper, I can provide you with a relevant example from past exams to aid your […]
Distributed System Architecture or Distributed System distributed application distributed computing. [fvplayer id=”90″] Distributed System Architecture: An Overview What is a Distributed System? A distributed system is a network of independent computers that work together to achieve a common goal. These systems communicate and coordinate their actions by passing messages. Key Concepts: Distributed Application: Software that […]
Day 05Part 01-Discrete mathematics-First order Predicate logic or predicate calculus with example [fvplayer id=”206″] Discrete Mathematics – First Order Predicate Logic (Predicate Calculus) | Day 05 Part 01 What is Predicate Logic? Predicate Logic (also known as First-Order Logic or Predicate Calculus) is an extension of propositional logic. It allows expressions with quantifiers and variables, […]
Day 04Part 08-Implication operator with truth table concept of converse Cinverse and Contrapositive. [fvplayer id=”205″] Implication Operator & Truth Table: Converse, Inverse, and Contrapositive In propositional logic, the implication operator (→) is used to express a logical relationship between two statements. It is written as: p→qp \rightarrow qp→q which is read as “If ppp, then […]
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 […]
Previous year gate question and answer of Discrete in Hindi -GATE 1995 The number of elements [fvplayer id=”269″] GATE 1995 – डिस्क्रीट मैथ्स का प्रश्न और समाधान (हिंदी में): प्रश्न:एक सेट में कुल तत्वों की संख्या कितनी होगी यदि सेट A = {1, 2, 3, 4} और सेट B = {a, b}? सेट A × […]
Previous year gate question of Discrete in Hindi – GATE 1996 Let A and B be sets. [fvplayer id=”268″] आपने GATE 1996 के डिस्क्रीट मैथमेटिक्स से संबंधित प्रश्न के बारे में पूछा है, विशेष रूप से सेट थ्योरी के संदर्भ में। हालांकि मेरे पास सीधे उस वर्ष का प्रश्न उपलब्ध नहीं है, लेकिन मैं आपको […]
Compiler Design/ Short trick to find the given grammar is (LL1) or not in Compiler Design In English [fvplayer id=”123″] How to Quickly Check if a Grammar is LL(1) – Compiler Design Short Trick LL(1) Grammar is a type of context-free grammar (CFG) used in top-down parsing. To determine whether a given grammar is LL(1), […]
Previous year gate question papers in Hindi – GATE 2025 Set Theory What is the cardinality [fvplayer id=”265″] आपने GATE परीक्षा के पिछले वर्ष के प्रश्न पत्र हिंदी में और सेट थ्योरी में कार्डिनेलिटी के बारे में जानकारी मांगी है। आइए इन दोनों विषयों पर चर्चा करते हैं: 1. GATE परीक्षा के पिछले वर्ष के […]
All Pair Shortest Path Floyd-Warshall Algorithm With Practical Example [fvplayer id=”118″] All-Pairs Shortest Path: Floyd-Warshall Algorithm The Floyd-Warshall algorithm is a dynamic programming technique used to find the shortest paths between all pairs of vertices in a weighted graph. It works for both directed and undirected graphs with positive or negative weights (but no negative […]
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 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 […]
Day 04Part 15(A) – Discrete Mathematics -Methods of solving Statements and boolean expression. [fvplayer id=”196″] In Discrete Mathematics, particularly in computer science, effectively solving statements and Boolean expressions is crucial for designing and optimizing logical circuits and algorithms. Here’s a structured approach to understanding and simplifying these expressions: 1. Understanding Boolean Algebra Boolean algebra is […]
Day 04 part 03 – Discrete mathematics for gate in Hindi- Atomic and Compound Proposition. [fvplayer id=”254″] It looks like you’re looking for an explanation of Atomic and Compound Propositions in Discrete Mathematics for GATE in Hindi. Here’s a clear and simple explanation: 1. परमाणवीय (Atomic) और मिश्रित (Compound) प्रस्ताव क्या हैं? (A) परमाणवीय प्रस्ताव […]
part 05 – Discrete math for gate in Hindi – Concept of Premise, Conclusion and Argument [fvplayer id=”252″] डिस्क्रीट मैथमेटिक्स में, प्रस्तावना (Premise), निष्कर्ष (Conclusion), और तर्क (Argument) महत्वपूर्ण अवधारणाएँ हैं, जो तार्किक विश्लेषण और प्रमाणन में उपयोगी होती हैं। प्रस्तावना (Premise): प्रस्तावना वह कथन या कथन समूह है, जो किसी तर्क में आधार के […]
Previous year gate question in Hindi- Gate 2025 Discrete math Let R be a relation on the set. [fvplayer id=”245″] GATE 2025 के प्रश्न पत्रों को हल करना और उनका विश्लेषण करना आपकी सफलता की कुंजी है। इस गाइड में दिए गए सुझावों का पालन करके आप अपनी तैयारी को बेहतर बना सकते हैं। नियमित […]