Maa Bhagwati Institute 1BCA2 Programming Methodology & C Program

UNIT – I

Program Concept, Characteristics of Programming, Various stages in Program

development Programming aids Algorithms, Flow Charts-Symbols, Rules for making
Flow chart, Types of flowchart, Advantage & Disadvantage, Pseudopodia, Decision
Table, Programming techniques & tools Programming Techniques – Top down, Bottom
up, Modular, Structured – Features, Merits & demerits, Comparative Study,
Programming Logic – Simple, Looping, Recursion, Cohesion & Coupling, Programming
Testing & Debugging & Their Tools.

PROGRAM CONCEPT

Program: - dEI;wVj dks fo’ks"k dk;Z djus ds fy;s mi;qDr Øe esa O;ofLFkfr funsZ'kksa
ds lewg dks Program dgrs gSaA tks bUgsa fy[krk mls Programmer dgrs gSaA ,d Program
fodflr djus ds fy;s fuEu pj.k (Step) gksrs gSaA
(a) Program Analysis: - blesa Programmer nh xbZ leL;kvk dks Analysis djrk gSa
rFkk ;g irk yxkus dh dksf'k'k djrk gSa fd bl leL;k dk Computer dh lgk;rk ls
Solving djuk laHko gSa ;k ugha ;g irk djus ds fy;s og ns[krk gsa fd D;k vkSj dSlk
Output vkuk pkfg,A Result ds fy;s D;k&D;k Processing gskxhA vko';d Input
gSa ;k ugha bR;knh Question dk Solution <wa<us ds ckn Programmer dks yxrk
gSa fd Solution Possible gSa rks Programming Next Phase Start gksrh gSaA
(b) Program Design: - General Structure prepared with help of many hools e.g. Flow
chart, Algorithms, Decision Table etc. ftudh lgk;rk ls Programmer leL;k ds
lek/kku dk fp= :ijs[kk rS;kj djrk gSaA
(c) Program Coding: - In this phase Programmer use of programming language.
blesa Programmer rhu eq[; ckrksa dk /;ku j[krk gSaA
(i) Simplicity ljyrk
(ii) Efficient Utilization of memory dk lnqi;ksx
(iii) Least Processing time de le;
(d) Program debugging: - In computer language Bug means Error/2n this phase
programmer remove all of error.
(e) Program Documentation: - bl pj.k esa izksxzkej ,d funsZ'k iqfLrdk rS;kj djrk
gSaA ftlesa Program dks Execution djus ds lHkh funsZ'k fn;s gq, gksrs gSaA
blesa Flow Chart dks Hkh atteched fd;k tkrk gSaA
(f) Program Maintenance: - Program dqN le; rd Execution jgus ds i'pkr~ mlds
ifjorZXu dh vko';drk gks ldrh gSaA ;gh Maintenance dgykrk gSaA
Algorithms: - " fdlh Hkh Programmer dh leL;k dk Øeokj lek/kku ftls fdlh Human
Language tSls Hindi, English esa fy;k x;k gSaA

Q1. rhu fo"k;ksa ds izkIrkad dk dqy izfr'kr fudkyus ds fy; Algorithms fy[kksA
Step 1: - loZizFke rhu vadks yhft;s
Step2: - Step1 esa fy;s x;s rhu vadks dks tksM+ksA
Step3: - Step2 ls izkIr dksM esa 150 dk Hkkx nks (;g ekurs gq, fd izT;sd fo"k; ds
iw.kkZad 50 gSaA)
Step4: - Step3 ls izkIr ifj.kke esa 100 dk Hkkx nksA
Step5: - Step4 ls izkIr ifj.kke dk ekWfuVj ij iznf'kZr djks
Maa Bhagwati Institute 1BCA2 Programming Methodology & C Program

Step6: - lekIr

Q2. rhu vad Copmputer esa Enter djok dj lcls cM+ vad crkvks?
Ans. Step1 – loZizFke rhu vad yhft, Read A,B,C
Step2 - izFke nks la[;k dh rqyuk djks rFkk muesa ls cM+h la[;k dks h esa Store
djksA mls ge fuEu izdkj ls fy[k ldrs gSaA
if (A>B) then set H = A else set H=B
Step3 – rhljh la[;k dh rqyuk H dh la[;k ls djks rFkk ;fn rhljh la[;k H ls cM+h gks
rks mls H esa Store djksA ;g Hkh fuEu izdkj ls fy[k ldrs gSaA if (C>H) then set
H=C
Step4 – H dh la[;k dks Display djksA ;g Hkh fuEu izdkj ls
Display H
Step5 – lekIr
Q3. csps x;s vkbVeksa dh la[;k (Quantity Sold) rFkk bdkbZ ewY; (Unit Price)
dEI;wVjksa esa izfo"B djkdj fMLdkmaV dh x.kuk djksA 'krsZ fuEu izdkj gSa&
1. ;fn Quantity < = 50 rc Discount fcy ewY; dk 10%
2. ;fn Quantity <100 rc Discount fcy ewY; dk 20%
3. ;fn Quantity >100 rc Discount 30%
Ans. Step1: - Read Only and up
Step2: - if Qty <=50 then dis Qty *up&01.
Step3: - if Qty >50 and Qty <=100 then
dis = (Qty * up)* 0.20
Step4: - if Qty >100 then dis = (Qty *up) *0.30
Step5: - Display dis
Step6: - Stop

Q4. ,d d{kk ds 25 fo|kFkhZ ,d ijh{kk esa cSBrs gSaA ,YxksfjFke fof/k }kjk izR;sd fo|
kFkhZ }kjk izkIr fd;s x;s vadks dk ;ksx vkSj mudk izfr'kr Kku dhft,A
Ans. Step1: - izkjaHk
Step2: - Count = 0
Step3: - izR;sd Student ds lHkh fo"k;ks fd vyx&vyx vad nhft;sA
Step4: - lHkh fo|kfFkZ;ksa ds vyx&vyx fo"k;ksa ds vad dks tksfM+;ksA
Step5: - lHkh fo|kFkhZ ds dqy vadks dk izfr'kr fudkfy;s
izfr'kr = dqy ;ksx (vadks dk)
dqy fo"k;
Step5: - dqy ;ksx o izfr'kr dks print djsA
Step5: - Count esa tksfM+;sA
Step5: - D;k Count = 25 gSa ;fn ugha rks in 2 dks tkafp;sA
Step5: - var

FLOW CHART
fdlh Hkh leL;k ds lek/kku ds fodkl dks Symbol esa izLrqr djuk Flow Chart dgykrk gSaA
blesa fuEu Symbols Use esa fy;s tkrs gSaA
1. Terminal Box: - ;g start o stop dks n'kkZus ds dke esa vkrk gSaA blesa ,d rhj vUnj
o ,d Arrow ckgkj tk;sxkA
Maa Bhagwati Institute 1BCA2 Programming Methodology & C Program

2. Input/Output Box: - ;g Flow Chart ls Input Value rFkk Flow Chart ls Output Result
dks n'kkZus ds dke vkrk gSa blesa Hkh ,d rjh vUnj rFkk ,d rhj ckgkj vkrk gSaA

3. Process Box: - ;g Flow Chart esa xf.krh; lehdj.k (Mathematical expression) fy[kus ds
dke vkrk gSaA

4. Decision Box: - ;s flow chart esa Condition n'kkZus ds dke esa vkrk gSaA blesa ,d rhj
vUnj rFkk nks rhj ckgj dh rjQ fudyrs gSa ftuesa ls ,d rhj Condition ds True gksus dh
n'kk esa dh tkuh okyh processing dks n'kkZrk gSa rFkk nwljk rhj Condition ds false
gksus dh fn'kk esa tkus okyh Processing dks n'kkZrk gSaA

T Eg.

5. Connectors: - ;g Flow Chart ds ,d fgLls dks nwljs ls tksM+us ds dke vkrk gSaa
blls ;k rks ,d rhj vUnj dh vksj rFkk ,d rhj ckgkj dh vksj fudyrk gSaA

Eg. A or A

6. Arrow: - ;s Flow Chart esa Processing ds Flow dks n'kkZus ds dke esa vkrk gSaA

FLOW CHARTS RULES OF MAKING

1. Symbols dks mi;ksx esa ysuk ftUgsa design ds fy;s mi;ksx esa fy[kk tkrk gSaA
2. Symbols dks lgh izdkj ls mi;ksx esa fy;k tk,A
3. Flow Chart cukrs le; o muesa Entries djrs le; mudk meaning clear gksuk pkfg,A
4. vUnj rFkk ckgj fudyrs le; Symbols dk /;ku j[kuk pkfg,A
5. Procedure dks 'kq: djrs le; annotation Symbol dks mi;ksx esa fy;k tkuk pkfg,A
6. Charting ds fy;s Three level Symbol dks iz;ksx esa fy;k tkrk gSaA
a) Charting Conventions ds fy;s Basic Symbol dk mi;ksx fd;k tkrk gSaA
b) izk;% System Flow Chart ds vUrxZr Input/Output Special Symbol dks
iz;ksx esa fy;k tkrk gSaA
c) izksxzke Flow Chart ds fy;s izk;% Special Process Symbols dks mi;ksx
esa fy;k tkrk gSaA
Maa Bhagwati Institute 1BCA2 Programming Methodology & C Program

Q. rhu fo"k;ksa ds izkIrkad Øe'k% 39, 42, 47 fn;s x;sa bUgsa Enter djokdj budk ;ksx
vkSlr rFkk izfr'kr Kkr fdft,sA

Start

A=39

B = 42

C = 47

T = A+B+C

AVG = T/3

P = (T/150)*100

Print

Stop

TYPES OF FLOW CHART

Flow Chart 3 izdkj ds gksrs gSaA tks fuEufyf[kr gSaA
1. System Flow chart: - System Analysit ds fy, System Flow Chart dks mi;skx esa
fy;k tkrk gSaA blds vUrxZr System ds Structure o muds chp dh Relationship dks
Flow Chart Symbol ds }kjk iznf'kZr djrs gSaa bl Chart ds }kjk Processing
Operation dk Øe Data Flow rFkk files dks ifjHkkf"kr fd;k tkrk gSaA system dh
design ds fy, bu flow chart dks mi;ksx esa ysrs gSaA system design ds nkSjku
analysis Data Flow ij Exprement djrk gSaA ftlls New Business System dh Design
dks rS;kj fd;k tkrk gSaA tc fdlh working System dks system flow chart ds }kjk
ifjHkkf"kr fd;k tkrk gSa rks og System efficient (fo'oluh;) o accurate gksrk gSaA
Maa Bhagwati Institute 1BCA2 Programming Methodology & C Program

2. Modular Program Flow Chart: - fdlh Hkh dEI;wVj Programs ;k algorithms dks
develop djus ds fy;s bUgsa Program esa fy;k tkrk gSaA Modular Programs ds
vUrxZr Sequence of instruction dks perform fd;k tkrk gSa vkSj ;s Instruction gj
Module ds fy, vyx&vyx gksrs gSaA bl izdkj ds Flow chart dks dHkh&dHkh
Block Diagram Hkh dgk tkrk gSa D;ksafd blds vUrxZr Programmer flQZ
Designing ij Construct djrk gSaA Modular Flow Chart Logical Program dks
cukus ds fy, iz;ksx esa fy, tkrs gSaA ;g System Flow Chart ls vyx gSaA D;ksafd
system Flow chart ds vUrxZr Hardware, Files o Data ds General Flow dks
iznf'kZr fd;k tkrk gSaA tcfd Modular Program ds vUrxZr Flow Chart ds Logical
Steps tSls Input Output Processing vkfn dks Consider djrs gSaA

Detail Program Flow Chart: - ;g ,d Elemental Chart gSa ftls Programmer }kjk mi;ksx
esa fy;k tkrk gSaa gj symbol ,d Executable Step dks iznf'kZr djrk gSaa ftls Computer
Language esa Instruction dk uke fn;k x;k gSaA Program Details Steps dks Detail
Program Flow Chart esa Define fd;k tkrk gSaA tc Coding vyx&vyx Language esa fd tkrh
gSaA D;ksafd gj Language ds vUrxZr Same Types of Operation dks vyx&vyx izdkj ls
define fd;k tkrk gSaA Details Programs Flow chart ds vUrxZr Program ls related gj
Details dks Correct Sequence esa iznf'kr fd;k tkrk gSaA

PSEUDICODE – Flow Chart dh rjg gh pseudo code dks Hkh Problem Analysis ds fy;s
mi;ksx esa fy;k tkrk gSa blds fy;s fuEu Example dks Consider fd;k x;k gSa%&

Program : FEET TO INCHES

Ask user to the value of number of feet
Calculate number of inches
print number of inches
end program

Pseudo Code dks Outline dh rjg ifjHkkf"kr fd;k tkrk gSa bls Simple English Code esa
define fd;k tkrk gSaA Decision Statements o Loops dks vklkuh ls Pseudo code esa define
fd;k tk ldrk gSaA

IF Statement THEN IF X>100 THEN

Procedure 1 Print X
Procedure 2 Print X-1
Procedure 3 Print X+2
Else
Procedure 2 Print 0
Procedure 1
Procedure 4

Decision Table:- Decision tree dk eq[; nks"k bldh jpuk esa Information dh deh gSa Decision
Table Problems dks ifjHkkf"kr djus vkSj fy, tkus okys fu.kZ; dh lwph gS ;g ifjfLFkfr;ksas
vkSj fu.kZ; ds chp lEcU/k gS Decision table nks part gksrs gS : Stub vkSj Entry.
Stub part Hkh nks Hkkxksa esa foHkkftr gksrk gSa mijh Hkkx dks Conditiobn Stub rFkk
uhpyk Hkkx Action Stub dgykrk gSA
Maa Bhagwati Institute 1BCA2 Programming Methodology & C Program

Entry Part Hkh nks Hkkxksa esa foHkkftr gksrk gSa mijh Hkkx dks Conditiobn Entry rFkk
uhpys Hkkx dks Action Entry dgrs gSA

Condition Stub Condition Entry

(a) Wholesaler Y Y Y
(b) Retailer Y Y Y
(c) Order <5000 Y Y
(d) Order >5000 and Y Y
<10000 Y Y
(e) Order > 10000

Action Stub Action Entry

(a) Discount Nil X X
(b) 10% Discount X
(c) 20% Discount X X
(d) 30% Discount Y

Programming Techniques: -
Top Down: - Program ds eq[; Modules (Program dk NksVk l Hkkx) dks iz;ksx esa
fy;k tkrk gSaA bu eq[; Modules dks iqu% Low Level Modules esa devide fd;k tkrk
gSa tc rd fd Problesm dk solution Complete u gks tk, lcls igys Main Modules dks
Implement djrs gSa rFkk ckn esa Subroutines (NksVs&NksVs Programs ds leqg) esa
ckaVk tkrk gSa bls fdlh Hkh Problems dks Step Wise Solution ds fy, mi;ksx esa ysrs
gSaA
Advantage: -
1) Error dks <wa<uk vklku gSa blds vUrxZr igys Sub Programs dks Test
fd;k tkrk gSa ckn esa Main Programming dh testing dh tkrh gSa ;fn dksbZ
Error vxj gksrh gS rks mls Debug djds Solve dj fy;k tkrk gSaA
2) tc fdlh Problem dh Design dks iw.kZ :i ls Design ugha fd;k tkrk rc top-
down approach dks iz;ksx esa ysuk ykHknk;d gSaA
3) development ds nkSjku decision ysuk vklku gksrk gSaA
4) Program dks self pykuk Hkh vklku gksrk gSaA
5) gj Modula viuk dk;Z Lo;a ((Independently) djrk gSaA
Limitation: -
1) tc System Specification dk Kku iw.kZ :i ls gks rHkh Top down Approach dk
mi;ksx djuk pkfg,A
2) Step Wise Solution ds fy, gh Top down approach dk mi;skx gksxkA
3) tc System development 'kq: ls fd;k tkrk gSa rc mi;ksx gksrk gSaA

Bottom Up: - bldk mi;ksx Design ds Part ls 'kq: gksrh gSa vkSj NksVs&NksVs Module
dks bdV~Bk dj Higher Module esa Convert fd;k tkrk gSaA lcls igys Bottom Level
Modules dks Implement djrs gSa] mlds ckn higher level module dks " fd;k tkrk gSaA tc
rd fd Top rd ugha igqap tk;sA Bottom up method abstraction (cka/k dj j[kuk) Layer ds
Maa Bhagwati Institute 1BCA2 Programming Methodology & C Program

lkFk dk;Z djrk gSaa bl Layter ds vUrxZr] NksV&NksVs Operation dks Implement fd;k
tkrk gSa rFkk ckn esa bUgha Operation dk iz;ksx dj Powerful Operation dks Performs
fd;k tkrk gSaA
Advantage: -
1) blds }kjk Program Complexity (tfVyrk) dks Handle fd;k tkrk gSa ftlls Program
Reliable (fo'oluh;) O;ofLFkr curk gSaA
2) Programmers ds }kjk tfVy Programs dks Hkh vlkkuh ls fy[kk tk ldrk gSaA
3) tc Designing Comples gks tc bottom up approach dks mi;ksx esa ysuk
ykHk&nk;d gSaA tSls& OS, Networking Software.
4) Bottom approach layerd architecture dks follow djrh gSaA ftlls Comples Program
dk best Implement fd;k tk ldrk gSaA ftldk iz;ksx real world ds fy;s T;knk gksrk
gSaA
5) iwoZ esa mifLFkr system esa change djus ds fy;s Bottom up approach dk mi;ksx
fd;k tkrk gSaA

Limitation: -
1) fdlh Hkh u;s system dks develop djus ds fy, mi;qDr ugha gSaA
2) ;g Design Label ls 'kq: gksrk gSaA
3) Internal Operation dk Kku gksuk vko';d gSaA
4) Current Layer ij fdu Operation dks mi;ksx esa ysuk gSaA bldk irk yxkuk eqf'dy
gksrk gSaA
Structured Approach: - ;g og Process gSa ftlesa iwjh Problem dks vyx&vyx
NksVs&NksVs Parts esa (Modules esa) divide fd;k tkrk gSaA tSls ;fn Tyre Puncture
Program dks NksV&NksVs Modules esa divide djuk gks rks blds fy, fuEu Procedure dks
mi;ksx esa fy;k tk,xkA
LEVEL1 LEVEL3

