🧪 Lab Practicals — BCA101P & SEC101P

MS WORD PRACTICALS (BCA101P)

Word lab ka goal: Ribbon ke har tab ka use dikhana — Home (font/paragraph), Insert (table/picture/shapes/symbol), Design (page border), Layout (margins/orientation), Mailings (mail merge), Review (spell check), View (zoom/print layout). Har practical me kam se kam 4 alag features use karo — viva me wahi poochha jaata hai. 👇

W1. Creating an Advertisement 🫙

Aim: MS Word me ek attractive advertisement banane ke liye formatting features ka use karna (font, colour, picture, shapes, text box, border — sab ek saath).

Steps:

1. MS Word kholo → Ctrl + N se new blank document banao; page setup (Layout → Orientation → Portrait) set karo.
2. Title likho: "GRAND SALE – 50% OFF!" → Home tab me font bold, size 36, colour red, alignment center (Ctrl + E). Title ko WordArt (Insert → WordArt) se fancy bhi bana sakte ho.
3. Ek catchy line likho: "Har purchase par dhamaka! 10 Oct – 15 Oct" — size 14, italic, centre me.
4. Insert → Pictures se product ki image dalo (ya Insert → Shapes → shapes se design banao). Image ke saath Text Wrapping (Square/Tight) lagao taaki text image ke aas-paas bahe.
5. Insert → Text Box me offer details likho ("Buy 2 Get 1 Free", "Free Home Delivery") → box par border + fill colour lagao (Shape Format → Shape Fill / Shape Outline).
6. Home → Bullets (ya Numbering) se product list banao: "Shoes, Bags, Watches, Cosmetics" — line spacing 1.15–1.5 rakho.
7. Design → Page Borders se page par border lagao, ya Shapes se box/frame banao. (Design → Page Color se halka background bhi de sakte ho.)
8. Neeche contact line dalo: mobile number, address, timing — size 12, bold.
9. Poora layout ek baar Print Preview (Ctrl + P) me dekho — kuch bahar nahi ja raha? Margins adjust karo.
10. Save: File → Save As → file name "advertisement.docx" → Save. (Lab file ke liye ek print/screenshot lo.)

Word features jo lab me dikhane hain: font formatting, paragraph alignment, line spacing, bullets/numbering, images + text wrapping, shapes, text boxes, WordArt, borders/shading, colours, page setup. "Advertisement = visual + short lines + offer highlight" — bas inka mel banao.

Lab file me aise likho: "Result: Advertisement ban gaya jisme font formatting, bullets, image, text box aur page border ka use kiya gaya." — ek line ka conclusion har practical me zaroor likho. ✅

W2. Curriculum Vitae (CV/Biodata) 📄

Aim: MS Word me apna CV (resume) banana — table, formatting, bullets aur photo ka use karke (professional 1-page document).

Steps:

1. New document kholo (Ctrl + N). Page margins set karo: Layout → Margins → Normal (1 inch) — CV me clean space zaroori hai.
2. Naam sabse upar — bold, size 20–22, centre. Neeche ek line me contact info: phone, email, city (size 10–11) — sab centre me.
3. Headings banao: "Career Objective", "Education", "Skills", "Projects/Achievements", "Hobbies" — har heading bold + underline (ya Home → Styles me "Heading 1" ka colour badal lo), heading ke neeche ek horizontal line (Insert → Shapes → Line) de do.
4. Career Objective 2 lines me likho: "BCA student with strong interest in programming and web development; seeking opportunities to apply C, MS Office and problem-solving skills." (CV me "hardworking" jaisi generic line se bacho — example ke saath likho.)
5. Education ke liye table banao: Insert → Table (3 columns × 4 rows) → header row: Qualification | Board/University | Year/Percentage → data bharo (10th, 12th, BCA Pursuing). Table me header row bold + shading lagao (Table Design → Shading).
6. Skills me bullets use karo: C Programming, MS Word, MS Excel, HTML basics, typing speed, communication — jaise-jaise seekh rahe ho, add karte jao.
7. Photo: Insert → Pictures → apni passport size photo → Picture Format → Crop (square) → size adjust (~3 cm × 4 cm) → top-right ya left me align karo.
8. Professional look ke liye: Design → Page Borders (thin line) ya page ke left me ek vertical line (Shapes → Line) — dhyaan rakho, zyada design CV ko "shabby" banata hai.
9. Spell check: Review → Spelling & Grammar (F7) chalao — CV me typo bilkul allowed nahi.
10. Save: "myCV.docx" (aur saath me PDF banao: File → Save As → PDF) — company ko PDF hi bhejni chahiye.

W3. Scientific Notations (Superscript/Subscript) 🔬

Aim: Scientific notations (x², H₂O, exponents, symbols) aur equations MS Word me banana — superscript/subscript aur Equation editor ka use.

Steps:

1. Type karo: x2 → "2" select karo → Home → Font group → Superscript (x²) — shortcut: Ctrl + Shift + +.
2. Type karo: H2O → "2" select karo → Subscript (H₂O) — shortcut: Ctrl + =.
3. Symbols ke liye: Insert → Symbol → More Symbols → π, α, β, °, →, ≥, √, Ω, µm select karke insert karo.
4. Equation ke liye: Insert → Equation (Alt + =) → type karo "E=mc^2" → space dabao = E = mc². Fraction ke liye (a+b)/(c+d) likhke space dabao → proper fraction ban jaayega.
5. Practice karo (ye 6 cheezein lab file me likho): "Area = πr²", "E = mc²", "C₆H₁₂O₆", "10⁻³", "H₂SO₄", "v² = u² + 2as"
6. Save "scientific_notation.docx" → screenshot lab file me lagao.

Kyun zaroori hai: Chemistry ke formulas (H₂O, CO₂), Maths ke exponents (x² + y², aⁿ), Physics ke units (m/s², cm³), aur engineering me chemical equations — sab jagah superscript/subscript use hota hai. University practical me ye dikhana 5 minute ka kaam hai aur easy marks ✅. Viva me poochha jaata hai: "superscript aur subscript me difference?" → Superscript upar likha jaata hai (power/exponent, x²), subscript neeche (index/chemical count, H₂O).

W4. Creating a Timetable 📅

Aim: MS Word me ek class timetable banana — table banana, cells merge karna, shading aur row height set karna.

Steps:

1. Insert → Table → 6 columns × 7 rows (pehli row = header "Day/Period", baaki rows = Monday–Saturday).
2. Header row bharo: Time | Day | 9:00–10:00 | 10:00–11:00 | 11:00–12:00 | 12:00–1:00 — aur ek "Lunch Break" column bhi add karo (ek column zyada le lo).
3. Subjects type karo — har cell me subject ka naam + teacher ka naam (chhota font, size 10–11).
4. Merge Cells: "Lunch Break" ke rows select karo → right-click → Merge Cells → ek hi cell ban jaayega (ya Table Layout → Merge Cells). Lunch break ki shading alag colour do.
5. Table Design → Shading se header row ko colour do (halka neela/green) aur Bold karo; border style bhi badal sakte ho (Table Design → Borders).
6. Row height / column width adjust karo: table pe right-click → Table Properties → Row/Column (ya borders ko drag karo) — sab cells barabar dikhein.
7. Table ke upar title likho: "BCA 1st Semester — Class Timetable (Session 2025-26)" — bold, centre, size 16; neeche "Class Teacher" ke sign ka space chhodo.
8. Save "timetable.docx" → print preview me check karo ki ek page me aa raha hai (Layout → Orientation → Landscape bhi try kar sakte ho).

Tip: "Insert → Table" ke bajaye Table Draw karke bhi bana sakte ho; column width adjust ke liye border pe drag karo. Viva me aata hai: "cell merge kaise karte hain?" → Table Layout/Design → Merge Cells (ya select + right click). Ye practical table + merge + shading + properties — 4 features ka proof hai ✅

W5. Conversion (Document Conversion / Units Table) 🔁

Aim: Conversion se do cheezein — (a) units ka conversion table Word me banana, (b) document ko ek format se doosre format me convert karna (Word ↔ PDF).

Steps (a) — Units Conversion Table:

1. Insert → Table (3 columns × 6 rows) → headers: "Quantity | Unit | Conversion".
2. Rows bharo: Length — 1 km = 1000 m, 1 m = 100 cm, 1 cm = 10 mm; Weight — 1 kg = 1000 g, 1 quintal = 100 kg, 1 tonne = 1000 kg; Temperature — °C → °F = (C × 9/5) + 32.
3. Formula wali cells me Insert → Equation use karo (proper notation ke liye) aur "°C / °F" symbols Insert → Symbol se dalo.
4. Table ko bold header + shading + alignment de do; title: "Common Unit Conversions" — aur save "conversion_table.docx".

Steps (b) — File Conversion:

1. Word → PDF: File → Save As (ya Export) → File type "PDF (*.pdf)" → Save. (PDF ka fayda: formatting kahin nahi badalti, har device pe same dikhta hai.)
2. PDF → Word: Word kholo → File → Open → PDF file select karo → Word usko convert karke dikhata hai → "OK" → phir Save As → .docx.
3. Screenshot/doc ko image me badalna: Select karo → Ctrl + C → Paint/MS Paint me paste → Save as .png (lab file me lagane ke liye).

W6. Mail Merge and Letter ✉️ Important

Aim: Mail Merge ka use karke ek hi letter ka template bana kar kai logon ke liye personalized letters generate karna (naam, city, amount apne-aap bhar jaayein).

Steps:

1. Main document banao: Letter ka format likho — letterhead (university/company ka naam + address + date), salutation, body, closing. Jahan naam/address aayega wahan placeholder soch lo: "Dear «Name», aapko suchit kiya jaata hai…"
2. Recipient list banao: Mailings tab → Start Mail Merge → Letters → Select Recipients → Type a New List → Customize Columns: Name, City, Amount (jo fields chahiye) → 5–10 logon ka data bharo → save kar do (Word usko .mdb / merge list ke roop me rakhta hai).
3. Placeholders lagao: Mailings → Insert Merge Field → «Name», «City», «Amount» letter me sahi jagah daalo (fields « » brackets me dikhte hain).
4. Preview Results (Mailings tab) → Next record arrow se ek-ek letter check karo — «Name» ki jagah Rahul, Priya sab aa rahe hain?
5. Finish & Merge → "Print Documents" (seedha print) ya Edit Individual Documents (saare letters ek hi file me alag pages par — isko lab file me output ke roop me lagao).
6. Letters ki copy save karo ("merged_letters.docx") aur data list bhi ("recipients.docx") — record me dono ka zikr karo.

Sample merged letter (har name ke liye auto-bana):

Surajmal University, Kichha
Date: 10 October 2026

