SOFTMAX

ONLINE SCHOOL
Haque Villa, Rangamati Nir, DUET, Gazipur-1707 01784450949, 0967 8677 677 [email protected]

Aa¨vq- 1 wm ‡cÖvMÖvwgs Gi ‡gŠwjK aviYv

❖ mgqUv GLb Z_¨ cÖhyw³i, Avi `iRvq DuwK w`‡”Q PZz_© wkí wecøe| Z‡e GB wecø‡ei fvlv n‡e †cÖvMÖvwgs j¨vs¸‡qR| 1822 mv‡j Pvjm©
e¨v‡e‡Ri wWdv‡iÝ BwÄb Avwe®‹v‡ii ci †_‡K aviYv Av‡m †h, Kw¤úDUvi‡K mwVKfv‡e Pvjv‡bvi Rb¨ wKQz wb‡`k©bvi cÖ‡qvRb| Avi GB
wb‡`k©bv¸‡jvB n‡”Q †cÖvMÖvwgs| A_©vr wKQz wb‡`k©bv ˆZwi K‡i ‡m¸‡jv‡K nvW©Iq¨v‡i cÖ‡mm K‡i KvR m¤ú~b© KivB n‡”Q ‡cÖvMÖvwgs| ïiæi
w`‡K Pvjm© e¨v‡e‡Ri wWdv‡iÝ BwÄb‡K ïay my&BP I wMqvi cwieZ©b K‡i KvR m¤úv`b Kiv n‡Zv| †cÖvMÖvg wj‡L KvR Kvii gZ †Kvb e¨e¯’v
ZLb ˆZwi nqwb| cÖ_g ‡cÖvMÖvwgs A¨vjMwi`g ˆZwi K‡i GKRb bvix hvi bvg Ada loveles| 1883 mv‡j PvjR© e¨v‡e‡Ri A¨vbvwjwUK¨vj
Bwćbi Rb¨ GwU ˆZwi Kiv n‡qwQj| hvi D‡Ïk¨ wQj evBbvwi bv¤^vi wnmve Kiv GwU me©cÖ_g wjwLZ ‡cÖvMÖvwgs fvlv wn‡m‡e aiv nq| Z‡e
1936 mv‡j Ajb‡Rv PvP© I A¨vjvb Uzwis GwUi ¸Qv‡bv iƒc †`b| cÖ_g AvaywbK Kw¤úDUvi¸‡jvi MwZ Ges aviY ÿgZvi w`K w`‡q LyeB
`ye©j wQj| hvi Kvi‡b ‡cÖvMÖvgvi‡`i A‡bKUv †Rvi K‡i A¨v‡m¤^wj fvlvq †cÖvMÖvg wkL‡Z n‡Zv| A¨v‡m¤^wj fvlv‡K ‡gwkb fvlvI ejv nq|
KviY GwU ïay 0 I 1 Gi mgš^q ‰Zwi| GB fvlv w`‡q mivmwi nvW©Iq¨v‡ii mv‡_ †hvMv‡hvM Kiv hvq| wKš‘ GB fvlvq †cÖvMÖvg wjLv I Pvjv‡bv
A‡bK KwVb| GB Rb¨ †cÖvMÖvgviMb cieZ©x‡Z D”PZi †cÖvMÖvwgs fvlvi cÖ‡qvRb Abyfe K‡ib| GiB avivevwnKZvq M‡elKiv wbZ¨bZzb
avibvi Rb¥ Ki‡Z _v‡Kb| 1945 mv‡j Rb fb wbDg¨vb †cÖvMÖvwgs wb‡q `ywU avibv e¨³ K‡ib| hv cieZ©x‡Z †cÖvMÖvwgs †K bZzb av‡c wb‡q
hvq| hvi GKwU n‡jv Shared Program-Technique
Ges wØZxqwU n‡jv Conditional control Transfer. AvaywbK Kw¤úDUv‡ii Rb¨ me©cÖ_g D”PZi †cÖvMÖvwgs fvlv ˆZwi Kiv nq 1945
mv‡j| Rb gKwj ÔkUÕ K‡WvÕ bv‡g GKwU †cÖvMÖvwgs fvlvi cÖ¯Íve †`b Ges DBwjqvg w¯§WU Gi ev¯Íevqb K‡ib| Short code me©cÖ_g
dvskbvj †cÖvMÖvwgs fvlv| Gi †KvW mvaviY gvbyl eyS‡Z cvi‡jI Gi wKQz Amyweav wQj, Avi GB Amyweav `~i Kivi Rb¨ Compiler ‰Zwi
nq| Compiler n‡jv †Kvb †cÖvMÖvg †K †mwkb fvlvq iƒcvšÍi K‡i| cÖ_g compiler hy³ †cÖvMÖvwgs fvlv n‡jv Autocoad| wKšÍ GwU
RbwcÖqZv AR©b Ki‡Z e¨_© nq| cÖ_g RbwcÖq †cÖvMÖvwms fvlv n‡”Q FORTRAN hv IBM ‡Kv¤úvwb 1945 mv‡j ˆZwi K‡ib| hv AvenvIqvi
c~e©vfvm, mgxg Dcv`vb we‡kølY BZ¨vw` wbw`©ó KvR Kiv n‡Zv| 1972 mv‡j †Wwbm wiwP C Programming fvlv ˆZwi K‡ib| hv me †_‡K
RbwcÖq †cÖvMÖvwgs fvlvi GKwU| GwUB cÖ_g wm‡÷g ‡cÖvMÖvwgs fvlv| wm †cÖvMÖwgs fvlv‡K AvaywbK Kw¤úDUv‡ii Mother of Programming
Language ejv nq|

SOS AwZ msw¶ß cÖ‡kœvËi t

