<?xml version="1.0" encoding="UTF-8" ?>
<rss version="2.0">
    <channel>
      <title>GATE Notes</title>
      <link>https://gate.santhoshradhai.me</link>
      <description>Last 10 notes on GATE Notes</description>
      <generator>Quartz -- quartz.jzhao.xyz</generator>
      <item>
    <title>SET 02 Subsets and Equality</title>
    <link>https://gate.santhoshradhai.me/DM/3.-Set-Theory/SET-02-Subsets-and-Equality</link>
    <guid>https://gate.santhoshradhai.me/DM/3.-Set-Theory/SET-02-Subsets-and-Equality</guid>
    <description><![CDATA[ SET 02 · Subsets &amp; Equality Subset (inclusion) ⊆ A \subseteq B — every element of A is also in B. ]]></description>
    <pubDate>Mon, 16 Nov 2026 10:38:58 GMT</pubDate>
  </item><item>
    <title>SET 03 Membership vs Inclusion</title>
    <link>https://gate.santhoshradhai.me/DM/3.-Set-Theory/SET-03-Membership-vs-Inclusion</link>
    <guid>https://gate.santhoshradhai.me/DM/3.-Set-Theory/SET-03-Membership-vs-Inclusion</guid>
    <description><![CDATA[ SET 03 · Membership (∈) vs Inclusion (⊆) The single most tested distinction in this chapter x \in A — x is one of the items you see when you open box A. ]]></description>
    <pubDate>Mon, 16 Nov 2026 10:38:58 GMT</pubDate>
  </item><item>
    <title>SET 04 Universal Null Singleton</title>
    <link>https://gate.santhoshradhai.me/DM/3.-Set-Theory/SET-04-Universal-Null-Singleton</link>
    <guid>https://gate.santhoshradhai.me/DM/3.-Set-Theory/SET-04-Universal-Null-Singleton</guid>
    <description><![CDATA[ SET 04 · Universal Set, Null Set, Singleton Universal set U (also written E) The set containing everything under consideration — the same as the universe of discourse in FOL 02 Quantifiers. ]]></description>
    <pubDate>Mon, 16 Nov 2026 10:38:58 GMT</pubDate>
  </item><item>
    <title>SET 05 Power Set and Cardinality</title>
    <link>https://gate.santhoshradhai.me/DM/3.-Set-Theory/SET-05-Power-Set-and-Cardinality</link>
    <guid>https://gate.santhoshradhai.me/DM/3.-Set-Theory/SET-05-Power-Set-and-Cardinality</guid>
    <description><![CDATA[ SET 05 · Power Set &amp; Cardinality Cardinality |A| The number of distinct elements of A. ]]></description>
    <pubDate>Mon, 16 Nov 2026 10:38:58 GMT</pubDate>
  </item><item>
    <title>SET 06 Cartesian Product</title>
    <link>https://gate.santhoshradhai.me/DM/3.-Set-Theory/SET-06-Cartesian-Product</link>
    <guid>https://gate.santhoshradhai.me/DM/3.-Set-Theory/SET-06-Cartesian-Product</guid>
    <description><![CDATA[ SET 06 · Cartesian Product Ordered pairs (a, b) — order matters: (1, 3) \neq (3, 1) (different points on a graph). ]]></description>
    <pubDate>Mon, 16 Nov 2026 10:38:58 GMT</pubDate>
  </item><item>
    <title>SET 07 Set Operations</title>
    <link>https://gate.santhoshradhai.me/DM/3.-Set-Theory/SET-07-Set-Operations</link>
    <guid>https://gate.santhoshradhai.me/DM/3.-Set-Theory/SET-07-Set-Operations</guid>
    <description><![CDATA[ SET 07 · Set Operations &amp; Venn Diagrams OperationNotationDefinitionLogicUnionA\cup Bin A or B (or both)x\in A \lor x\in BIntersectionA\cap Bin both A and Bx\in A \land x\in BDifferenceA - Bin A but not in Bx\in A \land x\notin BComplementA&#039; (\bar A, A^c)not in A (within U)x\notin ASymmetric... ]]></description>
    <pubDate>Mon, 16 Nov 2026 10:38:58 GMT</pubDate>
  </item><item>
    <title>SET 08 Set Identities</title>
    <link>https://gate.santhoshradhai.me/DM/3.-Set-Theory/SET-08-Set-Identities</link>
    <guid>https://gate.santhoshradhai.me/DM/3.-Set-Theory/SET-08-Set-Identities</guid>
    <description><![CDATA[ SET 08 · Set Identities A, B, C ⊆ U. Each law mirrors a law in 08 Logical Equivalences: swap ∪ ↔ ∨, ∩ ↔ ∧, ’ ↔ ¬, U ↔ T, ϕ ↔ F. ]]></description>
    <pubDate>Mon, 16 Nov 2026 10:38:58 GMT</pubDate>
  </item><item>
    <title>SET 09 Symmetric Difference</title>
    <link>https://gate.santhoshradhai.me/DM/3.-Set-Theory/SET-09-Symmetric-Difference</link>
    <guid>https://gate.santhoshradhai.me/DM/3.-Set-Theory/SET-09-Symmetric-Difference</guid>
    <description><![CDATA[ SET 09 · Symmetric Difference ⊕ Definition A\oplus B = elements in A or B, but not both: A\oplus B = \{x \mid (x\in A\lor x\in B)\land\neg(x\in A\land x\in B)\} It’s the set version of XOR. ]]></description>
    <pubDate>Mon, 16 Nov 2026 10:38:58 GMT</pubDate>
  </item><item>
    <title>SET 10 Beyond the Slides</title>
    <link>https://gate.santhoshradhai.me/DM/3.-Set-Theory/SET-10-Beyond-the-Slides</link>
    <guid>https://gate.santhoshradhai.me/DM/3.-Set-Theory/SET-10-Beyond-the-Slides</guid>
    <description><![CDATA[ SET 10 · Beyond the Slides (GATE extras) Not in the Neso Chapter 3 deck These topics appear in GATE (especially as NAT questions) but aren’t covered in the slides. ]]></description>
    <pubDate>Mon, 16 Nov 2026 10:38:58 GMT</pubDate>
  </item><item>
    <title>SET 11 GATE PYQs</title>
    <link>https://gate.santhoshradhai.me/DM/3.-Set-Theory/SET-11-GATE-PYQs</link>
    <guid>https://gate.santhoshradhai.me/DM/3.-Set-Theory/SET-11-GATE-PYQs</guid>
    <description><![CDATA[ SET 11 · GATE / TIFR PYQs (from the slides) How to use Attempt before expanding. Target: 1-mark ≤ 1.5 min, 2-mark ≤ 3 min. Log mistakes in SET README. ]]></description>
    <pubDate>Mon, 16 Nov 2026 10:38:58 GMT</pubDate>
  </item>
    </channel>
  </rss>