Dear «Name»,
Aapka admission form «City» campus me receive ho gaya hai.
Pending fee: ₹«Amount» — kripya 15 October tak jama karayein.

Regards,
Admission Cell

Data list: Name | City | Amount
Rahul | Kichha | 5000
Priya | Haldwani | 8000 ... (har ek ka letter alag ban jayega ✔)

Viva me poochha jaata hai: (1) Mail merge ke 3 parts? → Main document, Data source, Merged document (2) Kab use karte ho? → Bulk letters, fee notices, admit cards, invitation letters, salary slips, certificates (3) «» ka kya matlab? → Merge field ka placeholder. Ye practical highest-marking Word practical hota hai — steps dhyaan se likho ⭐

W7. Drawing a Flowchart 🗺️

Aim: MS Word ke Shapes aur Connectors se ek flowchart banana (algorithm ko picture me dikhana).

Steps:

1. Insert → Shapes → Oval (Start/Stop), Parallelogram (Input/Output), Rectangle (Process), Diamond (Decision), arrows/lines (Connectors) chuno.
2. Pehla shape girao (Oval → "Start") → shape ke andar text likho: shape pe right-click → Add Text (ya seedha type karo).
3. Aage ke shapes girao: "Read a, b" (Parallelogram) → "if a > b?" (Diamond) → "print a" (Parallelogram) → "print b" → "Stop" (Oval).
4. Shapes ko Connectors (Lines/Elbow arrows) se jodo — arrows shape ke edge pe snap hote hain (shape hilao to arrow bhi saath chalega — isi ko "smart" connection kehte hain).
5. Decision diamond se do arrows nikalo: Yes aur No — arrows ke paas label likho (Insert → Text Box se chhota text).
6. Colours/borders se Start-Stop ko green, Process ko blue, Decision ko yellow kar do; font size 11 baaki sab me same rakho.
7. Poora flowchart select karo (Ctrl + A ya drag) → Right click → Group → Group (ya Ctrl + G) — ab poori figure ek unit ki tarah move hogi.
8. Save "flowchart.docx" → screenshot lab file me (aur haath se bana flowchart bhi record me draw karo — dono alag marks hain).

Flowchart symbols — yaad rakho (viva favourite!):

  ( Oval )          → Start / Stop (terminal)
  [ Rectangle ]     → Process (kaam/hisaab)
  / Parallelogram / → Input / Output (read/print)
  <> Diamond <>     → Decision (condition: yes/no)
  → Arrow           → Flow direction (connector)

Example banao: "Largest of two numbers" ka flowchart:
Start → Read a, b → a > b ? → Yes: print a ; No: print b → Stop

(Aur practice karo: even/odd, sum of 1..n, average of 3 numbers — 
ye Unit 1 me padha tha, ab Word me shapes se draw karo ✅)

Viva me aata hai: "Flowchart ke 4 main symbols batao" (upar wale), "Algorithm aur flowchart me difference?" → Algorithm = steps in words, flowchart = same steps ki picture/diagram (symbols me). Ye practical C lab ke "algorithm likhna" wale question se seedha juda hua hai — dono ek hi cheez ke do roop hain 🔁

Bonus Word Practical 1 — Certificate / Marksheet banana (table + border + alignment) 🏅

Aim: Ek certificate (ya mark-sheet) banana jisme table, page border, alignment aur font formatting ka use ho.

1. New document → Layout → Orientation → Landscape (certificate ke liye landscape better lagta hai) → Margins → Custom (2 inch chaaro taraf).
2. Heading likho: "SURAJMAL UNIVERSITY, KICHHA" — bold, size 24, centre (Ctrl + E) → neeche "CERTIFICATE OF MERIT" — bold, size 18, spacing me double line (Home → Line Spacing).
3. Body: "This is to certify that [Student Name], a student of BCA 1st Semester, has successfully completed the laboratory work with grade ____." — size 14, justify (Ctrl + J), line spacing 1.5.
4. Insert → Table (3 × 2) me detail: Roll No | Name | Grade (aur agar subject-wise marksheet hai to 4 × 7 table — Subject | Marks | Grade rows).
5. Table ke border halke rakho ya Table Design se "No Border + header row bottom line" (clean look) — cells me padding ke liye Table Properties → Cell → Margins.
6. Design → Page Borders → decorative border chuno (certificate me zyada achha lagta hai) → OK.
7. Signature ke liye do jagah chhodo — "Teacher In-charge" aur "Head of Department" — Insert → Shapes → Line se signature line banao; date left me.
8. Ctrl + P se print preview dekho → "certificate.docx" save karo (aur PDF export bhi).

Viva point: certificate me alignment kyun zyada matter karta hai? → Kyunki ye official document hai — centre heading, justified body aur balanced signature lines professional look dete hain ("first impression" ka rule). ✅

Bonus Word Practical 2 — Header/Footer, Page Numbers, Watermark, Find & Replace 🔧

Aim: Document me professional touches — header/footer, page numbering, watermark aur find-replace ka use.

1. Header/Footer: Insert → Header → Blank (ya "Alphabet"/"Facet") → college ka naam type karo → Insert → Page Number → Bottom of Page → "Page 1 of 5" wala format.
2. Watermark: Design → Watermark → "DRAFT" / "CONFIDENTIAL" / Custom Watermark (apna text ya photo watermark) — assignment/notes me "BCA 1st Sem" likhwa sakte ho. (Watermark hatane ke liye: Design → Watermark → Remove.)
3. Find & Replace (Ctrl + H): ek hi shabd baar-baar badalna — jaise "University" ko "Surajmal University" → Replace All. Format replace bhi hota hai: bold/colour bhi Find & Replace me set kar sakte ho.
4. Comments & Track Changes: Review tab → New Comment (dusre se suggest karwana) • Track Changes (teacher/editor ke liye — har change red mark me dikhta hai).
5. Table of Contents: Headings ko "Heading 1/2" style do → References → Table of Contents → automatic index ban jaata hai (report/project ke liye best).
6. Hyperlink: Insert → Link (Ctrl + K) → kisi website ya file ka link. Footnote: References → Insert Footnote (reference ke liye chhota number + neeche note).
7. Save "formatting.docx" — aur lab file me steps + screenshot lagao (ye practical "advanced Word" ka proof hai).

Viva point: "Header aur Footer me farak?" → Header page ke upar (repeating title/logo), Footer neeche (page number, date, naam) • "Find & Replace ka shortcut?" → Ctrl + H • "Table of contents automatic kaise?" → headings ko Heading styles do, phir References → TOC (page number khud badalte hain) 🔧

MS EXCEL PRACTICALS (BCA101P)

Excel lab me do practical hain — charts aur formula editor. Iske saath ek marksheet banao (worksheet + formulas + chart + conditional formatting + IF grades) — ye ek hi file me poora Excel syllabus cover kar leti hai, aur viva me dikhane ke liye sabse strong hai. 📊

E1. Spreadsheet Charts — Line, XY, Bar & Pie 📊

Aim: Given data se alag-alag chart types (Column/Bar, Line, Pie, XY-Scatter) banana aur samajhna ki kaunsa chart kab use hota hai.

Pehle data banao (5 students ke marks):

    A        B     C     D
1   Name     Math  Sci   Eng
2   Ansh     78    85    90
3   Priya    90    88    92
4   Rahul    65    70    72
5   Sara     88    79    95
6   Amit     50    60    55

Chart ka steps (har type ka):
1. Data select karo (A1:D6) — heading row include karo
2. Insert tab → Charts group → chart type choose karo:
     • Column/Bar chart → subjects ka comparison
     • Line chart → trend dikhane ke liye
     • Pie chart → ek column ka hissa (jaise language-wise %)
     • XY (Scatter) chart → do numbers ke relation ke liye
3. Chart Design tab → title, axis labels, legend add karo
   (Chart Elements "+" button, ya Add Chart Element)
4. Chart ko move/resize karke alag sheet pe bhejo (Move Chart → New Sheet)
5. Chart pe right-click → Select Data se range badal sakte ho
   → Save karo aur screenshot lab file me lagao

Lab file me aise likho: "Aim: Chart types banana seekhna. Procedure: data enter kiya → data select kiya → Insert → Charts se Column, Line, Pie aur XY charts banaye → title, axis labels aur legend add kiye → screenshot liya. Result: chaar chart types ban gaye aur har type ka use samajh aaya." (4 screenshots = complete-answer checklist) ✅

E2. Spreadsheet Formula Editor ➗

Aim: Excel ke formula editor aur built-in functions ka use karke calculations karna (SUM, AVERAGE, MAX/MIN, COUNT, IF, percentage, ROUND, CONCAT) — aur ek complete marksheet banane.

Basic formulas (har ek = se shuru hota hai):

=D2+E2               → simple addition (do cells jodna)
=SUM(B2:D2)          → range ka sum (Math | Sci | Eng ka total)
=AVERAGE(B2:D2)      → average nikalo
=MAX(B2:D2)          → sabse zyada marks
=MIN(B2:D2)          → sabse kam marks
=COUNT(B2:B10)       → kitni numbers hain (count — sirf numeric cells)
=COUNTA(A2:A10)      → kitne cells bhare hain (text bhi ginte hain)
=COUNTBLANK(B2:B10)  → kitne cells khaali hain
=B2/D2*100           → percentage (marks/total × 100)
=IF(D2>=33,"Pass","Fail")                     → condition wala result
=IF(B2>=90,"A",IF(B2>=75,"B","C"))            → nested IF = grade
=ROUND(B2*1.18,2)                             → GST lagana + 2 decimal
=CONCAT(A2," ",B2)   → do cells jodna (naam + city)
=COUNTA(table) → | =TODAY() → aaj ki date | =NOW() → date + time

Ready-made practical — Marksheet banao (lab ke liye perfect):

    A        B     C     D      E       F            G      H
1   Name     Math  Sci   Eng    Total   Percentage   Grade  Result
2   Ansh     78    85    90     →?      →?           →?     →?
3   Priya    90    88    92
4   Rahul    65    70    72
5   Sara     88    79    95
6   Amit     50    60    55

E1: "Total"       → E2 = SUM(B2:D2)
F1: "Percentage"  → F2 = ROUND(E2/300*100,1)
G1: "Grade"       → G2 = IF(F2>=90,"A",IF(F2>=75,"B",IF(F2>=60,"C",IF(F2>=33,"D","Fail"))))
H1: "Result"      → H2 = IF(F2>=33,"Pass","Fail")

Phir:
  • Fill handle (cell ke corner pe chhota square) se drag karke
    E2:H2 ke formulas neeche sab students tak copy karo
  • Conditional Formatting (Home → Conditional Formatting → Highlight
    Cell Rules → Less Than → 33) se Fail wale red ho jaayein 🎨
  • Insert → Bar chart se students ka comparison graph banao
  • Data → Sort (Total ke hisaab se rank) aur Filter bhi dikha do