*** 1| ‡cÖvMÖvwgs ej‡Z Kx eySvq? evKvwk‡ev- 2001, 02, 05, 06, 10, 11, 13, 13Õcwi, 14, 14Õcwi
DËi t ‡Kvb mgm¨v mn‡R mgvav‡bi D‡Ï‡k¨ Kw¤úDUv‡ii fvlvq avivevwnKfv‡e KZ¸‡jv wb‡`©‡ki mgwó‡K †cÖvMÖvwgs e‡j|

*** 2| †cÖvMÖvwgs j¨vs¸‡qR Kv‡K e‡j? evKvwk‡ev- 2001, 04, 05, 09, 09Õcwi, 10
DËi t ‡h fvlvi mvnv‡h¨ Kw¤úDUv‡i †evaMg¨ wb‡`©kvewj ˆZwi Kiv nq, Zv‡K †cÖvMÖvwgs j¨vs¸‡qR ev †cÖvMÖvwgs fvlv e‡j|

1
* 3| ‡cÖvMÖvwgs j¨v¸‡q‡Ri cÖKvi‡f` ‡jL|
DËi t

Programming languages

Low level Middle level High-level

language language language

Machine language
Assembly language Cobol, Java, Python
Binary code
C, C++

* 4| ‡gwkb j¨vs¸‡qR Kv‡K e‡j?

DËi t ‡h fvlvq mgm¨v mgvav‡bi Rb¨ evBbvwi msL¨v A_©vr 0, 1 e¨envi K‡i †cÖvMÖvg †jLv nq, Zv‡K Machine Language e‡j|
GB fvlvq †jLv Program mivmwi CPU Run Ki‡Z cv‡i| GwU cÖ_g cÖR‡b¥i fvlv| hv gvby‡li c‡ÿ eySv KwVb|

* 5| A¨v‡m¤^wj j¨vs¸‡qR Kv‡K e‡j?

DËi t we‡kl ai‡Yi wb‡gvwbK (ADD, SUB, MOV, MUL, DIV) BZ¨vw` e¨envi K‡i †h Program ‰Zwi Kiv nq, Zv‡K
Assembly Language e‡j|
†hgb t MASM (Microsoft Micro Assembler), TASM (Turbo Assembler) BZ¨vw`|

** 6| nvB †j‡fj j¨vs¸‡qR Kv‡K e‡j?

DËi t Kw¤úDUvi‡K mve©Rbxb e¨envi Dc‡hvMx K‡i Zzj‡Z †h fvlv ‰Zwi Kiv nq, Zv‡K High Level Language e‡j|
‡hgb t C++, Java, C#, Python BZ¨vw`|

** 7| KqwU High level language Gi D`vniY `vI| evKvwk‡ev- 2009, 09Õcwi, 13Õcwi, 17Õcwi
DËi t C++, Java, C#, Python, Javascript, Visual Basics, Ruby BZ¨vw`|

* 8| A¨v‡m¤^jvi ej‡Z Kx eySvq?

DËi t ‡h Abyev`K Program, Assembly Language G wjwLZ Program ‡K Machine Language G iƒcvšÍi K‡i, Zv‡K
Assembler e‡j|

*** 9| K¤úvBjvi ej‡Z Kx eySvq? evKvwk‡ev- 2003, 12, 13

DËi t K¤úvBjvi n‡jv GK ai‡Yi Abyev`K †cÖvMÖvg hv D”P¯Í‡ii fvlvq †jLv GKwU m¤ú~Y© †cÖvMÖvg‡K GK mv‡_ c‡o Ges GKmv‡_ ‡gwkb
ev hvwš¿K fvlvq iƒcvšÍi K‡i| A_©vr Drm †cÖvMÖvg‡K e¯‘i †cÖvMÖ‡g iƒcvšÍi K‡i|

* 10| K‡qKwU ÔC' K¤úvBjv‡ii bvg wjL|

DËi t Code :: Blocks, Turbo C, Borland C, gcc, Microsoft visual C++ BZ¨vw`|

* 11| B›UviwcÖUvi ej‡Z Kx eySvq?

DËi t ‡h Abyev`K Program, High Level Language Gi Source Program ‡K GKmv‡_ iƒcvšÍi bv K‡i jvBb evB jvBb
Machine Language G iƒcvšÍi K‡i, Zv‡K Interpreter e‡j|