Punchwred You Remove LEVEL3

Tyre
Ask ur Friend Drive in ur
LEVEL2 Friend's vehicle
Remove Tyre Ask the mechanic
Take it in public
Take the tyre to You take it Transport
mechanic
Let the mechanic
come & take it
Identify the Puncture
location

Fix the Puncture

mijksDr Problem ds solution dks 4 Levels esa ifjHkkf"kr fd;k x;k gSaA
Advantage: -
1) Program dks c<+kuk o Programs esa Modifications djuk vklku gSaA
2) Structured approach esa hierarchy concept dks mi;ksx esa fy;k tkrk gSaA
3) Modules ds single Entry o exit point gksrs gSaA
4) Errors dks <w¡<us esa le; de yxrk gSa D;ksafd iwjh Problem NksVs&NksVs
Parts esa divide gksrh gSaA
Maa Bhagwati Institute 1BCA2 Programming Methodology & C Program

5) cgqr lkjs Programs Code dks ,d lkFk (yxkrkj) fy[kk ldrs gSaA
6) Structured Programming Standard method gSaA vr% Utility Program ds fy;s de
le; dh vko';drk gksrh gSaA
Structred Programming esa fuEu rduhdksa dks izksxzke esa fy;k tkrk gSa% &
1) Sequence 2) Selection 3) Iteraction
Disadvantage: -
(1) Structure dh Overall complexity dks reduce ugha fd;k tk ldrk gSaA
Modular Approach: - ;fn system dks Modules esa divide fd;k tkrk gsa rks Modules dks
separately solve o Modify fd;k tk ldrk gSa system dks Modules esa Consider fd;k tk ldrk
gSaA ;fn gj Module Separately Implemented gksA ;fn ,d Module esa Change fd;k tk, rks
vU; Modules ij de ls de effect iM+sA
"Module Program dk Logically defined ,d vyx Part gSaA" fdlh Hkh Program dks
fuEu Functional Modules esa define fd;k tkrk gSa% &
(1) Initialization (2) Input (3) Input Data Validation (4) Processing
(5) Output (6) Error handling (7) Closing Procedure
Advantages of Modular Approach: -
(1) gj Module dks vyx ls test fd;k tkrk gSa ftlls errors easily remove gks ldrh gSaA
(2) Modules dks library esa j[kdj mUgsa Programs esa dgha Hkh mi;ksx esa fy;k tk
ldrk gSaA
(3) ,d Module nwljs Module dks mi;ksx esa ys ldrk gSaa
(4) Documentation NksVs&NksVs Modules ds :i esa fd;k tkrk gSaA
(5) Development esa le; de yxrk gSaA
(6) Modules dks define djus ds fy;s gh topdown o bottom up approaches dks iz;ksx
esa fy;k tkrk gSaA

Programming Logic
(1) Simple/Sequence: - Sequence Structure Program ds Sequential Flow dks iznf'kZr
djrk gSaA gj Block ,d Statement dks iznf'kZr djrk gSaA Sequence Structure ds
vUrxZr gj Statement ,d ds ckn nwljh Statement dks Execute djrk gSa vr% fuEu
Order esa Statement dks fy[kk x;k gSa vHkh Order esa Statement dks Execute
fd;k tkrk gSaA blds vUrxZr ,d gh Entry Print o ,d gh Exit Point gksrk gSaA ;g
Program tfVy ugha gksrs gSa rFkk Program dk Flow ,d single Direction esa gksrk
gSaA

(2) Decision/ Branching: - if then Structure ds }kjk Program ds Condition Flow dks
iznf'kZr fd;k tkrk gSaA Program ,d ;k vU; Condition dks Execute dj ldrk gSa tks
fd fdlh ,d condition ij fuHkZj gksrh gSaa Condition ;k rks True gksxh ;k fQj False
Deicsion ysrs le; ;k rks True Condition dks Execute fd;k tk;sxk ;k fQj False
Condition ijUrq iwjs Program ds fy, Exit point ,d gh gksxkA vr% bl Structure esa
Maa Bhagwati Institute 1BCA2 Programming Methodology & C Program

Hkh ,d gh entry point o ,d gh Exit point gksrk gSa vkSj Structure ds vUnj
Multiple Exit Data dks Consider fd;k tkrk gSaA

A B

(3) Loop Structure: - Do while Structure dks Consider fd;k tkrk gSaA tc fdlh
Program dks ckj&ckj Execute djuk gks rks blds fy, Loop Structure dks mi;ksx esa
ysrs gSaA ;fn Loop lgh gSa rks og Infinite Time ugha pysxk blds fy, igys
Condition dks Test fd;k tkrk gSA tc rd Condition True rc rd Loop pysxk ;fn
Condition False gSa rks Exit Statement ij vk tk;sxkA Operation dk Repeat
gksuk ;k Stock gksuk Decision Box ij fuHkZj gksrk gSaA
C

True
A

(4) Recursion: - blds vUrxZr tfVy (Complex) Problems dks NksVk o ljy Format esa
iznf'kZr fd;k tkrk gSaA blds vUrxZr ,d function Lo;a dks Call djrk gSaA ;fn fdlh
Function dks ckj&ckj Loop ds }kjk Execute djrs gSa rks blds LFkku ij Recursion
Technique dks Use esa fy;k tkrk gSaA Recursion nks izdkj dk gksrk gSaA (1)
int run
Direct ()
Recursion (2) Indirectly Recursion int run ( )
{
(1) Direct Recursion: - Direct Recursion esa function { Lo;a dks ckj&ckj call djrk
gSaA ...................... ......................
......................
(2) Indirect Recursion: ......................
- Indirect Recursion esa function fdlh vU; Function dks Call
djrk gSaA...................... ......................
Recursion ds vUrxZr Program esa Terminate Condition dk gksuk
...................... vko';d gSaA
......................
run ( ); run1 ( );
} }
int run1 ( )
(Direct Recursion) {
......................
......................
......................
......................
run ( );
}