Excel ke exam-friendly features (dikha do = complete-answer checklist): Fill handle (formula copy — dhyaan do: cell reference auto badalta hai, $ lagao to fix), absolute reference ($B$2), Sort & Filter (Data tab), Conditional Formatting, Charts, Pivot Table (Insert → PivotTable — advanced), Freeze Panes (View tab — heading scroll me bhi dikhe), Data Validation (dropdown list banana), Page Layout → Print Area + Print Titles (printout ke liye). Viva me "VLOOKUP kya hai?" → table ki pehli column me value dhoondh kar uske saamne wali column ki value laata hai (marksheet me roll number se naam nikalna). 🎯

Bonus Practical 1 — Payroll Sheet (salary calculation) 💼

Aim: Employee ki basic salary se HRA, DA, PF aur Net Salary nikalne wali sheet banana (Excel me percentage aur IF ka practical use).

    A        B        C        D        E       F        G       H
1   Emp      Basic    HRA(10%) DA(5%)  PF(12%) Gross    Deduct  Net
2   Ansh     20000    =B2*0.10 =B2*0.05 =B2*0.12 =B2+C2+D2 =E2     =F2-G2
3   Priya    25000    (fill handle se neeche drag karo — formulas copy)

Har column me kya ho raha hai:
  HRA   = 10% of basic      → =B2*0.10        (ya =B2*10/100)
  DA    = 5% of basic       → =B2*0.05
  PF    = 12% of basic      → =B2*0.12        (deduction)
  Gross = Basic + HRA + DA  → =SUM(B2:D2)
  Net   = Gross − PF        → =F2-G2

Bonus: =IF(H2>30000,"High","Normal") — salary category column
        =ROUND(F2,0) — decimals hata do
        Conditional Formatting → Data Bars se "Net" column ko
        visual bar de do (dashboard look) 📊

Viva point: "Gross aur Net salary me difference?" → Gross = total kamai (basic + allowances), Net (take-home) = Gross − deductions (PF, tax). "SUM(B2:D2) ka matlab?" → B2 se D2 tak (B2 + C2 + D2) — colon ka matlab "range", comma ka matlab "aur" (=SUM(B2,D2) sirf do cells).

Bonus Practical 2 — Result Analysis with COUNTIF / COUNTIFS 🔍

Aim: Marksheet me se "kitne pass hue, kitne fail, kitne A grade" — aise summary counts nikalna (COUNTIF wala real-world use).

=COUNTIF(H2:H60,"Pass")          → kitne students pass hue
=COUNTIF(H2:H60,"Fail")          → kitne fail hue
=COUNTIF(G2:G60,"A")             → kitne A grade wale
=COUNTIFS(C2:C60,">=75",D2:D60,">=75") → dono subjects me 75+ (2 conditions)
=SUMPRODUCT(B2:B60)/COUNT(B2:B60) → class ka average (bina cell-by-cell)
=MAX(E2:E60) aur =MIN(E2:E60)     → highest aur lowest total

Phir: Insert → Column chart se "Pass/Fail" ka count graph banao,
ya Pie chart se grade-wise % dikhao (best in class summary) ✅

Viva point: "COUNTIF aur COUNTIFS me farak?" → COUNTIF me ek condition, COUNTIFS me ek se zyada (aur sab sach honi chahiye). "Criteria me symbol kahan se?" → text quotes me ("Pass"), numbers comparison >= 75 quotes me (">=75") — ye chhota detail examiner ka favourite sawaal hai. 🔍

Excel shortcuts + chart formatting checklist ⌨️

Chart ka full-marks checklist (ye 5 cheezein dikhao): (1) Chart title jo batata ho kya dikha rahe ho (2) axis titles (X = students, Y = marks) (3) data labels (bar par value) (4) legend — kaunsa colour kya (5) gridlines/formatting halki (zyada gridlines = gandha chart). Aur chart ke neeche ek line ka conclusion likho ("Priya sabse aage hai, Amit ko improvement chahiye") — ye Word/Excel practical ko "report" bana deta hai, aur examiner impress hota hai 😄✅

BCA101P — C PROGRAMS (Computer Fundamental Lab list)

Ye 11 programs aapke BCA101P (Computer Fundamental & IT lab) ke C list hain — simple se shuru karke step-by-step. Har program ke saath diya hai: Aim → Algorithm → Code → Output → "Line-by-line samjho" → Viva point. Lab file me likhne ka yahi sequence hai, aur practical exam me bhi yahi order me likhna best hai. 💻

1. Temperature: Celsius → Fahrenheit 🌡️

Aim: Input me di gayi Celsius temperature ko Fahrenheit me convert karna.

Algorithm: Start → c (Celsius) read karo → f = (c × 9 / 5) + 32 → f print karo → Stop.

#include <stdio.h>
int main() {
    float c, f;
    printf("Enter temperature in Celsius: ");
    scanf("%f", &c);
    f = (c * 9 / 5) + 32;          // formula: F = C×9/5 + 32
    printf("%.2f Celsius = %.2f Fahrenheit", c, f);
    return 0;
}
Input: 38  →  Output: 38.00 Celsius = 100.40 Fahrenheit
(Aur idea: 0°C = 32°F, 100°C = 212°F — formula ke andar yahi khayal hai)

Line-by-line samjho: float isliye liya kyunki temperature decimal me hota hai (int me .5 kat jaata) • printf sirf message dikhata hai, scanf actual value leta hai • %f float ke liye — scanf me &c (address) dena zaroori hai • 9/5 ko bracket me rakha — warna integer division 9/5 = 1 ho jaata (0.5 se galat answer!) • %.2f ka matlab "2 decimal places tak print karo" • return 0 = program successful khatam.

Viva point: "Agar float ki jagah int lete to?" → 38.5 → 38 ban jaata (decimal khatam) aur answer galat aata; isliye input decimal ho to float/double use karo.

2. Simple Interest & Compound Interest 💰

Aim: Principal, Rate aur Time input lekar Simple Interest (SI) aur Compound Interest (CI) nikalna.

Algorithm: Start → p, r, t read karo → si = (p × r × t) / 100 → ci = p(1 + r/100)^t − p → dono print karo → Stop.

#include <stdio.h>
#include <math.h>
int main() {
    float p, r, t, si, ci;
    printf("Enter Principal, Rate, Time: ");
    scanf("%f %f %f", &p, &r, &t);

    si = (p * r * t) / 100;                 // SI = P×R×T/100
    ci = p * pow((1 + r / 100), t) - p;     // CI = P(1+R/100)^T − P

    printf("Simple Interest = %.2f\n", si);
    printf("Compound Interest = %.2f\n", ci);
    return 0;
}
Input: 10000 5 2
Simple Interest = 1000.00
Compound Interest = 1025.00
(Kyun CI zyada? Kyunki CI me "interest pe bhi interest" milta hai 😄)

Line-by-line samjho: #include <math.h> iss program me isliye lagta hai kyunki pow() function use kiya (power nikalta hai) • pow((1 + r/100), t) = (1 + R/100)^t — pow ka first argument base, second exponent • CI me sirf interest nikaalne ke liye akhir me − p kiya (total amount − principal) • CI hamesha SI se zyada ya barabar hota hai (compound me interest par bhi interest lagta hai) • Ek hi scanf me teen values: "%f %f %f" — user space ya enter se teeno de sakta hai.

Viva point: "SI aur CI me basic difference?" → SI sirf principal par lagta hai (har saal same), CI principal + jama hua interest dono par lagta hai (isliye badhta jaata hai). Formula bhi yaad rakho: SI = PRT/100 • CI = P(1+R/100)ᵗ − P.

3. Total Salary (HRA 3% + TA 5% + DA 3%) 🧾

Aim: Basic salary input lekar HRA, TA, DA aur Total Salary calculate karna (percentage wale components ke saath).

Algorithm: Start → basic read karo → hra = 3% of basic, ta = 5%, da = 3% → total = basic + hra + ta + da → sab print karo → Stop.

#include <stdio.h>
int main() {
    float basic, hra, ta, da, total;
    printf("Enter Basic Salary: ");
    scanf("%f", &basic);

    hra = 0.03 * basic;     // HRA = 3% of basic
    ta  = 0.05 * basic;     // TA  = 5% of basic
    da  = 0.03 * basic;     // DA  = 3% of basic
    total = basic + hra + ta + da;

    printf("HRA = %.2f\nTA = %.2f\nDA = %.2f\n", hra, ta, da);
    printf("Total Salary = %.2f", total);
    return 0;
}
Input: 20000
HRA = 600.00   TA = 1000.00   DA = 600.00
Total Salary = 22200.00

Line-by-line samjho: "3% of basic" = basic × 3 / 100 = 0.03 × basic (dono tarike sahi, par decimal se code chhota) • Ek printf me teen values — format string me teen % aur comma ke baad teen variables, order same hona chahiye • \n line change ke liye • Total me sab components jod diye (deduction jaise PF/tax nahi diye — question me na ho to add nahi karte).

Viva point: "HRA, TA, DA ke full form?" → House Rent Allowance, Travel Allowance, Dearness Allowance. "Agar basic = 20000, HRA 3% ka 600 hua — 3% nikaalne ka dusra tarika?" → (basic × 3) / 100 = 600 (dono same). Punch line: percentage wale sawaalon me formula + ek example likhna must hai. 🧮

4. Swap Two Numbers — with third variable 🔄

Aim: Do numbers ki values ko ek temporary (third) variable ki madad se exchange karna.

Algorithm: Start → a, b read karo → temp = a → a = b → b = temp → naye a, b print karo → Stop.

#include <stdio.h>
int main() {
    int a, b, temp;
    scanf("%d %d", &a, &b);
    printf("Before: a=%d b=%d\n", a, b);

    temp = a;     // a ko temp me rakha
    a = b;        // b ki value a me
    b = temp;     // temp (purana a) b me

    printf("After : a=%d b=%d", a, b);
    return 0;
}
Input: 10 20  →  After: a=20 b=10
(Glass analogy: do glass ka paani exchange karna — ek khaali glass (temp) chahiye!)

Line-by-line samjho: Sequence hi sab kuch hai — agar seedha a = b karte to a ki purani value hamesha ke liye gayab ho jaati! Isliye pehle temp = a (backup), phir a = b, phir b = temp (backup wapas) • Ye 3-line magic swap ka standard tarika hai — interviews aur viva dono me poochha jaata hai.

Viva point: "Temp variable ke bina swap ho sakta hai?" → Haan (a = a + b; b = a − b; a = a − b wala tarika — agla program) — par safe/recommended third variable wala hi hai (bade numbers me addition overflow kar sakta hai).