*** 12| C ‡K wgW †j‡fj j¨vs¸‡qR ejv nq †Kb? evKvwk‡ev- 2002, 03, 04, 05, 06, 07, 08, 09, 09Õcwi, 10, 11, 12, 13, 15Õcwi, 16Õcwi, 17, 18Õcwi
DËi t C ‡K wgW †j‡fj j¨vs¸‡qR ejv nq| KviY GwU Low level Ges High level Dfq fvlvi ˆewkó¨ mg_©b K‡i| A_©vr C ‡Z
GK w`‡K †hgb Assembly fvlvi gZ weU, evBU I †ggwi A¨v‡Wªm wb‡q KvR Kiv hvq, †ZgbB High level language Gi gZ wewfbœ
ai‡Yi WvUv UvBc wb‡q KvR Kiv hvq|
2
* 13| C ‡K †Rbv‡ij cvicvm j¨vs¸‡qR ejv nq ‡Kb? evKvwk‡ev- 2000
DËi t C Ggb GKwU Programming language hv w`‡q †h †Kv‡bv ai‡bi mgm¨v mgvavb Kiv hvq| COBOL w`‡q e¨emvqxK mgm¨v,
FORTRAN w`‡q ˆeÁvwbK mgm¨vi mgvavb Kiv n‡Zv| wKš‘ C w`‡q me ai‡bi mgm¨v mgvavb Kiv hvq| GKvi‡b C ‡K †Rbv‡ij
cvicvm j¨vs¸‡qR ejv nq|

** 14| C ‡K ÷ªvKPviW j¨vs¸‡qR ejv nq ‡Kb? evKvwk‡ev- 2004, 05, 06, 09, 10, 10Õcwi, 13
DËi t C GKwU Structured language Kvib, GLv‡b GKwU eo Program ‡K †QvU †QvU As‡k fvM K‡i †jLv hvq| cÖ‡Z¨KwU ‡QvU
†QvU Ask‡K ejv nq gwWDj ev dvskb| GB dvskb¸‡jv wb‡q GKwU c~bv½v Program ‰Zwi Kiv hvq|

** 15| C ‡K †cv‡U©ej j¨vs¸‡qR ejv nq †Kb? evKvwk‡ev- 2008, 10Õcwi, 12

DËi t C ‡K †cv‡U©ej j¨vs¸‡qR ejv nq| KviY †h †Kvb ‡Kv¤úvwbi ‰Zwi Kw¤úDUvi Øviv wjwLZ C ‡cÖvMÖvg Ab¨ †h †Kvb †Kv¤úvwbi
ˆZwi Kw¤úDUvi Øviv Run Kiv hvq|

* 16 | C ‡K Case Sensitive language ejv nq †Kb? evKvwk‡ev- 2012

DËi t C ‡K Case sensitive language ejv nq| Kvib C ‡Z Uppercase Ges lowercase Gi g‡a¨ cv_©K¨ Av‡Q|

** 17| C Gi K‡qKwU jvB‡eªwi dvsk‡bi bvg †jL|

DËi t Print f ( ), Scan f ( ), Putcher ( ), getchar ( ), Clock ( ), Malloc ( ).

* 18| Ae‡R± †KvW ev Ae‡R± ‡cÖvMÖvg Kx? evKvwk‡ev- 2006, 08, 09

DËi t Kvw¤úDUvi mivmwi †h fvlv eyS‡Z cv‡i Zv‡K †gwkb fvlv e‡j| Avi †gwk‡bi fvlvq wjwLZ ‡cÖvMÖvg n‡jv Ae‡R± †KvW ev Ae‡R±
†cÖvMÖvg|

* 19| †÷U‡g›U Kv‡K e‡j?

DËi t Semicolon mn cÖwZwU Instruction ‡K Statement e‡j|

*** 20| A¨vjMwi`g ej‡Z Kx eySvq? evKvwk‡ev- 2001, 02, 04, 04Õcwi, 05, 06, 08, 09, 09Õcwi, 10, 10Õcwi, 12, 13, 15Õcwi, 16Õcwi, 18Õcwi
DËi t ‡Kvb mgm¨v mgvav‡bi hyw³m¤§Z I ch©vqµwgK avivi cÖwµqv‡K Algorithm e‡j| Algorithm Gi me© cÖ_g aviYv †`b Aviwe
MwYZwe` †gvnv¤§` Be‡b gymv-Avj-LyqvwiRgx|

*** 21| †d¬vPvU© Kv‡K ej? evKvwk‡ev- 2004Õcwi, 05, 06, 12

DËi t ‡h wP‡Îi gva¨‡g †Kvb †cÖvMÖvg Kxfv‡e KvR Ki‡e Zvi MwZaviv wba©viY Kiv nq, Zv‡K Flowchart ev cÖevnwPÎ e‡j|
A_©vr Algorithm Gi wPÎwfwËK iƒc‡K Flowchart e‡j|

** 22| evM (Bug) I wWevwMs (Debugging) ej‡Z Kx eySvq? evKvwk‡ev- 2016Õcwi

DËi t Bug: Program Gi g‡a¨ hZ ai‡Yi ÎæwU Av‡Q, ZvB Bug.
Debug: Source Code Gi ÎæwU ms‡kvab KivB n‡”Q Debug.

SOS msw¶ß cÖ‡kœvËi t

*** 1| K¤úvBjvi I B›UviwcÖUv‡ii g‡a¨ cv_©K¨ †jL| evKvwk‡ev- 2005, 06, 07, 09, 10, 11, 12, 16Õcwi
DËi t K¤úvBjvi I B›UviwcÖUv‡ii g‡a¨ cv_©K¨ wb¤œiƒc t

Compiler Interpreter
1) ‡h Abyev`K Program, High Level Language 1) ‡h Abyev`K Program, High Level Language
Gi m¤ú~Y© Source Program ‡K GKmv‡_ Machine Gi Source Program ‡K GKmv‡_ iƒcvšÍi bv K‡i
Language G iƒcvšÍi K‡i Zv‡K Compiler e‡j| jvBb evB jvBb Machine Language G iƒcvšÍi K‡i,
Zv‡K Interpreter e‡j|
2) `ªæZMwZm¤úbœ| 2) axiMwZm¤úbœ|
3
 3) m¤ú~Y© Program ‡K GKmv‡_ Machine 3) jvBb evB jvBb Program ‡K Machine