(Indirect Recursion)
Maa Bhagwati Institute 1BCA2 Programming Methodology & C Program

Cohesion: - blds }kjk Functionally Related Modules dks ukik tkrk gSaA blds vUrxZr
Modules ds vkfUrjd Interaction dks Increase djrs gSaA Design dk egRoiw.kZ y{; Module
Cohesion dks c<+kuk rFkk coupling dks de djuk lcls csdkj Cohesion esa Modules ds chp
dksbZ Relation Ship ugha gksrh gSaA oks lcls vPNs Cohesion esa gj Function
Independently viuk dk;Z djrk gSa o vko';drk iM+us ij fdlh Hkh Problem dks solve djus ds
fy;s lHkh Functions dks ,d lkFk ,df=r dj fn;k tkrk gSaA

Coupling: - Coupling ds }kjk Modules ds e/; Interdependence Degree dks ekik tkrk
gSaA tc nks Modules tightly Coupled gksrs gSa rks os dBksjrk ls Interconnected gksrs
gSa vkSj nksuks ,d nwljs ij dependent gksrs gSaA Closely Couple System esa Modules
ds e/; dependency ugha gksrh gSaA tcfd Tightly Coupled System ds e/; High dependency
gksrh gSaA Uncouple Modules ds e/; dksbZ Interconnection u gksus ls os Completely
Independent gksrs gSaA Good Designing ds fy;s Modules ds e/; Low Coupling vko';d
gSaA
(ugha Loosely Couple
: Some
) dependence
Uncoupled : no dependence