5. Swap Two Numbers — without third variable ✨

Aim: Bina kisi extra variable ke, sirf addition-subtraction (ya XOR) se do numbers swap karna.

Algorithm: Start → a, b read karo → a = a + b → b = a − b → a = a − b → print karo → Stop.

#include <stdio.h>
int main() {
    int a, b;
    scanf("%d %d", &a, &b);
    printf("Before: a=%d b=%d\n", a, b);

    a = a + b;     // a = 10+20 = 30
    b = a - b;     // b = 30-20 = 10 (purana a)
    a = a - b;     // a = 30-10 = 20 (purana b)

    printf("After : a=%d b=%d", a, b);
    return 0;
}
Input: 10 20  →  After: a=20 b=10 ✔  (bina khaali glass! 😄)
Note: XOR method bhi hota hai: a = a^b; b = a^b; a = a^b;

Line-by-line samjho: Pehle step me a me dono ka jod chala gaya (30) — isliye ab b nikaalne ke liye 30 − 20 = 10 kiya • Teesre step me naya a = 30 − 10 = 20 • Logic: "sum me se ek number hata do to doosra mil jaata hai" • XOR (^) method me bitwise magic hota hai — a^a = 0 aur x^0 = x wali property se swap hota hai (dono methods viva me likh do — bonus 👍).

Viva point: "Is method ka nuksaan?" → bahut bade numbers par a + b integer range se bahar (overflow) ja sakta hai — isliye real projects me temp variable ya XOR use hota hai.

6. Area & Circumference of Circle ⭕

Aim: Radius input lekar circle ka area (πr²) aur circumference (2πr) nikalna; #define se constant (PI) ka use samajhna.

Algorithm: Start → r read karo → area = π r² • circ = 2 π r → dono print karo → Stop.

#include <stdio.h>
#define PI 3.14159
int main() {
    float r, area, circ;
    scanf("%f", &r);
    area = PI * r * r;       // Area = πr²
    circ = 2 * PI * r;       // Circumference = 2πr
    printf("Area = %.2f\nCircumference = %.2f", area, circ);
    return 0;
}
Input: 7  →  Area = 153.94, Circumference = 43.98

Line-by-line samjho: #define PI 3.14159 = "preprocessor directive" — compiler code likhne se pehle poore program me PI ki jagah 3.14159 rakh deta hai (isse symbolic constant kehte hain; value badalni ho to sirf ek jagah badlo) • πr² ko C me r*r likhna padta hai (r² ka koi direct symbol nahi) • Area/circumference decimal me aata hai, isliye float + %.2f.

Viva point: "#define aur const me difference?" → #define preprocessor level par text replace karta hai (koi memory nahi), const ek variable hai jiski value badal nahi sakte. Aur: "PI ki value 22/7 se kyun nahi likhi?" → 22/7 = 3.1428… approximate hai; integer division 22/7 = 3 ho jaata (donon int) — isliye decimal value likhna safe hai.

7. Ternary Operator (largest of two) ⚖️

Aim: Conditional (ternary) operator ? : ka use karke do numbers me bada number nikalna — if-else ka one-line version.

Algorithm: Start → a, b read karo → big = (a > b) ? a : b → big print karo → Stop.

#include <stdio.h>
int main() {
    int a, b, big;
    scanf("%d %d", &a, &b);
    big = (a > b) ? a : b;     // condition ? sach : jhoot
    printf("Largest = %d", big);
    return 0;
}
Input: 15 42  →  Largest = 42

Line-by-line samjho: Ternary operator ka form: condition ? value_if_true : value_if_false • (a > b) sach hua to a, jhoot hua to b — dono me se ek value big me chali gayi (isliye ise "conditional assignment" bhi kehte hain) • Ye if-else ka short form hai par sirf ek expression ke liye — bahut sari conditions ho to if-else better hai.

Viva point: "Ternary operator ke kitne operands hote hain?" → 3 (condition, true-value, false-value) — isliye naam ternary. "Ye kis type ka operator hai?" → Conditional operator, aur C me ye C ka only ternary operator hai (baaki sab unary/binary hain).

8. Roots of Quadratic Equation (ax² + bx + c = 0) 🧮

Aim: a, b, c input lekar quadratic equation ke roots nikalna — discriminant (d) ke aadhaar par teen cases (real & distinct, real & equal, complex).

Algorithm: Start → a, b, c read karo → d = b² − 4ac → agar d > 0: r1, r2 = (−b ± √d)/2a • agar d = 0: r = −b/2a • warna complex roots print karo → Stop.

#include <stdio.h>
#include <math.h>
int main() {
    float a, b, c, d, r1, r2;
    printf("Enter a, b, c: ");
    scanf("%f %f %f", &a, &b, &c);

    d = b * b - 4 * a * c;                  // discriminant

    if (d > 0) {
        r1 = (-b + sqrt(d)) / (2 * a);
        r2 = (-b - sqrt(d)) / (2 * a);
        printf("Real & distinct roots: %.2f and %.2f", r1, r2);
    } else if (d == 0) {
        r1 = -b / (2 * a);
        printf("Real & equal roots: %.2f", r1);
    } else {
        printf("Complex roots: %.2f + %.2fi and %.2f - %.2fi",
               -b/(2*a), sqrt(-d)/(2*a), -b/(2*a), sqrt(-d)/(2*a));
    }
    return 0;
}
Input: 1 -5 6  →  Real & distinct roots: 3.00 and 2.00
(d > 0: do roots, d = 0: ek root, d < 0: complex roots — Sridharacharya formula)

Line-by-line samjho: d (discriminant) hi poore program ka "judge" hai — usse pata chalta hai roots ki nature • sqrt(d) ke liye math.h zaroori • d < 0 par sqrt(negative) nahi hota (error!) isliye sqrt(-d) liya aur "i" (imaginary unit) print kiya • if-else if-else ladder — ek hi case chalega • Har case me %.2f rakha taaki output clean dikhe.

Viva point: "Discriminant kya batata hai?" → d > 0 = real & distinct (do alag roots) • d = 0 = real & equal • d < 0 = complex/imaginary roots (graph x-axis ko touch nahi karta). Formula: x = (−b ± √(b² − 4ac)) / 2a.

9. Armstrong Number 💪

Aim: Check karna ki input number Armstrong hai ya nahi (3-digit ke liye: har digit ka cube jodkar wahi number aana chahiye).

Algorithm: Start → n read karo → temp = n, sum = 0 → jab tak temp ≠ 0: digit = temp % 10; sum = sum + digit³; temp = temp / 10 → agar sum = n to Armstrong warna nahi → Stop.

#include <stdio.h>
int main() {
    int n, temp, r, sum = 0;
    scanf("%d", &n);
    temp = n;
    while (temp != 0) {
        r = temp % 10;        // digit nikala
        sum += r * r * r;     // cube joda
        temp /= 10;
    }
    if (sum == n)
        printf("%d is Armstrong", n);
    else
        printf("%d is not Armstrong", n);
    return 0;
}
153 = 1³+5³+3³ = 1+125+27 = 153 ✔ Armstrong
370, 371, 407 bhi Armstrong hain (3-digit). 1634 bhi hota hai (4-digit, 4th power se!)

Line-by-line samjho: temp = n isliye kiya kyunki loop me n toot jaata hai (n ki original value compare ke liye chahiye) • temp % 10 = aakhri digit • temp / 10 = aakhri digit hata do (integer division!) • sum += r*r*r me cube joda • Ant me sum == n check — original value se compare • Yehi "digit extraction" trick aage har number program (palindrome, sum of digits, reverse) me kaam aati hai.

Viva point: "Armstrong number ki definition?" → Jis number ke digits ke number-of-digits wale power ka sum us number ke barabar ho (3 digits → cube, 4 digits → 4th power). "4-digit wale program me kya badlega?" → r*r*r*r (ya r ki power n) — isliye general program me power = digits count karke lagate hain.

10. Factorial & 11. Fibonacci Series 🔢

Aim: (10) Kisi number ka factorial nikalna (n! = 1×2×3×…×n) aur (11) n terms tak Fibonacci series print karna (0 1 1 2 3 5 8…).

Algorithm (10): Start → n read → f = 1 → i = 1 se n tak: f = f × i → f print → Stop.
Algorithm (11): Start → a = 0, b = 1 → n read → n baar: a print karo, c = a + b, a = b, b = c → Stop.

// 10. Factorial
#include <stdio.h>
int main() {
    int n, i;  unsigned long long f = 1;
    scanf("%d", &n);
    for (i = 1; i <= n; i++)
        f = f * i;
    printf("%d! = %llu", n, f);
    return 0;
}
Input: 6  →  6! = 720   (5! = 120, 7! = 5040 — yaad rakho!)

// 11. Fibonacci series (0 1 1 2 3 5 8...)
#include <stdio.h>
int main() {
    int n, i, a = 0, b = 1, c;
    scanf("%d", &n);
    for (i = 1; i <= n; i++) {
        printf("%d ", a);
        c = a + b;
        a = b;
        b = c;
    }
    return 0;
}
Input: 8  →  0 1 1 2 3 5 8 13

Line-by-line samjho: Factorial me f = 1 se shuru (0 se shuru karte to har baar 0 hi aata!) • unsigned long long isliye ki factorial bahut jaldi bada hota hai (int me 12!–13! ke baad range khatam) • Fibonacci me a, b, c teen variables: a print karo, c = a + b (next), phir a ko b me aur b ko c me shift karo — "sliding window" technique • 0-based series: 0, 1, 1, 2, 3, 5, 8, 13… (har agla = pichle do ka jod).

Viva point: "Factorial recursion se kaise?" → int fact(n){ return (n<=1) ? 1 : n * fact(n−1); } • "Fibonacci recursion se?" → F(n) = F(n−1) + F(n−2), base case F(0)=0, F(1)=1. "Fibonacci ka real use?" → Nature me sunflower ke seeds, shells ka spiral, aur CS me Fibonacci search/Fibonacci heap. 🌻

SEC101P — PROGRAMMING IN C LAB (saare 16 programs)

P1. Largest of Two / Three Numbers — if aur conditional operator se ⚖️

Aim: Do aur teen numbers me sabse bada number dhoondhna — pehle nested if-else se, phir conditional (ternary) operator se.

Algorithm: Start → a, b, c read karo → agar a ≥ b aur a ≥ c to a largest • warna agar b ≥ a aur b ≥ c to b largest • warna c largest → print → Stop.

/* Largest of THREE numbers — nested if-else se */
#include <stdio.h>
int main() {
    int a, b, c;
    scanf("%d %d %d", &a, &b, &c);

    if (a >= b && a >= c)
        printf("%d is largest", a);
    else if (b >= a && b >= c)
        printf("%d is largest", b);
    else
        printf("%d is largest", c);
    return 0;
}
Input: 12 45 30 → 45 is largest