Language G iƒcvšÍi K‡i| Language G iƒcvšÍi K‡i|
4) †Kvb Program Gi cwieZ©b Ki‡Z n‡j m¤ú~Y© 4) †Kvb Program Gi cwieZ©b Ki‡Z n‡j m¤ú~Y©
Program Gi cwieZ©b Ki‡Z nq| Program Gi cwieZ©b Ki‡Z nq bv|
5) ¯’vqxfv‡e Machine Language G iƒcvšÍi K‡i ivLv 5) ¯’vqxfv‡e Machine Language G iƒcvšÍi K‡i ivLv
hvq| hvq bv|
6) GKwU fvlv‡K Abyev` Ki‡Z cv‡i| 6) GKvwaK fvlv Abyev` Ki‡Z cv‡i|
7) cy‡iv Program Gi fzj GKmv‡_ cÖ`k©b K‡i| 7) GK jvB‡bi fzj cÖ`k©b Kivi ci Kvh©µg eÜ K‡i
†`q|

** 2| wm †cÖvMÖvwgs j¨vs¸‡q‡Ri myweav¸‡jv eY©bv Ki| evKvwk‡ev- 2001, 10, 11, 17Õcwi
DËi t wm †cÖvMÖvwgs j¨vs¸‡q‡Ri myweav¸‡jv wb¤œiƒc t
▪ wm j¨vs¸‡qR w`‡q me ai‡Yi mgm¨vi mgvavb Kiv hvq|
▪ wm j¨vs¸‡qR‡K mid level j¨vs¸‡qR ejv nq|
▪ GK Kw¤úDUv‡i wjLv †cÖvMÖvg Ab¨ Kw¤úDUv‡i ivb Kiv hvq|
▪ wm GKwU †Rbv‡ij cvicvm j¨vs¸‡qR|
▪ GKwU eo †cÖvMÖvg‡K †QvU †QvU As‡k fvM K‡i ‡jLv hvq|
▪ wm †cÖvMÖvwgs j¨vs¸‡q‡Ri `ÿZv A‡bK †ewk|
▪ wm j¨vs¸‡q‡R ch©vß Library Functions Gi myweav cvIqv hvq|

*** 3| C ‡cÖvMÖv‡gi Basic Structure D‡jøL Ki| evKvwk‡ev- 2001, 02, 03, 04, 05, 06, 07, 09, 09Õcwi, 10, 12
DËi t C ‡cÖvMÖv‡gi Basic Structure wb¤œiƒc t

Documentation Section Program Gi cwiwPwZ

wewfbœ ai‡bi †nWvi dvBj †hgb t

Link Section Stdio.h, Math.h
Constant variable A_©vr wewfbœ
Definition Section ai‡bi aªe gvb define Kiv nq|

G‡Z Global Variable declare

Global Declaration Section Kiv nq| GB ai‡bi variable GKvwaK
Function G e¨envi nq|
Main ( ) function Section
{ GLvb †_‡K Program KvR ïiæ K‡i| G‡Z
`yBwU Ask _v‡K|
Declaration (i) Declaration hv wewfbœ variable
Declare nq|
Execution (ii) GB variable Execution nq|
}

Sub Program Section

Function- 1 GLv‡b user defined function
Function- 2 ¸‡jv ‡jLv nq|
.......

Function- n

4
*** 4| wm †cÖvMÖv‡gi dig¨vU †jL| evKvwk‡ev- 2001, 03, 04Õcwi, 10, 11
DËi t wm †cÖvMÖv‡gi dig¨vU wb¤œiƒc t

Include Files wewfbœ ai‡bi †nWvi Files eySvq †hgb t Stdio.h,

Conio.h, Math.h BZ¨vw`|
Main Function
Main function ‡_‡K Program KvR Kiv ïiæ K‡i|
cÖwZwU Program G GKwU Main function _vK‡Z
Other function n‡e|

(library/ user defined functions) GLv‡b wewfbœ ai‡bi Library function ‡hgb: Printf
( ), Scanf ( ), Putw ( ), BZ¨vw` _v‡K, Avevi User
defined function GLv‡bB _v‡K|

* Style:
# include <stdio. h>
int main ( )
{
Print f (''Softmax Online School'');
return o;
}

** 5| C I Ab¨vb¨ nvB‡j‡fj j¨vs¸‡q‡Ri g‡a¨ cv_©K¨ †jL| evKvwk‡ev- 2002, 06, 12, 13Õcwi
DËi t C I Ab¨vb¨ nvB‡j‡fj j¨vs¸‡q‡Ri g‡a¨ cv_©K¨ wb¤œiƒc t
wm j¨vs¸‡qR Ab¨vb¨ nvB‡j‡fj j¨vs¸‡qR
wm j¨vs¸‡qR Øviv †h †Kv‡bv ai‡bi mgm¨v mgvavb Kiv hvq| Ab¨vb¨ nvB‡j‡fj j¨vs¸‡qR †h †Kvb wbw`©ó Kv‡Ri Rb¨ ˆZwi Kiv
nq|
wm j¨vs¸‡qR Øviv High Level I Low Level Dfq ai‡bi Ab¨vb¨ nvB‡j‡fj j¨vs¸‡qR Øviv Low level Gi ‡cÖvMÖvg ˆZix
‡cÖvMÖvg ‰Zwi Kiv hvq| Kiv hvq bv|
Case sensitive language. Case sensitive Language bq|
Error detection I Correction mnR| Error detection I Correction RwUj|
wm‡÷g †cÖvMÖvg ˆZwii Rb¨ LyeB Dc‡hvMx| wm‡÷g ‡cÖvMÖvg ‰Zwii Rb¨ Lye †ewk Dc‡hvMx bq|
Code reusability evov‡bv hvq| code reusability Gi m¤¢vebv Kg|

** 6| nvB †j‡fj I ‡jv †j‡fj j¨vs¸‡q‡Ri g‡a¨ cv_©K¨ †jL| evKvwk‡ev- 2004Õcwi, 05, 06, 09, 13, 13Õcwi
DËi t nvB †j‡fj I ‡jv †j‡fj j¨vs¸‡q‡Ri g‡a¨ cv_©K¨ wb¤œiƒc t
High Level Language Low Level Language
1) Kw¤úDUvi‡K mve©Rbxb e¨envi Dc‡hvMx K‡i Zzj‡Z †h 1) ‡h fvlvq mgm¨v mgvav‡bi Rb¨ evBbvwi msL¨v A_©vr 0,
fvlv ‰Zwi Kiv nq, Zv‡K High Level Language 1 e¨envi K‡i †cÖvMÖvg †jLv nq, Zv‡K Low Level
e‡j| Language e‡j|
2)Program ‡jLv Zzjbvg~jK mnR| 2) Program ‡jLv Zzjbvg~jK KwVb|
3) Program wjL‡Z mgq Kg jv‡M| 3) Program wjL‡Z Zzjbvg~jKfv‡e mgq †ewk jv‡M|
4) Command gyL¯’ ivLvi cÖ‡qvRb †bB| 4) Command gyL¯’ ivL‡Z nq|
5) D`vniY t C++, Java, C#, Python BZ¨vw`| 5) D`vniY t Assembly Language, Machine
Language BZ¨vw`|
5
** 7| DËg A¨vjMwi`‡gi ‰ewkó¨ ev we‡eP¨ welqmg~n D‡jøL Ki| evKvwk‡ev- 2008, 11, 14Õcwi
DËi t DËg A¨vjMwi`‡gi ‰ewkó¨ ev we‡eP¨ welqmg~n t
1) cÖwZwU Algorithm Gi mywbw`©ó KZ¸‡jv Step ev avc _vK‡e|
2) cÖwZwU Algorithm Gi GK ev GKvwaK Input _vK‡e|
3) cÖwZwU Algorithm Gi mywbw`©ó Output _vK‡e|
4) cÖwZwU avc mnR‡eva¨ n‡Z n‡e|
5) cÖwZwU av‡ci gv‡S cvi¯úwiK m¤úK© _vK‡Z n‡e|
6) cÖwZwU av‡ci KvR hyw³ wbf©i n‡Z n‡e Ges
7) cÖwZwU Algorithm Gi ïiæ Ges †kl _vK‡e|

*** 8| †cÖvMÖvg †d¬vPv‡U©i wewfbœ cÖZxK A¼b K‡i G‡`i KvR D‡jøL Ki|
evKvwk‡ev- 2001, 03, 04, 04Õcwi, 05, 06, 09, 10, 10Õcwi, 11, 12, 13Õcwi, 14Õcwi, 15Õcwi, 16Õcwi, 17, 18Õcwi
DËi t

