Lesson 1 — Beginner

Discrete Mathematics kya hai

Discrete mathematics wo maths hai jo alag-alag (discrete) cheezon par chalti hai — counting, logic, sets, graphs. Is lesson mein samjhenge ki ye hota kya hai, isme kaun kaunse topics aate hain, aur CS waalon ke liye ye itni zaroori kyun hai.

⏱ 12 min• Beginner• Kuch nahi

Discrete mathematics kya hai

WHAT

Discrete mathematics yaani alag-alag cheezon ki maths — jinki values continuously badhti nahi. Counting, logic, sets, graphs, recurrence — ye sab discrete maths ke core hain. Isko finite maths bhi kehte hain.

WHEN

Jab bhi computer science ki baat ho — algorithms, databases, networks, cryptography — tab discrete maths kaam aati hai. GATE, CUET aur placements mein bhi yahi section sabse zyada marks deta hai.

WHERE

Programming (conditions), database (sets aur relations), networking (graphs), cryptography (groups) — har jagah. Tumhara har if-condition basically propositional logic hai.

Simple farak: continuous maths mein cheezein dheere dheere badhti hain (height, time, temperature), discrete maths mein cheezein step mein aati hain — 1, 2, 3... Counting aur logic yahin se shuru hoti hai.

Yaad rakho: Discrete ka matlab hai jitne count kar sako. 5 students hain, 7 edges hain, 3 choices hain — ye sab countable cheezein discrete maths ki hain. Calculus (slope, area under curve) continuous maths ki — usmein yahan nahi aayegi.

Discrete vs Continuous — clear difference

Continuous Maths          Discrete Maths
----------------          --------------
Values: 1.5, 2.73, pi     Values: 1, 2, 3 (alag alag steps)
Topics: calculus,         Topics: logic, sets,
        integration,              combinatorics, graphs,
        limits                    number theory, groups
Example: gadi ka speed     Example: ticket counter mein
        distance/time             kitne log khade hain
Nature : smoothly          Nature : step by step
         badhta hai               badhta hai

Ek trick: agar cheez ko gin sakte ho (count kar sakte ho) toh wo discrete hai. Students ginne, edges ginne, arrangements ginne — sab discrete. Time ya distance naapna — continuous.

Discrete: students, marks, edges, subsets, truth values, coins — sab countable.
Continuous: temperature, height, speed, money (as a real number) — naapne wale.
CS ka rule: computer discrete machine hai — har cheez 0/1 mein, isliye discrete maths computer ki maths hai.

DM ki major branches

Discrete maths ek umbrella hai — iske neeche kai branches hain jo aage ke 14 lessons mein detail mein aayengi:

Discrete Mathematics
├── Logic           : propositions, truth tables, quantifiers
├── Set Theory      : union, intersection, subsets, power set
├── Relations       : reflexive, symmetric, transitive, equivalence
├── Functions       : one-one, onto, bijection
├── Combinatorics   : permutations, combinations, counting
├── Graph Theory    : vertices, edges, trees, paths
├── Algebra         : groups, rings, fields, boolean algebra
└── Recurrence      : sequences, recurrence relations

Logic: sahi aur galat arguments check karna — programming ke conditions isi se aate hain.
Set Theory: collections ka maths — SQL queries isi par chalti hain.
Combinatorics: kitne tarike se ho sakta hai — probability aur algorithms ki basis.
Graph Theory: nodes aur unke connections — social networks, maps, routing.
Algebraic structures: groups, rings, fields — cryptography (RSA) isi par bana hai.

CS, GATE aur interviews ke liye kyun zaroori

Har CS subject ke peeche discrete maths baithi hai — ye wahi foundation hai jo upar wale floors ko support karti hai:

DSA          : graphs, trees, recursion, counting
Databases    : relations aur sets (SQL = relational algebra)
Cryptography : groups + modular arithmetic (RSA)
Compiler     : boolean algebra + logic (K-Map se circuit)
AI/ML        : probability, logic, graph models
Placements   : aptitude ka counting/logic portion

Strategy: Ye course 15 lessons ka hai — har lesson ke saath apne notes pe examples khud solve karo. Discrete maths ratne se nahi, practice se aati hai. Truth table ek baar khud banao, proof ek baar khud likho — bas ho jaayega.

Exercise

Question: Continuous maths ka example kaunsa hai — calculus ya graph theory? (calculus / graph theory)

Question: Graph theory mein vertices aur edges ki ginti kis type ki maths hai — discrete ya continuous?

Question: DM ki 4 branches comma se likho (logic, sets, combinatorics, graph theory — koi bhi order).

Common mistakes

Discrete maths ko ratna: Ye subject practice ka hai. Truth table, proof, formula — sab khud likh kar dekho, tabhi aayega. Ratta toot jaata hai, skill nahi.
Har cheez ko continuous samajhna: Number of students = discrete, height of students = continuous. Count aur naap — farak yaad rakho, question isi par decide hota hai.
Graph theory ko drawing samajhna: Graph mein sirf vertices aur edges matter karte hain — unki position ya shape ki nahi. Drawing sirf dikhane ke liye hoti hai.

Desi example: Delhi Metro ka network

Delhi Metro ka map basically ek graph hai — stations = vertices, tracks = edges. Isi discrete maths se puchha jaata hai: shortest route kya hai, kitne tarike se transfer ho sakte hain, peak hour mein kitni trains chahiye:

Vertices = stations (Rajiv Chowk, Kashmere Gate...)
Edges    = direct track (2 stations ke beech)
Question : Rajiv Chowk se Anand Vihar shortest path?
Tools    : graph theory + counting (discrete maths)

Exam mapping (GATE / CUET / Placements)

GATE CS mein Discrete Maths se 6-8 marks fixed hote hain (logic, sets, graphs, combinatorics).
CUET/B.Sc exams mein "branches of discrete maths" direct question aata hai.
Placements: aptitude section ka counting/logic portion isi maths par based hai.
Trap: "Graph theory continuous hai" — galat, wo sabse classic discrete topic hai.

Lesson complete?

Ab pata chala ki discrete maths hoti kya hai. Agla lesson — Set Theory — mein dekhenge collections ka basics: union, intersection, subsets aur power set.