/* Same with conditional (ternary) operator — ONE LINE me! */
int big = (a > b) ? ((a > c) ? a : c) : ((b > c) ? b : c);
printf("%d is largest", big);

Concept samjho: if-else ladder me pehli condition sach hui to baaki check hi nahi hoti (short-circuit) • && (AND) ka matlab dono conditions sach honi chahiye — isliye "a ≥ b AND a ≥ c" likha • Ternary ka form: (condition) ? true-value : false-value — isme nested ternary se ek hi line me teeno numbers compare ho gaye • Largest nikaalne ka sabse simple tarika: pehle do me bada nikaal lo, phir usse teesre se compare karo big = (a > b ? a : b); big = (big > c ? big : c);

Isme kya sikha: nested if-else vs ternary operator ka use, comparison logic (≥ vs = ke saath sochna), aur "do me se bada" ka pattern.

Viva point + common mistake: (a) "if-else aur ternary me kya chuno?" → simple do-choice ke liye ternary, multi-branch logic ke liye if-else (readability better) (b) common mistake: a > b likh dena jab a == b bhi handle karna ho (equal values par "c is largest" print ho jaata hai) — isliye >= use karo. ✅

P2. Reverse of a Given Number 🔄

Aim: Input number ke digits ko ulta karke print karna (aur bonus me palindrome check karna).

Algorithm: Start → n read → rev = 0 → jab tak n > 0: r = n % 10 (aakhri digit), rev = rev × 10 + r, n = n / 10 → rev print → Stop.

#include <stdio.h>
int main() {
    int n, rev = 0, r;
    scanf("%d", &n);
    while (n > 0) {
        r = n % 10;            // aakhri digit
        rev = rev * 10 + r;    // reverse me joda
        n = n / 10;            // digit hata di
    }
    printf("Reverse = %d", rev);
    return 0;
}
Input: 1234 → Reverse = 4321
Bonus: palindrome check: if (rev == original) print "Palindrome" 😎

Concept samjho: Ye digit manipulation ka universal pattern hai (reverse, palindrome, sum of digits, Armstrong — sab isi par chalte hain):
(1) n % 10 = aakhri digit nikaalo (2) usko naye number me rev × 10 + r se daalo (rev ko ek digit aage shift kiya) (3) n / 10 se aakhri digit hatao (4) loop tab tak jab tak n = 0. Trace (n = 1234): r=4 rev=4 → r=3 rev=43 → r=2 rev=432 → r=1 rev=4321 ✔

Isme kya sikha: loop + % aur / ka digit manipulation — ye "number todna" ka base hai, aage har number program isi se banta hai.

Viva point: "Palindrome check kaise karoge?" → original number ko save karo (temp = n) → reverse nikalo → if (rev == temp) to palindrome (jaise 121, 1331) • "rev ko long kyun lete hain?" → bade numbers ka reverse int ki range se bahar ja sakta hai (overflow) 💡

P3. Prime Numbers from 2 to n 🔢

Aim: 2 se n tak saare prime numbers print karna (prime = jo sirf 1 aur khud se divide ho).

Algorithm: Start → n read → i = 2 se n tak: flag = 1; j = 2 se i/2 tak: agar i % j == 0 to flag = 0, break • agar flag == 1 to i print → Stop.

#include <stdio.h>
int main() {
    int n, i, j, flag;
    scanf("%d", &n);

    printf("Prime numbers from 2 to %d: ", n);
    for (i = 2; i <= n; i++) {
        flag = 1;                       // "ye prime hai" maan lo
        for (j = 2; j <= i / 2; j++) {
            if (i % j == 0) {
                flag = 0;               // kisi ne divide kiya = prime nahi
                break;
            }
        }
        if (flag == 1)
            printf("%d ", i);
    }
    return 0;
}
Input: 30 → 2 3 5 7 11 13 17 19 23 29

Concept samjho: Nested loop — bahar wala loop har number (i) par, andar wala us number ke divisors (j) check karta hai • flag variable = "abhi tak prime hai" assumption; jo bhi divisor mila, flag 0 kar diya • break = ek divisor mil gaya to aage check karne ka koi fayda nahi — loop turant chhodo (efficiency!) • i/2 tak kyun? Kisi number ka divisor i/2 se bada nahi hota (1 ke alawa) — isliye aadha kaam bach jaata hai. Aur behtar: j*j <= i tak check karo (sqrt tak) — aur bhi fast. 🚀

Isme kya sikha: nested loop + flag variable + break — teen cheezein jo har "checking" wale program me kaam aati hain.

Viva point: "1 prime kyun nahi?" → prime ki definition ke liye exactly do factors chahiye (1 aur khud) — 1 ka sirf ek factor hai • "2 hi even prime kyun?" → 2 se bada har even number 2 se divide ho jaata hai • "Sabse bada prime nikaalne ka tarika?" → loop ulta chalao ya list me se last value lo. ⭐

P4. Roots of Quadratic Equation using SWITCH 🔀

Aim: Quadratic equation ke roots nikalna, par is baar switch-case ka use karke — condition (d > 0 / d = 0 / d < 0) ko code (1 / 0 / −1) me convert karke.

Algorithm: Start → a, b, c read → d = b² − 4ac → agar d > 0 to d = 1 • agar d = 0 to d = 0 • warna d = −1 → switch(d): case 1 → do real roots, case 0 → ek root, case −1 → complex roots → Stop.

#include <stdio.h>
#include <math.h>
int main() {
    float a, b, c, d, r1, r2;
    scanf("%f %f %f", &a, &b, &c);
    d = b * b - 4 * a * c;

    // d ki condition ko "1, 0, -1" me convert karo taaki switch chal sake
    if (d > 0) d = 1;
    else if (d == 0) d = 0;
    else d = -1;

    switch ((int)d) {
        case 1:
            r1 = (-b + sqrt(b*b - 4*a*c)) / (2*a);
            r2 = (-b - sqrt(b*b - 4*a*c)) / (2*a);
            printf("Real & distinct roots: %.2f and %.2f", r1, r2);
            break;
        case 0:
            printf("Real & equal roots: %.2f", -b / (2*a));
            break;
        case -1:
            printf("Complex roots: %.2f ± %.2fi",
                   -b/(2*a), sqrt(-(b*b - 4*a*c))/(2*a));
            break;
    }
    return 0;
}
Input: 1 -5 6 → Real & distinct roots: 3.00 and 2.00
Note: switch me case "range" nahi ho sakta (d>0/d=0 direct nahi) — isliye pehle 
condition ko 1/0/−1 me convert kiya. Ye trick examiner ko dikhana! ✔

Concept samjho: switch sirf equality (==) par chalta hai — "d > 0" jaisi range condition direct case me nahi likh sakte! Isliye pehle if-else se d ko 1, 0, −1 me convert kiya, phir switch ke teen cases chalaye • Har case ke ant me break — warna "fall through" hokar neeche wale cases bhi chal jaate (classic bug!) • case −1 me sqrt(-(b²−4ac)) kiya kyunki negative number ka sqrt nahi hota — isliye sign ulta karke magnitude nikala aur "i" print kiya • (int)d isliye ki switch float par nahi chalta — int me cast kiya.

Isme kya sikha: switch ki limitation (sirf equality), aur range conditions ko "code" me convert karke switch me bhejna — ye asli programming thinking hai, ratta nahi.

Viva point: "switch aur if-else me kab kya?" → fixed values (menu 1/2/3, grade 'A'/'B') ke liye switch clean hota hai; range/complex conditions ke liye if-else • "switch me default kyun?" → koi case match na ho to default chalta hai • "break na lagayein to?" → fall-through: neeche ke saare cases execute ho jaate hain. ⚠️

P5. Triangle of Stars ⭐

Aim: Nested loops se pattern print karna — n lines ka right-triangle of stars (aur bonus patterns: ulta triangle, pyramid, diamond, number triangle).

Algorithm: Start → n read → i = 1 se n tak: har line me j = 1 se i tak " * " print karo → newline → Stop.

#include <stdio.h>
int main() {
    int n, i, j;
    scanf("%d", &n);
    for (i = 1; i <= n; i++) {        // lines 1..n
        for (j = 1; j <= i; j++) {    // har line me i stars
            printf("* ");
        }
        printf("\n");
    }
    return 0;
}
Input: 4 →
*
* *
* * *
* * * *


/* BONUS — alag-alag patterns (viva me poochhte hain!) */
// Ulta triangle:  for (i = n; i >= 1; i--)
// Pyramid (center): spaces (n-i) phir stars (2i-1)
// Diamond: pyramid + ulta pyramid
// Number triangle: printf("%d ", j);  j ki jagah i

Concept samjho: Pattern ka poora khel do loop ke rishte me hai — bahar wala loop = kitni lines (rows), andar wala = har line me kitne stars • Yahan andar wala loop i tak chalta hai, isliye pehli line me 1 star, doosri me 2, teesri me 3… (triangle ban gaya) • Debugging trick: stars ki jagah i aur j ki values print karke dekho — pattern ka formula turant samajh aa jaata hai. 🔍

Bonus patterns (viva me poochhte hain — same do-loop logic):

ULTA TRIANGLE:            PYRAMID (centre-star):
for (i = n; i >= 1; i--)   for (i = 1; i <= n; i++)
  for (j = 1; j <= i; j++)   {  spaces (n-i)  ;  stars (2*i - 1)  }

DIAMOND:                  NUMBER TRIANGLE:
pyramid + ulta pyramid    1
(do baar pattern likho)   1 2
                          1 2 3

Ek line me yaad rakho: "outer = lines, inner = per-line content" ✅

Isme kya sikha: nested loops + pattern thinking — ye "thinking" competitive coding me sabse pehle aati hai, aur exam me 5-mark ke program isi se bante hain.

Viva point: "Pyramid me spaces ka formula?" → (n − i) spaces phir (2i − 1) stars • "printf("* ") aur printf("*") me farak?" → pehle me har star ke baad space aata hai (spacing wide), doosre me stars chipke hote hain — examiner output dekh kar concept judge karta hai. ⭐

P6. Largest & Smallest in a List 📋

Aim: User diye gaye n numbers me sabse bada aur sabse chhota number dhoondhna (array/loop ka use karke, bina poora data store kiye).

Algorithm: Start → n read → pehla number read karke big = small = pehla maan lo → baaki n−1 numbers: agar num > big to big = num; agar num < small to small = num → dono print → Stop.