SCAN

cÖZxK bvg KvR

Start/End Flowchart ïiæ I †kl Kivi Rb¨ GB
0 wPý e¨eüZ nq|

Input/Output Input Ges Output ‡bIqvi Rb¨ GB

wPý e¨envi Kiv nq|
Process ev cÖwµqvKiY MvwYwZK mKj Expression G GB wPý
e¨envi Kiv nq|
Decision Making ev wm×všÍ MÖnY kZ©vaxb †Kvb KvR Kivi Rb¨ GB wPý
e¨envi Kiv nq|

Flow ev wb‡`©kbv Program Flow ‡Kvb w`‡K hv‡”Q Zv

eySv‡bvi Rb¨ GB wPý e¨eüZ nq|

Connection ev ms‡hvM GKvwaK Ask‡K mshy³ Kivi Rb¨ GB wPý

e¨eüZ nq|
Print ev Document Program Gi †Kv‡bv Ask Print Kivi
`iKvi n‡j GB wPý e¨eüZ nq|
Loop GKB KvR evievi (Looping) Kivi Rb¨
e¨eüZ nq|

** 9| A¨vjMwi`g I ‡d¬vPv‡U©i g‡a¨ cv_©K¨ †jL| evKvwk‡ev- 2007

DËi t A¨vjMwi`g I ‡d¬vPv‡U©i g‡a¨ cv_©K¨ wb¤œiƒc t
Algorithm Flowchart
1) wbw`©ó mgm¨v mgvav‡bi Rb¨ hyw³m¤§Z I av‡c av‡c 1) Algorithm Gi wPÎwfwËK iƒc‡K Flowchart
mgvav‡bi c×wZ‡K Algorithm e‡j| e‡j|
2) GwU eY©bvg~jK| 2) GwU wPÎwbf©i|
3) Algorithm Gi wfwˇZ Flowchart ‰Zwi Kiv 3) Flowchart Gi wfwˇZ Program iPbv Kiv nq|
nq|
4) G‡Z †Kvb wPÎ e¨eüZ nq bv| 4) G‡Z wPÎ e¨eüZ nq|
6
 5) Algorithm ‰Zwii c~‡e© my‡Wv †KvW ˆZwii cÖ‡qvRb| 5) Flowchart ˆZwii c~‡e© Algorithm ‡jLv cÖ‡qvRb|