Highly couple
: many dependencies

TESTING & DEBUGGING

tkap ,oa =qfV fudkyuk% & fdlh Hkh dk;Z ds fy, Computer Program fodflr djus dh
izfØ;k ,d ekuoh; izfØ;k gSaA ftlesa =qfV dh lEHkkouk jgrh gSA Program cukus ds ckn
mls fu:fir djus ls igys iw.kZr;k tkapk tkrk gSa rkfd mlesa jgh x;h =qfV;ksa dks nwj fd;k
tk lds ;g dk;Z Testing and debugging dgykrk gSaA ;g izfØ;k dgh rjg ls iw.kZ djokbZ tk
ldrh gSa ftlesa ls eq[; gSaA
(1) Paper Walk through: - Debugging dh bl fof/k esa ,d Programmer viuk Program
cukus ds ckn fdlh nwljs Programmer dks Program i<+us o tkapus ds fy, fn;k tkrk
gSaA nwljk Programmer dkxt ij gh ml Program dks fØ;kfUor dj mlesa mifLFkr
=qfV;ksa dh tkap djrk gSaA
(2) Test Data: - bl fof/k esa Program dks computer esa fØ;kfUor fd;k tkrk gSaA rFkk
mlesa ,d udyh Data ds Set dks Process djk;k tkrk gSaA ;g Dummy Data fcYdqy
Maa Bhagwati Institute 1BCA2 Programming Methodology & C Program

okLrfod Data dh rjg gh gksrs gSaA blds Process ifj.kke dks tkap dj Program esa
mfiLFkr =qfV;ksa dks igpkuk tkrk gSaA
(3) Software dh tkap% & vktdy dqN ,sls software miyC/k gSa ftudh lgk;rk ls fdlh
Program dh =qfV;ksa dh tkpa dh tk ldrh gSaA ;g Program tc =qfV okys Program
ds lkFk Computer esa fØ;kfUor gksrs gSa rks ;g tkap software ml fØ;kfUor dk
ihNk djrs gSa rFkk le;&le; ij vkus okyh =qfV dks Note dj ysrs gSaA var esa
Programmer pkgrk gSa rks bl tkap Software ls =qfV Report dks Hkh ekax dj ldrk
gSa rFkk fQj mUgsa nwj dj ldrk gSaA