#include <stdio.h>
int main() {
    int n, i, big, small, num;
    scanf("%d", &n);          // kitne numbers
    scanf("%d", &big);
    small = big;              // pehla number hi dono maan lo

    for (i = 2; i <= n; i++) {
        scanf("%d", &num);
        if (num > big)   big = num;
        if (num < small) small = num;
    }
    printf("Largest = %d\nSmallest = %d", big, small);
    return 0;
}
Input: 6 | 45 12 78 3 90 56
Largest = 90, Smallest = 3

Concept samjho: Ise "champion" technique kehte hain — pehle ek number ko champion (big) maan lo, phir har naye number se compare karke chamchampion badalte jao • Yahan tumne array use hi nahi ki — sirf 3 variables (big, small, num) se kaam ho gaya, kyunki hamesha sirf "ab tak ka best" yaad rakhna hai • Dhyaan do: comparison me naya number liya (num), naya variable har baar nahi banaya — memory efficient code. 💡

Isme kya sikha: "pehle maan lo, phir update karo" wala greedy approach, aur loop ke andar input lena (array ke bina bhi data process ho sakta hai).

Viva point: "Array se kaise karte?" → for(i=0;i<n;i++) scanf(&a[i]); phir big = a[0] aur loop me compare • "Second largest kaise nikaloge?" → do variables (big, secondBig) rakho aur update conditions thodi badal do — ye viva me aksar poochha jaata hai! 🥈

P7. Product of Two Matrices ✖️

Aim: Do matrices ka multiplication karna — dimension check (c1 = r2), 2D arrays aur 3 nested loops ke saath.

Algorithm: Start → r1, c1, r2, c2 read → agar c1 ≠ r2 to "multiplication not possible" → matrix A (r1×c1) aur B (r2×c2) read karo → har (i, j) ke liye prod[i][j] = Σ (a[i][k] × b[k][j]) k = 0 se c1−1 → product print → Stop.

#include <stdio.h>
int main() {
    int a[10][10], b[10][10], prod[10][10];
    int r1, c1, r2, c2, i, j, k;

    printf("Rows & cols of A: ");
    scanf("%d %d", &r1, &c1);
    printf("Rows & cols of B: ");
    scanf("%d %d", &r2, &c2);

    if (c1 != r2) {                       // condition check!
        printf("Multiplication not possible (c1 != r2)");
        return 0;
    }

    printf("Enter matrix A:\n");
    for (i = 0; i < r1; i++)
        for (j = 0; j < c1; j++)
            scanf("%d", &a[i][j]);

    printf("Enter matrix B:\n");
    for (i = 0; i < r2; i++)
        for (j = 0; j < c2; j++)
            scanf("%d", &b[i][j]);

    for (i = 0; i < r1; i++) {
        for (j = 0; j < c2; j++) {
            prod[i][j] = 0;
            for (k = 0; k < c1; k++) {            // dot product
                prod[i][j] += a[i][k] * b[k][j];
            }
        }
    }

    printf("Product:\n");
    for (i = 0; i < r1; i++) {
        for (j = 0; j < c2; j++)
            printf("%d ", prod[i][j]);
        printf("\n");
    }
    return 0;
}
A = [1 2; 3 4], B = [5 6; 7 8]
Product: 19 22
         43 50       (Maths Unit 1 wala hi kaam, ab C me! 😄)

Concept samjho: Matrix multiplication ka rule: C[i][j] = A ki i-th row · B ki j-th column ka dot product • Isliye teen loops: i (row), j (column), k (dot product ke liye) • Aur sabse pehle validation: agar c1 ≠ r2 to multiply hi nahi hoga — agar check na lagao to galat result aa sakta hai ya program crash • A = [1 2; 3 4] aur B = [5 6; 7 8] ka product [19 22; 43 50] aata hai — yahi Maths Unit 1 (matrices) me padha tha, ab code me! 😄

Isme kya sikha: 2D arrays (double subscript), 3 nested loops, dimension validation — aur Maths ka concept code me convert karna.

Viva point: "c1 = r2 kyun zaroori?" → pehli matrix ke columns (c1) aur doosri ke rows (r2) barabar nahi hue to dot product hi nahi ban sakta • "2D array kaise declare karte hain?" → int a[10][10]; (rows × columns) • "Kya result ka size?" → r1 × c2 ✔

P8. GCD of Two Numbers — Iteration aur Recursion dono 🌀