[Note: my‡Wv †KvW t Program Gi aiY Ges Kvh©cÖYvjx msewjZ wKQz wb‡`©k‡KB my‡Wv ev Pseudo Code e‡j|]

* 10| `ywU msL¨vi †hvMdj wbY©q Kivi Rb¨ Algorithm ‡jL| evKvwk‡ev- 2005, 09
DËi t
Algorithm Flowchart
Step 1: Start
Step 2: input two numbers a and b Start
Step 3: sum = a+b
Step 4: Output sum
Step 5: End input a,b

sum=a+b

print sum

End

** 11| GKwU AvqZ‡ÿ‡Îi †ÿÎdj wbY©q Kivi Rb¨ A¨vjMwi`g †jL| evKvwk‡ev- 2003, 15Õcwi, 18Õcwi
DËi t
Flowchart
Algorithm Start
Step 1: Start
Step 2: input length and width
Step 3: area = length*width input length, width
Step 4: print area
Step5: End
area=length*width

print area

End

7
** 12| 1+2+3+..................+n =? wmwi‡Ri †hvMdj wbY©‡qi Algorithm I Flowchart AuvK| evKvwk‡ev- 2003, 12
DËi t Algorithm Flowchart
Step 1: Start
Step 2: input n Start
Step 3: initialize 𝑠𝑢𝑚 = 0 and 𝑖 = 1
Step 4: 𝑖 Gi gvb 𝑛 bv nIqv ch©šÍ Loop Pj‡e|
input n
𝑠𝑢𝑚 = 𝑠𝑢𝑚 + 𝑖 Ges
𝑖 =𝑖+1
print 𝑠𝑢𝑚 𝑠𝑢𝑚 = 0
Step 5: Stop 𝑖=1

𝑠𝑢𝑚 = 𝑠𝑢𝑚 + 𝑖

𝑖 =𝑖+1

Yes if
𝑖 <=𝑛

No
print 𝑠𝑢𝑚

End

** 13| dv‡ibnvBU ZvcgvÎv †mw›U‡MÖ‡W iƒcvšÍi Kivi A¨vjMwi`g †jL| evKvwk‡ev- 2011
DËi t
Algorithm Flowchart
Step 1: Start
Step 2: input f Start
Step 3: c= ((𝑓 − 32) ∗ 5)/9
Step 4: print c
Step 5: End input r

c = ((f - 32)*5)/9

print c

End

8
** 14| e„‡Ëi †ÿÎdj wbY©q Kivi GKwU Algorithm ‡jL| evKvwk‡ev- 2014, 16Õcwi
DËi t
Flowchart
Algorithm
Start
Step 1: Start
Step 2: input r
Step 3: area= 3.1416 ∗ 𝑟 ∗ 𝑟 input r
Step 4: print area
Step 5: End
area=3.1416*r*r

print area

End

** 15| †Kvb msL¨vi d¨v±wiqvj gvb wbY©q Kivi Algorithm ‡jL| evKvwk‡ev- 2004
DËi t Step1: Start [‡cÖvMÖvg ïiæ]
Step2: Input n [‡fwiqvej n Gi gvb MÖnY]
Step3: fact = 1 [fact Ges i ‡Wwiqve‡ji cÖv_wgK gvb wbaviY Kiv]
i=1
Step4: while i < = n [kZ© cwiÿv Ki‡e A_©vr hZÿb ch©šÍ i Gi gvb n ‡_‡K †QvU ev
repeat step 5 mgvb _v‡K ZZÿb avc 5 cybive„wË n‡e]
Step5: fact = fact * i
i = i+1 [i Gi gvb 1 K‡i evo‡e]
Step6: Print fact [AvDUcyU cÖ`wk©Z n‡e]
Step7: End. [‡cÖvMÖvg †kl n‡e]

SOS iPbvg~jK cÖ‡kœvËi t

** 1| 'C' Programming Language Gi ¸iæZ¡ Av‡jvPbv Ki| evKvwk‡ev- 2001, 03, 08, 12, 13
DËi t mgqUv GLb Z_¨ cÖhyw³i, Avi `iRvq DuwK w`‡”Q PZz_© wkí wecøe| Z‡e GB wecø‡ei fvlv n‡e †cÖvMÖvwgs j¨vs¸‡qR| ‡Kvb mgm¨v
mn‡R mgvav‡bi D‡Ï‡k¨ Kw¤úDUv‡ii fvlvq avivevwnKfv‡e KZ¸‡jv wb‡`©‡ki mgwó‡K †cÖvMÖvwgs e‡j| Avi †h fvlvq ‡cÖvMÖvg †jLv nq
Zv‡KB e‡j ‡cÖvMÖvwgs fvlv|
‡cÖvMÖvgvi‡`i Kv‡Q cÖ_g †hB †cÖvMÖvwgs j¨vs¸‡qRwU †f‡m Av‡m Zv n‡”Q wm ‡cÖvMÖvwgs| Avgiv †hgb †QvU‡ejvq K, L ABCD, 1234 c‡owQ
Ges Zvi gva¨‡g GLb eo eo msL¨v ev evK¨ wjL‡Z cvwi, †Zgwb wm †cÖvMÖvwgs n‡”Q †cÖvMÖvwgs‡qi nv‡Z Nwo| Kw¤úDUv‡ii gva¨‡g †Kvb
mgm¨vi mgvavb Kivi Rb¨ Avgiv †hme kã, eY©, ms‡KZ ev cÖZxK e¨envi K‡i †cÖvMÖvg iPbv Kwi, ZvB †cÖvMÖvwgs fvlv| wm n‡”Q Ab¨ mKj
†cÖvMÖvwgs j¨vs¸‡qR Gi †ewmK| GwU Lye mnR GKUv †cÖvMÖvwgs j¨vs¸‡qR| wm †_‡KB cieZx‡Z© A‡bK¸‡jv †cÖvMÖvwgs j¨vs¸‡qR Gi DrcwË
n‡q‡Q| †hgb C++, java, C#, PHP BZ¨vw`| wm Rvb‡j †m ¸‡jv mn‡RB Rvbv hvq| ZvB C ‡K Mother of Programming
language ejv nq|
‡cÖvMÖvwgs Gi †gŠwjK mKj ‰ewkó wm‡Z i‡q‡Q| Kw¤úDUvi Acv‡iwUs wm‡÷‡gi †Kvi ev cÖvY n‡”Q Kv‡b©j| Windows, Unix ev Linux
Gi Kv‡b©‡ji †ewki fvM †KvW †jLv n‡q‡Q wm w`‡q| KviY wm Gi c‡q›Uvi w`‡q nvW©Iq¨vi Ges mdUIq¨vi Gi g‡a¨ †hvMv‡hvM Kiv hvq|
wm n‡”Q mid level language, wm w`‡q low level language Ges High level language Gi KvR Kiv hvq| Av‡iv A‡bK ¸‡jv
KviY i‡q‡Q hvi Rb¨ wm †cÖvMÖvwgs †kLv Riæix|

9
*** 2| †cÖvMÖvg cwiKíbvi avc¸‡jv e¨vL¨v Ki| evKvwk‡ev- 2003, 04, 05, 06, 07, 08, 09, 10, 10Õcwi, 11, 12, 13, 14Õcwi
DËi t ‡cÖvMÖvg w`‡q wbw`©ó †Kvb mgm¨v mgvavb Ki‡Z n‡j Aek¨B mywbw`©ó KZ¸‡jv av‡c Zv m¤úbœ Ki‡Z nq| Bnv‡K †cÖvMÖvg cwiKíbvi avc ev
Program Planning e‡j| KviY mywbw`©ó cwiKíbv Qvov †Kvb KvRB mym¤úbœ nq bv|
‡cÖvMÖvg cwiKíbvi avcmg~n wb¤œiƒct-
1) mgm¨v wPwüZ Kiv (Problem Identification) t- GwU †cÖvMÖvg cwiKíbvi me©cÖ_g avc| KviY mevi cÖ_‡g Avwg wK Ki‡Z
PvB Zv wba©viY Ki‡Z n‡e|
2) mgm¨v we‡kølY (Problem Analysis) t- GB av‡c mgm¨v‡K we‡kølY K‡i me‡P‡q mnR Dcv‡q mgm¨vi mgvavb wba©viY Kiv
nq|
3) ‡cÖvMÖv‡gi BbcyU/AvDUcyU wbY©q t- GB av‡c cÖ‡qvRbxq Input I Output wba©viY K‡i Kvw•LZ Output cvIqvi Rb¨ mKj
m~‡Îi cÖ‡qvM Ki‡Z nq|
4) ‡cÖvMÖv‡gi A¨vjMwi`g Dbœqb Kiv (Algorithm Development) t- Program wU wKfv‡e KvR Ki‡e Zv Algorithm G
av‡c av‡c D‡jøL Kiv _v‡K| Program ‡jLvi Av‡M Zv wKfv‡e KvR Ki‡e †mB m¤ú‡K© Aek¨B ¯^”Q aviYv _vK‡Z n‡e|
5) ‡d¬vPvU© ˆZwi Kiv (Flowchart Development) t- Algorithm Gi wPÎwfwËK iƒcB n‡jv Flowchart| Gi Rb¨ wbw`©ó
wKQz wPÎ Av‡Q hv Program ïiæ Kivi Av‡M Algorithm Abyhvqx ˆZwi Ki‡Z n‡e|
6) ‡cÖvMÖvwgs fvlv wba©viY t- A‡bK †cÖvMÖvwgs fvlv †_‡K Avgvi mgm¨vi aiY Abyhvqx †Kvb fvlv e¨envi Kiv †ewk myweavRbK Zv
wba©viY Ki‡Z n‡e|
7) ‡cÖvMÖvg iPbv Kiv (Program Coding) t- GB av‡c †h †cÖvMÖvwgs j¨vs¸‡qR wba©viY Kiv n‡q‡Q †mB Abyhvqx Program ‡jLv
ïiæ Ki‡Z n‡e|
8) ‡cÖvMÖvg K¤úvBj Kiv t- High Level Language ‡K Machine Language G iƒcvšÍ‡ii Rb¨ Compiler Øviv Program
‡K Compile Kiv nq| d‡j hw` Program G †Kvb fzj _v‡K Z‡e Zv aiv c‡o|
9) ‡cÖvMÖvg cixÿY I ms‡kvab (Program Testing And Debugging) t- Compile Kivi ci †h fzj¸wj _v‡K Zv‡K
Bug e‡j Ges GB Bug `~i Kiv ev ms‡kvab Kiv‡K Debugging e‡j Ges wewfbœ ai‡Yi Testing (Alpha Test, Beta
Test) BZ¨vw` Kiv nq|
10) Documentation t- GB av‡c mKj Kvh©µg‡K fwel¨‡Zi Rb¨ msMÖn K‡i ivLv nq| †hb cieZ©x‡Z cÖ‡qvRb Abyhvqx Zv
Avevi e¨envi ev cwieZ©b Kiv hvq|
11) Installation t- mKj Testing m¤úbœ nevi ci †cÖvMÖvgmg~n‡K †cÖvWvKkb jvB‡eªix‡Z Load Kiv nq| G‡K Installation
e‡j|
12) iÿbv‡eÿb (Maintenance) t- GwU †cÖvMÖvg cwiKíbvi me©‡kl avc| G‡Z †QvU †Kvb cwieZ©b ev cwiea©b Kiv eySvq| KviY
GKwU Software hLb evRv‡i Av‡m Zv‡Z bZzb †Kvb Avc‡WU Avm‡ZB cv‡i| d‡j Zvi DbœZ Version evRv‡i Avb‡Z nq|

[Note: GB cÖkœ mswÿß AvKv‡i Avm‡j ïay gvÎ avc ¸‡jv wjL‡jB n‡e]

10
*** 3| wZbwU msL¨vi gv‡S eo msL¨vwU wbY©‡qi Rb¨ GKwU Algorithm I Flowchart ‡jL|
evKvwk‡ev- 2001, 06, 07, 08, 09, 09Õcwi, 10, 11, 16Õcwi, 18Õcwi
DËi t Alogorithm SCAN
Step 1 : Start Flowchart
Step 2 : input three numbers a, b, c Start
Step 3 : if a>b and a>c
then largest = a input a, b, c
else if b>a and b>c
then largest = b No if Yes
else largest = c a >b
Step 4 : print largest if No if
Yes No Yes
Step 5 : Stop b>c a>c

largest = b largest = c largest = a

Note: ‡QvU msL¨v wbY©q Ki‡Z ej‡j Greater than (>) Gi cwie‡Z©
less Than (<) n‡e| print largest

Stop

*** 4| wÎfz‡Ri †ÿÎdj wbY©‡qi †d¬v-PvU© A¼b Ki| evKvwk‡ev- 2005, 06, 09, 17Õcwi
DËi t

Algorithm
Step 1: Start
Step 2: input 𝑎, 𝑏, 𝑐
2𝑆 = cwimxgv (me¸‡jv evûi †hvMdj)
Step 3: 𝑖𝑓(𝑎 + 𝑏) > 𝑐 𝑎𝑛𝑑 (𝑏 + 𝑐) > 𝑎 𝑎𝑛𝑑 (𝑎 + 𝑐) > 𝑏 𝑡ℎ𝑒𝑛
(𝑖) 𝑆 = (𝑎 + 𝑏 + 𝑐)/2 𝑆 = Aa©cwimxgv
(𝑖𝑖) 𝑎𝑟𝑒𝑎 = √𝑆 × (𝑆 − 𝑎) × (𝑆 − 𝑏) × (𝑆 − 𝑐)
print area
Flowchart
else print Triangle is impossible
2Step 4: Stop
Start

input a, b, c

if
(a+b)>c and
No (b+c)>a Yes
and
Print Triangle is (a+c)>b
𝑆 = (𝑎 + 𝑏 + 𝑐)/2
impossible
𝑎𝑟𝑒𝑎 = √𝑆(𝑆 − 𝑎)(𝑆 − 𝑏)(𝑆 − 𝑐)

print area

End