Aim: Do numbers ka GCD (Greatest Common Divisor / HCF) nikalna — pehle loop (Euclid's algorithm) se, phir recursion se.

Algorithm: Start → a, b read → jab tak b ≠ 0: t = b; b = a % b; a = t → a print (iterative). Recursive: gcd(a,b) = gcd(b, a % b), base case b = 0 → a.

/* (a) Iteration se (Euclid's algorithm) */
#include <stdio.h>
int main() {
    int a, b, t;
    scanf("%d %d", &a, &b);
    while (b != 0) {
        t = b;
        b = a % b;      // remainder
        a = t;
    }
    printf("GCD = %d", a);
    return 0;
}
Input: 36 60 → GCD = 12

/* (b) Recursion se */
int gcd(int a, int b) {
    if (b == 0)
        return a;                  // base case
    return gcd(b, a % b);          // khud ko chhote input se call
}
gcd(36, 60) → gcd(60, 36) → gcd(36, 24) → gcd(24, 12) → gcd(12, 0) → 12 ✔

Concept samjho (Euclid's algorithm): "Do numbers ka GCD = chhote number aur uske shesh (remainder) ka GCD" — bas yahi soch loop me utaar di. Trace (36, 60): gcd(36,60) → gcd(60, 36) → gcd(36, 24) → gcd(24, 12) → gcd(12, 0) → 12 ✔ • Recursion me do cheezein must hain: (1) base case — b == 0 par rukna (2) recursive step — khud ko chhote input (a % b) se call karna. Base case ke bina infinite recursion → stack overflow 🚨

Isme kya sikha: Euclid's algorithm (duniya ke sabse purane algorithms me se ek), aur ek hi problem ke do solutions — iteration vs recursion ka comparison.

Viva point: "Recursion vs iteration — kaunsa better?" → iteration fast + memory kam; recursion chhota + elegant (par har call stack me space leti hai) • "GCD ka real use?" → fractions simplify karna, LCM nikalna (LCM = a×b/GCD), cryptography/RSA me modular arithmetic 🔐

P9. Storage Classes Illustration 🗄️

Aim: C ke storage classes (auto, static, register, extern/global) ka behavior dikhana — khaas kar static ka "value yaad rakhna" aur auto ka "reset hona".

Algorithm: Start → ek function demo() banao jisme auto a, static s, register r ho → teeno ko ++ karo aur print karo → main me demo() ko 3 baar call karo → output compare karo → Stop.

#include <stdio.h>

int global = 100;              // static/global — poore program me zinda

void demo() {
    auto int a = 10;           // auto: function khatam, gaya; har call pe naya
    static int s = 0;          // static: value YAAD rehti hai calls ke beech
    register int r = 5;        // register: CPU register me (fastest)

    a++;    s++;    r++;       // teeno badhaye
    printf("auto a = %d, static s = %d, register r = %d, global = %d\n",
           a, s, r, global);
}

int main() {
    demo();   // auto a = 11, static s = 1, register r = 6, global = 100
    demo();   // auto a = 11, static s = 2, register r = 6, global = 100
    demo();   // auto a = 11, static s = 3, register r = 6, global = 100
    return 0;
}
OUTPUT:
auto a = 11, static s = 1, register r = 6, global = 100
auto a = 11, static s = 2, register r = 6, global = 100
auto a = 11, static s = 3, register r = 6, global = 100

Dekha? sirf static badhta gaya (1 → 2 → 3) — kyunki wo yaad rakhta hai! 
auto/reset har call pe 11 pe hi raha 😎 — YEHI viva ka jawab hai!

Concept samjho: Storage class 4 cheezein batati hai — (1) kahan store hota hai memory (2) lifetime (kab tak zinda) (3) scope (kahan dikhta hai) (4) default value.
• auto → stack par, function khatam = gaya, har call pe naya (isi liye a har baar 11) • static → program ki poori life, ek hi baar initialize, value retain hoti hai (isi liye s 1 → 2 → 3) • register → CPU register me rakhta hai (fast, par limit) — address nahi le sakte • global/extern → poori file me kahin se bhi accessible (yahan global = 100) • Default value: auto/register = garbage, static/global = 0.

Isme kya sikha: char storage classes ka difference aur "static" ka jaadu — function calls ke beech value retain karna. Viva me common concept to practise! ⭐

Viva point: "static ka real use?" → function call count karna (jaise "kitni baar call hua"), unique ID generator, aur memory bachana (baar-baar memory allocate nahi karni padti) • "extern kab?" → ek file me bani global variable ko doosri file me use karna — large projects me 💼

P10. Call by Value vs Call by Reference 🔄

Aim: Function me argument bhejne ka call by value dikhana aur pointer pass karke caller ke variables par reference-style modification demonstrate karna (syllabus terminology: “call by reference”). Strictly speaking, C itself passes all arguments by value; a pointer value is copied, then dereferenced to modify the pointed-to object.

Algorithm: Start → do functions banao: swapValue(x, y) int leta hai, swapRef(*x, *y) pointer leta hai → main me a = 10, b = 20 le kar dono functions call karo → har call ke baad main ki values print karke difference dekho → Stop.

#include <stdio.h>

void swapValue(int x, int y) {         // copies aayi
    int t = x;  x = y;  y = t;
    printf("Andar (value):     x=%d y=%d\n", x, y);
}

void swapRef(int *x, int *y) {         // addresses aaye
    int t = *x;  *x = *y;  *y = t;
    printf("Andar (reference): x=%d y=%d\n", *x, *y);
}

int main() {
    int a = 10, b = 20;

    swapValue(a, b);
    printf("main me (baad value):     a=%d b=%d\n", a, b);   // 10 20 — no change!

    swapRef(&a, &b);
    printf("main me (baad reference): a=%d b=%d\n", a, b);   // 20 10 — changed ✔
    return 0;
}
OUTPUT:
Andar (value):     x=20 y=10
main me (baad value):     a=10 b=20    ← original safe!
Andar (reference): x=20 y=10
main me (baad reference): a=20 b=10    ← original badal gaya ✔

Concept samjho: Call by value me function ko photocopy milti hai — function andar change kar sakta hai, par original safe rehta hai (main me a = 10, b = 20 waise hi) • C pointer-based reference-style modification me pointer ki copy function ko milti hai; dereference karke pointed-to original value badal sakte hain (a = 20, b = 10) • Pointer ke do operators: & = "ka address do" (call ke waqt) aur * = "us address ki value" (function ke andar).

Isme kya sikha: value = photocopy, reference = original ka pata; aur pointer ka practical use — "function se multiple values wapas laana" isi kaam aata hai (jaise min-max ek saath nikalna).

Viva point: "C me default kya hai?" → C hamesha call by value karta hai; hum pointer bhej kar call by reference ka effect banate hain (C++ me & se true reference hai) • "Array bhejne par kya hota hai?" → parameter array notation pointer me adjust hota hai; pointer value by value pass hoti hai, aur pointed elements modify karne se original array badal sakta hai ⚠️

P11. Count Occurrences of Each Alphabet (command line arguments) 🔤

Aim: Command line se diye gaye text me har alphabet kitni baar aaya — uska count karna (argc/argv ka use).

Algorithm: Start → command line arguments (argv) lo → count array (26 zeros) banao → har argument ke har character ko lowercase karke check: agar 'a'–'z' hai to count[ch − 'a']++ → jo counts > 0 hain unko print karo → Stop.

#include <stdio.h>
#include <ctype.h>

int main(int argc, char *argv[]) {
    int count[26] = {0};
    int i, j;

    // har argument ke har character ko check karo
    for (i = 1; i < argc; i++) {
        for (j = 0; argv[i][j] != '\0'; j++) {
            char ch = tolower(argv[i][j]);
            if (ch >= 'a' && ch <= 'z')
                count[ch - 'a']++;       // a=0, b=1, c=2... position
        }
    }

    for (i = 0; i < 26; i++)
        if (count[i] > 0)
            printf("%c : %d\n", 'a' + i, count[i]);
    return 0;
}
Command: prog hello bca
Output:
a : 1
b : 1
c : 1
e : 1
h : 1
l : 2
o : 1

Note: Turbo C me "Arguments" alag set karte hain; modern IDE/terminal me
program ke aage likh do: ./a.out hello bca

Concept samjho: argc = arguments ka count (program ka naam bhi ginte hain, isliye loop 1 se shuru), argv = arguments ka array (argv[0] = program ka naam, argv[1], argv[2]… actual words) • count[26] = {0} se saare counters zero ho gaye • Sabse badiya trick: count[ch − 'a'] — character ko array index me badal diya ('a' − 'a' = 0, 'b' → 1, … 'z' → 25) — isi ko "hashing ka basic idea" kehte hain! 🎯 • tolower() se small/capital ka farak khatam kar diya.

Isme kya sikha: argc/argv (command line se input), frequency counting ki technique, aur character → index wala conversion.

Viva point: "Turbo C me arguments kaise do?" → Options → Arguments (ya modern terminal me: ./a.out hello bca) • "argv ka type kya hai?" → char *argv[] (strings ka array) • "Ye counting technique ka real use?" → word frequency, vote counting, histogram, hashing 🔤

P12. enum Data Type Illustration 🏷️

Aim: enum (enumeration) data type samajhna — named integer constants banana aur unko readable code me use karna.

Algorithm: Start → enum week {MON…SUN} aur enum status {FAIL, PASS = 33, DISTINCTION = 75} banao → variables me values rakho → internal integer values print karo → condition check karo → Stop.

#include <stdio.h>

enum week { MON, TUE, WED, THU, FRI, SAT, SUN };   // 0,1,2,3,4,5,6
enum status { FAIL, PASS = 33, DISTINCTION = 75 };  // custom values

int main() {
    enum week today = WED;
    enum status result = PASS;

    printf("WED ka internal value = %d\n", today);    // 2
    printf("PASS = %d, DISTINCTION = %d\n", PASS, DISTINCTION);  // 33, 75
    printf("Today is day number %d\n", today + 1);    // 3

    if (result == PASS)
        printf("Student passed ✔\n");
    return 0;
}
OUTPUT:
WED ka internal value = 2
PASS = 33, DISTINCTION = 75
Today is day number 3
Student passed ✔

Idea: enum se code readable ban jaata hai — "2" ki jagah "WED" likhna 
samajhna aasan hai 😄

Concept samjho: enum = apne naam ke integer constants ki list • By default values 0 se shuru hote hain (MON = 0, TUE = 1, … SUN = 6) • Intermediate value de do to uske baad numbering wahin se chalti hai (PASS = 33, DISTINCTION = 75) • Fayda: code me magic numbers (2, 33, 75) ki jagah naam likhte hain — padhne me aasan, galti kam • Andar se ye sab int hi hote hain (isliye printf me %d se print hote hain aur arithmetic bhi chalti hai — today + 1 = 3).

Isme kya sikha: enum = named integer constants — code ko readable banata hai (menu, status, days, months ke liye best).

Viva point: "enum aur #define me farak?" → #define text replace karta hai (type nahi hota), enum ek proper type hai jispar compiler checking karta hai • "enum se kitna memory?" → normally int jitna (jaise 4 byte) • "Real use?" → status codes (PASS/FAIL), menu options, railway/seat classes, game states 🏷️

P13. String Functions (string.h) 📜

Aim: string.h library ke main string functions — strlen, strcpy, strcat, strcmp (aur manual reverse) — ka use dikhana.

Algorithm: Start → do strings lo ("BCA", "Students") → strlen se length, strcpy se copy, strcat se jod, strcmp se compare → result print → ek string ko manual loop se reverse karke print → Stop.

#include <stdio.h>
#include <string.h>

int main() {
    char a[50] = "BCA";
    char b[50] = "Students";
    char c[50];

    printf("strlen(a)   = %d\n", strlen(a));        // 3

    strcpy(c, a);
    printf("strcpy c    = %s\n", c);                 // BCA

    strcat(a, " ");
    strcat(a, b);
    printf("strcat a    = %s\n", a);                 // BCA Students

    printf("strcmp(BCA,BCA)  = %d\n", strcmp("BCA", "BCA"));    // 0 = equal
    printf("strcmp(BCA,ABC)  = %d\n", strcmp("BCA", "ABC"));    // +ve: BCA bada

    printf("strrev-like reverse: ");
    for (int i = strlen(c) - 1; i >= 0; i--)   // manual reverse
        printf("%c", c[i]);
    printf("\n");

    printf("strupr/lwr: %s | %s\n", strupr(c), strlwr(c));  // Turbo C
    return 0;
}
strlen(a)   = 3
strcpy c    = BCA
strcat a    = BCA Students
strcmp(BCA,BCA)  = 0
strcmp(BCA,ABC)  = 66   (positive — BCA pehle aata hai dictionary me)
strrev-like reverse: ACB

Concept samjho (char-by-char): C me string ek char array hoti hai jiska ant '\0' (null character) par hota hai — string functions isi '\0' ko dhoondh kar kaam karte hain • strlen(a) = '\0' se pehle ke characters ginta hai ("BCA" → 3) • strcpy(dest, src) = src ko dest me copy (dest bada hona chahiye!) • strcat(a, b) = b ko a ke ant me jodta hai (a me jagah honi chahiye) • strcmp() ka result number hota hai: 0 = barabar, +ve = pehli string badi, −ve = chhoti — string nahi! (yahan BCA > ABC aaya to positive 66 mila) • Reverse ke liye humne \0 ke pehle se peeche loop chalaya.

Isme kya sikha: string.h ke 4 main functions, string ke andar '\0' ka role, aur strcmp ke return value ka concept.

Viva point: "string aur char array me difference?" → C me alag string type nahi hota; char array + '\0' = string • "strcmp compare kaise karta hai?" → character by character ASCII values compare karta hai (isliye capital letters small se chhote maane jaate hain: 'A' = 65, 'a' = 97) • "gets/puts vs scanf?" → gets poori line (spaces ke saath) leta hai, scanf %s sirf pehla word — modern code me fgets safest hai ⚠️

P14. Count Characters in a File 📁

Aim: Kisi file ko read karke usme total kitne characters hain — count karna (file handling ka poora cycle).

Algorithm: Start → filename input lo → fopen(file, "r") → agar NULL to error message → jab tak fgetc(fp) ≠ EOF: count++ → fclose → count print → Stop.

#include <stdio.h>
#include <stdlib.h>

int main() {
    FILE *fp;
    char filename[50], ch;
    long count = 0;

    printf("Enter file name: ");
    scanf("%s", filename);

    fp = fopen(filename, "r");       // r = read mode
    if (fp == NULL) {
        printf("File open nahi hui! (naam/galat path check karo)");
        return 1;
    }

    while ((ch = fgetc(fp)) != EOF)   // ek-ek character padho
        count++;                      // EOF = End Of File

    fclose(fp);                       // file band karna zaroori!
    printf("Total characters = %ld", count);
    return 0;
}
Enter file name: notes.txt
Total characters = 1240

File handling ke 4 steps yaad rakho: 
fopen → check (NULL?) → fgetc/fputc/fprintf in loop → fclose ✔

Concept samjho: File handling ke 4 steps hamesha yaad rakho: fopen (open) → NULL check (file mili ya nahi) → read/write loop → fclose (band karna zaroori!) • FILE *fp ek "handle" hai — file se baat karne ka pointer • fgetc(fp) file se ek-ek character padhta hai aur aage badhta jaata hai (cursor ki tarah) • EOF = End Of File — file khatam hone par loop ruk jaata hai • NULL check ka matlab: file ka naam galat hua to program crash nahi hoga, saaf message dega ✅

Isme kya sikha: file handling ka poora cycle — fopen/fgetc/fclose, NULL check, EOF concept. Ye C lab ka sabse important "real programming" program hai, aur Project/record me bhi yahi base aata hai.

Viva point: "File ke modes?" → r (read), w (write — purana data delete!), a (append — ant me jodta hai), r+ (read + write), w+, a+, aur binary ke liye rb/wb • "fclose na karein to?" → data buffer se disk par nahi likha jaata (data loss), aur file doosre programs ke liye locked reh sakti hai ⚠️

P15. Structure Student — 10 Students File me 📝

Aim: structure Student (roll_no, name, class, year, total_marks) banakar 10 students ka data input le kar file me save karna (array of structures + fprintf).

Algorithm: Start → struct Student define karo → struct Student s[10] → fopen("students.txt", "w") + NULL check → loop 10 baar: scanf se data lo, fprintf se file me likho → fclose → "save ho gaya" print → Stop.

#include <stdio.h>

struct Student {                     // apna "data type" banaya
    int roll_no;
    char name[30];
    char class[10];
    int year;
    float total_marks;
};

int main() {
    struct Student s[10];            // 10 students ka array
    FILE *fp;
    int i;

    fp = fopen("students.txt", "w");  // w = write mode
    if (fp == NULL) {
        printf("File nahi khuli!");
        return 1;
    }

    for (i = 0; i < 10; i++) {
        printf("Student %d — Roll, Name, Class, Year, Marks: ", i + 1);
        scanf("%d %s %s %d %f", &s[i].roll_no, s[i].name,
              s[i].class, &s[i].year, &s[i].total_marks);

        fprintf(fp, "%d %s %s %d %.2f\n", s[i].roll_no, s[i].name,
                s[i].class, s[i].year, s[i].total_marks);   // file me likho
    }

    fclose(fp);
    printf("10 students ka data students.txt me save ho gaya ✔");

    // (Bonus: same file wapas padho — fehif ("students.txt","r") + fscanf)
    return 0;
}
students.txt me aisa dikhega:
1 Ansh BCA 1 445.50
2 Priya BCA 1 462.00
... (10 lines)

Concept samjho: struct = apna custom data type — alag-alag types ke fields (int roll, char name[], float marks) ek saath ek "record" ban jaate hain • array of structures = records ki table (s[0], s[1], … s[9]) — asli database ki tarah! • Access ka tarika: dot operator — s[i].roll_no (array ka element + struct ka field) • fprintf(fp, "...", ...) = file me formatted writing (printf jaisa, bas FILE pointer extra) • fscanf se file wapas padh sakte hain (record me "read and display" bhi likh do — bonus marks) 💾

Isme kya sikha: structure + array of structures + file writing — ye "mini database" ka base hai, aur aage ke C projects (library management, student record) isi pattern par bante hain.

Viva point: "struct aur array me difference?" → array me same type ke elements, struct me alag-alag types ke fields • "sizeof(struct)?" → saare fields ka total (padding ke saath) • "Name me scanf(\"%s\") ka nuksaan?" → naam me space nahi aata (jaise "Ansh Kumar" ka sirf "Ansh") — isliye fgets ya gets (par gets unsafe) • "File already exists to?" → "w" mode use karte hi file khaali ho jaati hai (dhyaan!) ⚠️

P16. Copy File — Lowercase → UPPERCASE 🔠

Aim: Ek file ko doosri file me copy karna, saath hi saare small (lowercase) letters ko CAPITAL (uppercase) me badal dena — character-by-character processing.

Algorithm: Start → src = fopen("input.txt", "r") + NULL check → dest = fopen("output.txt", "w") → jab tak fgetc(src) ≠ EOF: agar 'a'–'z' hai to toupper() → fputc(ch, dest) → dono files fclose → message print → Stop.

#include <stdio.h>
#include <ctype.h>

int main() {
    FILE *src, *dest;
    char ch;

    src = fopen("input.txt", "r");
    if (src == NULL) {
        printf("Source file nahi mili!");
        return 1;
    }
    dest = fopen("output.txt", "w");

    while ((ch = fgetc(src)) != EOF) {
        if (ch >= 'a' && ch <= 'z')
            ch = toupper(ch);        // small → CAPITAL
        fputc(ch, dest);             // destination me likho
    }

    fclose(src);
    fclose(dest);
    printf("File copy ho gayi (lowercase → UPPERCASE) ✔");
    return 0;
}
input.txt :  "bca first semester" 
output.txt:  "BCA FIRST SEMESTER"

Note: ctype.h ke toupper/tolower hi asli kaam kar rahe hain — 
condition: sirf lowercase letters badlenge, baaki characters (space, ., numbers) same rahenge!

Concept samjho: Ek saath do files — ek read mode me (src), ek write mode me (dest) • Loop me ek character src se uthao → transform karo → dest me likho (bilkul assembly line ki tarah) • toupper() (ctype.h) sirf lowercase letters ko badalta hai; baaki characters (space, '.', digits) waise hi rahenge — isliye condition lagayi (ch ≥ 'a' && ch ≤ 'z') • EOF par loop rukta hai aur dono files band ho jaati hain • Isi logic se "file copy" ka general program banta hai — bas conversion hata do (toupper ki line delete) 😄

Isme kya sikha: do files ek saath handle karna (read + write), character-by-character processing, toupper/tolower ka use — "file copy with transformation" ek real utility program hai.

Viva point: "File copy ka command?" → Linux/mac me cp, Windows me copy — par humne yahan apna program likha (logic clear karne ke liye) • "Binary file copy me kya badlega?" → rb/wb modes + fread/fwrite (fgetc/fputc nahi, warna special bytes/garbage handle karna mushkil) • "tolower/toupper kahan define hain?" → ctype.h 🔠 | "Sirf letters badalne ke liye condition kyun?" → taki punctuation aur digits na badlein.

VIVA QUESTIONS — dono labs (iskar jawab ready rakho) 🎤

Clear explanations and correct terminology are useful in a viva. The questions below are practice prompts for the computer and C labs, followed by record/preparation topics. Answer concisely, but explain further when asked; these notes do not predict the viva questions. ✅

C Lab (SEC101P) — viva favourite questions

Computer Lab (BCA101P) — viva favourite questions

Program-wise viva (jo programs me use hua — seedha jawab)

Practical exam ke rules / lab file wale questions

➕ EXTRA — Lab File (Record) ka Complete Format + Marks Checklist 🗂️

Print/submission checklist (submit karne se pehle apne aap se poochho)

• Har practical ka Aim likha hai? ✔
• Algorithm/Procedure 3+ steps me hai (Ribbon path ya logic steps)? ✔
• Code neat, indented hai aur comments wala hai? ✔
• Output ka printout/screenshot chipka hua hai (input value ke saath)? ✔
• Result line har practical me likhi hai? ✔
• Index + page numbers + date complete hai? ✔
• Word/Excel ke practical me steps + screenshot dono hain? ✔
• Handwriting padhne layak hai aur pages phate nahi hain? ✔

➕ EXTRA — Practical Exam: Sample Paper + Attempt Strategy 🎯

Sample Set A — SEC101P (C Lab)

Sample Set B — BCA101P (Word/Excel Lab)

➕ EXTRA — 70 Rapid-Fire One-Liners (last-mile revision) ⚡

WORD (BCA101P)
1.  Ctrl + N = new document, Ctrl + S = save, Ctrl + P = print
2.  Ctrl + B / I / U = bold / italic / underline
3.  Ctrl + E = centre align (L left, R right, J justify)
4.  Superscript = Ctrl + Shift + + (x²) ; Subscript = Ctrl + = (H₂O)
5.  Insert → Table = table banana; Merge Cells = cells jodna
6.  Table Design → Shading = header row ka colour
7.  Insert → Shapes = flowchart ke symbols (oval, rectangle, diamond…)
8.  Ctrl + G = shapes ko group karna (ek unit)
9.  Mailings → Start Mail Merge → Letters = mail merge shuru
10. Insert Merge Field = «Name» jaise placeholders daalna
11. Data source = recipient list (Name, City, Amount…)
12. Mail merge ke 3 parts = main document + data source + merged doc
13. File → Save As → PDF = document PDF me convert
14. Design → Page Borders = page ke chaaron taraf border
15. Insert → Symbol = π, α, °, ≥, √ jaise symbols
16. Insert → Equation (Alt + =) = E = mc², fraction, root
17. Insert → Pictures + Text Wrapping = image ke aas-paas text
18. WordArt = title ko fancy banane ke liye
19. Review → Spelling & Grammar (F7) = spell check
20. Print Preview (Ctrl + P) = print se pehle layout check

EXCEL (BCA101P)
21. Har formula = se shuru hota hai (=SUM(B2:D2))
22. =SUM(range) total, =AVERAGE(range) average
23. =MAX / =MIN = sabse bada / chhota
24. =COUNT sirf numbers ginta hai, =COUNTA bhare cells
25. =IF(condition,"Pass","Fail") = condition wala result
26. Nested IF = grade system (90+ A, 75+ B, 60+ C, 33+ D)
27. Absolute reference = $B$2 (F4 se lagta hai), copy karne par fixed
28. Fill handle = cell ka corner square → drag = formula copy
29. Percentage = marks/total*100 (aur =ROUND(value,2) se 2 decimal)
30. Conditional Formatting = condition par colour (Fail = red)
31. Insert → Charts = Column/Bar (comparison), Line (trend),
    Pie (hissa), XY Scatter (relation)
32. Move Chart → New Sheet = chart alag sheet par
33. Data → Sort = order laga, Filter = chhupa kar sirf zaroori dikhao
34. Freeze Panes (View) = scroll me heading fixed
35. #DIV/0! = zero se divide; #VALUE! = text ko number samjha
36. #NAME? = function ka naam galat; ##### = column chhota
37. Pivot Table = bade data ka summary (group + total)
38. VLOOKUP = pehli column me dhoondh kar saamne wali value
39. Data Validation = cell me dropdown list banana
40. Print Titles + Print Area = printout me heading har page par

C — BASICS (SEC101P)
41. #include <stdio.h> = printf/scanf ke liye; math.h = sqrt/pow
42. main() = program ka entry point; return 0 = success
43. printf("...") = screen par output; scanf("...", &var) = input
44. %d int, %f float, %c char, %s string, %lf double
45. & = address of (scanf me must); * = value at address (pointer)
46. sizeof(int) = 2 byte (Turbo C) / 4 byte (gcc) — machine dependent
47. Integer division: 5/2 = 2 → (float)5/2 = 2.5
48. % (modulus) = remainder — sirf integers par
49. ++i = pehle badhao phir use; i++ = pehle use phir badhao
50. if-else, else-if ladder, switch (sirf equality), default, break
51. while = entry controlled; do-while = exit controlled (kam se kam 1 baar)
52. for = initialization; condition; update — sab ek line me
53. break = loop chhodo; continue = current round skip karo
54. Nested loop = rows × columns (patterns, matrix)
55. Array: int a[10]; index 0 se 9 tak; a[0] = pehla element
56. 2D array: int a[3][4]; element a[i][j]
57. String = char array + '\0' (null character end par)
58. strlen = length, strcpy = copy, strcat = jod, strcmp = compare (0 = equal)
59. toupper/tolower (ctype.h) = case badalna
60. Function: return_type name(parameters){ body } — prototype pehle likho
61. C: all arguments passed by value; a pointer-value parameter can be dereferenced to modify the pointed-to object
62. Recursion = function khud ko call kare + base case (warna stack overflow)
63. static variable = value retain (ek hi baar initialize)
64. auto = har call pe naya (default garbage); register = CPU register
65. enum = named integer constants (0 se shuru, custom value de sakte ho)
66. struct = alag types ke fields ka group; access s.roll ya p->roll
67. File: fopen → NULL check → fgetc/fprintf loop → fclose
68. File modes: r read, w write (data delete!), a append, rb/wb binary
69. EOF = End Of File (−1) — fgetc file khatam hone par deta hai
70. argc/argv = command line arguments (argv[0] = program ka naam)

BONUS — 4 lines jo har exam me kaam aayengi:
  • "Algorithm pehle, code baad me" — examiner isi order par marks deta hai
  • "Output ke saath input likho" — warna print samajh nahi aata
  • "Result line likho" — practical poora lage (Hence, the program …)
  • "Jo aata hai, confidently bolo — viva me ghabrana sabse bada minus hai" 🎤