11
** 5| wØNvZ mgxKi‡Yi (a2+bx+c = 0) g~j wbY©q Kivi A¨vjMwi`g †jL|
DËi t Algorithm
SCAN
Step 1: Start Flowchart
Step 2: input a, b, c Star
Step 3: wbðvqK 𝐷 = 𝑏 2 − 4𝑎𝑐 t
Step 4: 𝑖𝑓 𝐷 > 0 𝑡ℎ𝑒𝑛 input a, b,
−𝑏+√𝐷 c
(𝑖) 𝑥1 =
2𝑎 𝐷 = 𝑏 2 − 4𝑎𝑐
−𝑏−√𝐷
(𝑖𝑖) 𝑥2 =
2𝑎 if
N Yes
𝑝𝑟𝑖𝑛𝑡 𝑥1 , 𝑥2 𝐷>0
o
else if 𝐷 = 0 then
−𝑏 Yes if
𝑥 = 2𝑎 𝐷=0
No
−𝑏 + √𝐷
𝑥1 =
𝑝𝑟𝑖𝑛𝑡 𝑥 2𝑎
else roots are imaginary −𝑏 Print Roots are −𝑏 − √𝐷
𝑥= 𝑥2 =
imaginary 2𝑎
Step 5: End 2𝑎

print 𝑥 print 𝑥1 , 𝑥2

End

*** 6| C- Program Gi Compiling I Execution cÖwµqv Flowchart Gi gva¨‡g eY©bv Ki|

evKvwk‡ev- 200, 03, 04, 05, 06. 07, 09, 09Õcwi, 10, 11, 12, 13Õcwi, 14, 17, 17Õcwi
DËi t Program Gi Compiling I Execution cÖwµqv t
‡h Abyev`K Program, High Level language Gi m¤ú~Y© Source program ‡K GKmv‡_ Machine language G iƒcvšÍi K‡i
Zv‡K Compiler e‡j|
> cÖ_‡g, Editor Gi gva¨‡g ‡cÖvMÖvg ev †mvm© †KvW wjL‡Z n‡e|
> wØZxqZ, KgcvBjvi †mvm© †KvW‡K K¤úvBj Ki‡e| hw` †cÖvMÖv‡g †Kvb fzj _v‡K, Zvn‡j fzj ms‡kvab Ki‡e Ges †gwkb †Kv‡W iƒcvšÍi
Ki‡e|
> dvBbvwj, †gwkb †KvW ev Object code ‡K Ab¨vb¨ library dvskb Gi mv‡_ link Kiv nq| d‡j bZzb ‡h code ‰Zix nq Zv‡K
Executable code e‡j| Ges Executable code ‡K Run Ki‡Z n‡e| Ges Final result cvIqv hv‡e|

12
 Program File name

Source Code File (.CPP File)

Compile Debug

Compiler
error

Object code file (.Ob file)

Library Link
Programs

Link error?

Executable code file

(. exe file)

Data Run

Run
time error
?

Result

wPÎ t †cÖvMÖvg K¤úvBwjs I Gw·wKDkb †d¬vPvU©

Abykxjbx

SOS AwZ msw¶ß cÖ‡kœvËi t

*** 1| C ‡cÖvMÖvwgs †K Avwe®‹vi K‡ib? evKvwk‡ev- 2001, 02

DËi t 1972 mv‡j †Wwbm wiwP (Dennis Ritchie) wm †cÖvMÖvwgs fvlv Avwe®‹vi K‡ib|

* 2| Abyev`K ej‡Z Kx eySvq?

DËi t ‡h mKj †cÖvMÖvg e¨envi K‡i High level I low level language ‡K Machine code ev language G iƒcvšÍi Kiv nq
Zv‡K Abyev`K e‡j|

* 3| K‡qKwU wgW †j‡fj j¨vs¸‡q‡Ri bvg †jL|

DËi t Forth, C++, Macro-Assemble, C

* 4| †mvm© †KvW Kx?

DËi t High level language Gi mvnv‡h¨ wjwLZ †h †Kvb †cÖvMÖvg‡K †mvm© †KvW e‡j|

13
 SOS msw¶ß cÖ‡kœvËi t

* 1| †d¬vPv‡U©i ‰ewkó¨| we‡eP¨ welqmg~n Kx Kx?

SOS iPbvg~jK cÖ‡kœvËi t

** 1| wm †cÖvMÖv‡gi e¨envi ev cÖ‡qvM‡ÿÎ eY©bv Ki| evKvwk‡ev- 2001, 07, 10

DËi t wm †cÖvMÖv‡gi e¨envi wb¤œiƒc t
̅ Windows, Unix ev Linux Gi Kv‡Y©‡ji †ewki fvM †KvW †jLv n‡q‡Q C ‡cÖvMÖvwgs w`‡q|
>
̅ WªvBfvi mdUIq¨vi ¸‡jv cÖvq mgqB C ‡cÖvMÖvwgs w`‡q †jLv nq|
>
̅ wm Gi mnRjf¨Zv I Kvh©KwiZvi djvdj wn‡m‡e Ab¨vb¨ †cÖvMÖvwgs fvlvi K¤úvBjvi, jvB‡eªwi dvskb I B›Uvi‡cÖUvi ˆZwi‡Z cÖvqB wm
>
†cÖvMÖvwgs e¨envi Kiv nq|
̅ weÁvb msµvšÍ wKsev MvwYwZK me ai‡bi Kv‡Ri Rb¨ GwU e¨envi Kiv nq|
>
̅ Data Base management msµvšÍ Operation effectively execute Kivi Rb¨ C e¨envi Kiv nq|
>
̅ System Software I Business Package G wm †cÖvMÖvwgs e¨envi Kiv nq|
>
̅ wm †cÖvMÖvwgs fvlv‡K High level Ges Low level ‡cÖvMÖvwgs fvlv wn‡m‡e I e¨envi Kiv hvq|
>
̅ h‡_ó msL¨K jvB‡eªwi Function I Operator _vKvi Rb¨ GwU Program ‡K Simplify Kivi Rb¨ e¨envi Kiv nq|
>

14