{"id":797,"date":"2018-03-04T22:24:37","date_gmt":"2018-03-04T18:24:37","guid":{"rendered":"http:\/\/yusif.az\/main\/?p=797"},"modified":"2018-03-04T22:24:37","modified_gmt":"2018-03-04T18:24:37","slug":"alqoritm-v%c9%99-proqram-anlayisi","status":"publish","type":"post","link":"https:\/\/yusif.az\/main\/?p=797","title":{"rendered":"Alqoritm v\u0259 proqram anlay\u0131\u015f\u0131"},"content":{"rendered":"
\n

Alqoritm v\u0259 proqram<\/strong><\/h3>\n

G\u00fcnd\u0259lik h\u0259yat\u0131m\u0131zda h\u0259r hans\u0131 bir i\u015fi icra ed\u0259rk\u0259n bir s\u0131ra qayda v\u0259 qanunlar\u0131 yerin\u0259 yetiririk. Bir misala baxaq. Tutaq ki, biz kofe haz\u0131rlamaq ist\u0259yirik. Onda biz, ard\u0131c\u0131l a\u015fa\u011f\u0131dak\u0131 i\u015fl\u0259ri yerin\u0259 yetirm\u0259liyik.
\n1. Suyu qaynad\u0131r\u0131q;
\n2. Qaynar suyu bir st\u0259kana t\u00f6k\u00fcr\u00fck;
\n3. St\u0259kana laz\u0131m\u0131 q\u0259d\u0259r kofe t\u00f6k\u00fcr\u00fck;
\n4. Laz\u0131m\u0131 miqdarda \u015f\u0259k\u0259r tozu \u0259lav\u0259 edib qar\u0131\u015fd\u0131r\u0131r\u0131q;
\nD\u00f6rd b\u0259ndd\u0259n ibar\u0259t bu h\u0259r\u0259k\u0259tl\u0259r ard\u0131c\u0131ll\u0131\u011f\u0131 kofe haz\u0131rlamaq alqoritmidir.<\/p>\n

Alqoritm \u2013 lat\u0131nca qayda-qanun dem\u0259kdir. Alqoritm s\u00f6z\u00fc IX \u0259srin m\u0259\u015fhur \u00f6zb\u0259k riyaziyyat\u00e7\u0131s\u0131 M\u0259h\u0259mm\u0259d \u0130bn Musa \u0259l-Xar\u0259zminin (y\u0259ni Xar\u0259zmli Musa o\u011flu M\u0259h\u0259mm\u0259d) ad\u0131n\u0131n lat\u0131n h\u0259rfl\u0259ril\u0259 olan \u201calqoritmi\u201d yaz\u0131l\u0131\u015f\u0131yla ba\u011fl\u0131d\u0131r. \u018fl-Xar\u0259zminin yazd\u0131\u011f\u0131 traktat\u0131n XII \u0259srd\u0259 lat\u0131n dilin\u0259 t\u0259rc\u00fcm\u0259 olunmas\u0131 say\u0259sind\u0259 avropal\u0131lar m\u00f6vqeli say sistemi il\u0259 tan\u0131\u015f olmu\u015f, onluq say sistemini v\u0259 onun hesab qaydalar\u0131n\u0131 alqoritm adland\u0131rm\u0131\u015flar.
\n\u00dcmumiyy\u0259tl\u0259, alqoritm-verilmi\u015f m\u0259s\u0259l\u0259nin h\u0259lli \u00fc\u00e7\u00fcn laz\u0131m olan \u0259m\u0259liyyatlar\u0131 m\u00fc\u0259yy\u0259n ed\u0259n v\u0259 onlar\u0131n hans\u0131 ard\u0131c\u0131ll\u0131qla yerin\u0259 yetirilm\u0259sini g\u00f6st\u0259r\u0259n formal yaz\u0131l\u0131\u015fd\u0131r.
\nHesablama ma\u015f\u0131nlar\u0131n\u0131n \u0259sas f\u0259rql\u0259ndirici x\u00fcsusiyy\u0259tl\u0259rind\u0259n biri d\u0259 onun proqramla idar\u0259 olunmas\u0131d\u0131r. Y\u0259ni, ist\u0259r sad\u0259, ist\u0259rs\u0259 d\u0259 m\u00fcr\u0259kk\u0259b m\u0259s\u0259l\u0259ni ma\u015f\u0131n\u0131n h\u0259ll etm\u0259si \u00fc\u00e7\u00fcn proqram t\u0259rtib edilm\u0259lidir.
\nProqram – ma\u015f\u0131n\u0131n add\u0131m-add\u0131m yerin\u0259 yetir\u0259c\u0259yi t\u0259limatlar v\u0259 yaxud \u0259mrl\u0259r toplusudur. H\u0259r bir proqram t\u0259rtib edil\u0259rk\u0259n m\u00fc\u0259yy\u0259n bir alqoritmd\u0259n istifad\u0259 edilir. Y\u0259ni, proqram h\u0259r bir alqoritmi ma\u015f\u0131n\u0131n ba\u015fa d\u00fc\u015f\u0259c\u0259yi formada ifad\u0259 edir. Ba\u015fqa s\u00f6zl\u0259 proqram \u2013 ma\u015f\u0131n\u0131n giri\u015fin\u0259 veril\u0259n informasiyalar\u0131 \u00e7\u0131x\u0131\u015f informasiyalar\u0131na \u00e7evir\u0259n, x\u00fcsusi \u015f\u0259kild\u0259 t\u0259rtib olunmu\u015f sonlu sayda ard\u0131c\u0131l \u0259mrl\u0259rd\u0259n ibar\u0259t alqoritmdir.<\/p>\n

Alqoritmin xass\u0259l\u0259ri. M\u0259s\u0259l\u0259nin ma\u015f\u0131nda h\u0259lli \u00fc\u00e7\u00fcn t\u0259rtib edil\u0259n alqoritm bir \u00e7ox \u015f\u0259rtl\u0259ri \u00f6d\u0259m\u0259lidir. Bu \u015f\u0259rtl\u0259r\u0259 alqoritmin xass\u0259l\u0259ri deyilir. H\u0259min xass\u0259l\u0259r a\u015fa\u011f\u0131dak\u0131lard\u0131r:
\n1. Alqoritm sonlu sayda m\u0259rh\u0259l\u0259d\u0259n sonra qurtarmal\u0131d\u0131r. Buna, alqoritmin sonluluq xass\u0259si deyilir.
\n2. Alqoritmin h\u0259r bir add\u0131m\u0131 d\u0259qiq v\u0259 birqiym\u0259tli t\u0259yin olunmal\u0131d\u0131r. Bu alqoritmin m\u00fc\u0259yy\u0259nlik xass\u0259sidir.
\n3. Alqoritmin m\u00fc\u0259yy\u0259n sayda giri\u015f qiym\u0259tl\u0259ri (m\u0259s\u0259l\u0259nin ba\u015flan\u011f\u0131c \u015f\u0259rtl\u0259ri) olmal\u0131d\u0131r. Bu \u015f\u0259rtl\u0259r proqram icra olunmam\u0131\u015f v\u0259 ya olunduqca ma\u015f\u0131na daxil edil\u0259 bil\u0259r.
\n4. Alqoritmin yerin\u0259 yetirilm\u0259si n\u0259tic\u0259sind\u0259 giri\u015f qiym\u0259tl\u0259rind\u0259n as\u0131l\u0131 olan bir v\u0259 ya bir ne\u00e7\u0259 \u00e7\u0131x\u0131\u015f qiym\u0259tl\u0259ri al\u0131nmal\u0131d\u0131r.
\n5. Alqoritm sad\u0259 v\u0259 s\u0259m\u0259r\u0259li olmal\u0131d\u0131r, y\u0259ni alqoritmin n\u0259tic\u0259si (cavab\u0131) m\u00fcmk\u00fcn q\u0259d\u0259r sad\u0259 \u0259m\u0259liyyatlar vasit\u0259sil\u0259 v\u0259 \u0259n q\u0131sa yolla al\u0131nmal\u0131d\u0131r.
\n6. Alqoritm \u00fcmumi olmal\u0131d\u0131r, y\u0259ni m\u00fc\u0259yy\u0259n m\u0259s\u0259l\u0259 \u00fc\u00e7\u00fcn t\u0259rtib olunmu\u015f alqoritm, h\u0259min tipd\u0259n (sinifd\u0259n) olan b\u00fct\u00fcn m\u0259s\u0259l\u0259l\u0259r \u00fc\u00e7\u00fcn yararl\u0131 olmal\u0131d\u0131r. Bu alqoritmin k\u00fctl\u0259vilik xass\u0259sidir<\/p>\n

Alqoritmin t\u0259svir vasit\u0259l\u0259ri. Alqoritmi m\u00fcmk\u00fcn q\u0259d\u0259r \u0259yani \u015f\u0259kild\u0259 g\u00f6st\u0259rm\u0259k \u00fc\u00e7\u00fcn a\u015fa\u011f\u0131dak\u0131 t\u0259svir vasit\u0259l\u0259rind\u0259n istifad\u0259 olunur:
\n1. Adi dild\u0259;
\n2. Blok-sxeml\u0259;
\n3. Alqoritmik dild\u0259.<\/p>\n

1. Alqoritmin adi dild\u0259 t\u0259sviri (n\u0259qli). Bu zaman \u0259m\u0259liyyatlar, icra olunacaq h\u0259r\u0259k\u0259tl\u0259rin n\u0259qli \u015f\u0259kild\u0259 ard\u0131c\u0131l sadalanmas\u0131 kimi verilir. M\u0259s\u0259l\u0259n, kofenin haz\u0131rlanmas\u0131n\u0131 ifad\u0259 ed\u0259n alqoritmin t\u0259sviri buna misal ola bil\u0259r.<\/p>\n

2. Alqoritmin blok-sxem t\u0259sviri. M\u00fcr\u0259kk\u0259b alqoritml\u0259rin t\u0259sviri zaman\u0131 blok-sxeml\u0259rd\u0259n istifad\u0259 olunmas\u0131 daha geni\u015f yay\u0131lm\u0131\u015fd\u0131r, \u00e7\u00fcnki bu halda alqoritmin blok-sxem \u015f\u0259klind\u0259 t\u0259sviri daha \u0259yani olur. Bu zaman, ad\u0259t\u0259n alqoritmin bir add\u0131m\u0131na bir blok uy\u011fun olur. Lakin bir blokda bir ne\u00e7\u0259 eyni tipli m\u0259rh\u0259l\u0259 v\u0259 ya bir m\u0259rh\u0259l\u0259 bir ne\u00e7\u0259 blokda t\u0259svir oluna bil\u0259r. Bloklar standart i\u015far\u0259l\u0259r \u015f\u0259klind\u0259 ifad\u0259 olunur v\u0259 bir-birl\u0259ri il\u0259 \u015faquli v\u0259 ya \u00fcf\u00fcqi x\u0259tl\u0259rl\u0259 birl\u0259\u015fdirilir. Birl\u0259\u015fdirici x\u0259tl\u0259rin uclar\u0131nda istiqam\u0259ti g\u00f6st\u0259r\u0259n ox i\u015far\u0259si qoyulur.<\/p>\n

3. Alqoritmin proqramla\u015fd\u0131rma dili vasit\u0259sil\u0259 t\u0259svir edilm\u0259si (alqoritmik dild\u0259). Alqoritmin proqramla\u015fd\u0131rma dilind\u0259 t\u0259sviri, ma\u015f\u0131n\u0131n icra ed\u0259c\u0259yi h\u0259r bir ki\u00e7ik \u0259m\u0259liyyat\u0131n m\u00fc\u0259yy\u0259n \u0259mrl\u0259rl\u0259 g\u00f6st\u0259rilm\u0259sind\u0259n ibar\u0259tdir. Proqramla\u015fd\u0131rma dili vasit\u0259sil\u0259 t\u0259svir \u00e7ox d\u0259qiq olmal\u0131d\u0131r, \u00e7\u00fcnki ma\u015f\u0131n ancaq ona verilmi\u015f proqramdak\u0131 \u0259mrl\u0259ri icra ed\u0259 bilir. \u00c7ox vaxt proqram\u0131 yazmam\u0131\u015fdan \u0259vv\u0259l m\u0259s\u0259l\u0259nin h\u0259ll alqoritminin blok-sxemini qururlar, sonra is\u0259 ona uy\u011fun proqram yaz\u0131l\u0131r. Alqoritmin proqramla\u015fd\u0131rma dili vasit\u0259sil\u0259 t\u0259sviri onun ixtiyari proqramla\u015fd\u0131rma dilind\u0259 yaz\u0131lmas\u0131n\u0131n m\u00fcmk\u00fcnl\u00fcy\u00fcn\u00fc g\u00f6st\u0259rir. Y\u0259ni tam kvadrat t\u0259nliyin alqoritmini ist\u0259nil\u0259n proqramla\u015fd\u0131rma dili vasit\u0259sil\u0259 t\u0259svir ed\u0259 (proqramla\u015fd\u0131ra) bil\u0259rik. Proqramla\u015fd\u0131rma dill\u0259ri haqq\u0131nda bir q\u0259d\u0259r sonra m\u0259lumat veril\u0259c\u0259k. Tam<\/p>\n

\"\"<\/p>\n

kvadrat t\u0259nliyin h\u0259ll alqoritminin (a-A, b-B, c-C olmaqla) FORTRAN dilind\u0259 yaz\u0131l\u0131\u015f\u0131n\u0131 bel\u0259 g\u00f6st\u0259rm\u0259k olar:<\/p>\n

 <\/p>\n

Alqoritmin tipl\u0259ri. EHM- d\u0259 m\u00fcxt\u0259lif tipli m\u0259s\u0259l\u0259l\u0259ri h\u0259ll ed\u0259rk\u0259n \u0259sas\u0259n \u00fc\u00e7 tipli alqoritml\u0259rd\u0259n istifad\u0259 olunur: x\u0259tti (d\u00fcz), budaqlanan v\u0259 d\u00f6vri.
\nX\u0259tti alqoritml\u0259r sad\u0259 hesablama prosesini ifad\u0259 ed\u0259n bir ne\u00e7\u0259 ard\u0131c\u0131l \u0259m\u0259liyyatlardan ibar\u0259t olur v\u0259 onlar yaz\u0131ld\u0131\u011f\u0131 ard\u0131c\u0131ll\u0131qla da icra olunur.<\/p>\n

Budaqlanma alqoritml\u0259rin t\u0259rkibind\u0259 bir v\u0259 ya bir ne\u00e7\u0259 m\u0259ntiq m\u0259rh\u0259l\u0259si olur. Bu m\u0259rh\u0259l\u0259d\u0259 m\u00fc\u0259yy\u0259n k\u0259miyy\u0259tl\u0259rin h\u0259r hans\u0131 bir \u015f\u0259rti \u00f6d\u0259yib-\u00f6d\u0259m\u0259diyi yoxlan\u0131l\u0131r v\u0259 ona uy\u011fun olaraq sonrak\u0131 gedi\u015fin istiqam\u0259ti se\u00e7ilir. Y\u0259ni n\u0259z\u0259rd\u0259 tutulan \u015f\u0259rt \u00f6d\u0259nilirs\u0259, bir istiqam\u0259t\u0259, h\u0259min \u015f\u0259rt \u00f6d\u0259nilmirs\u0259, ba\u015fqa istiqam\u0259t\u0259 do\u011fru h\u0259r\u0259k\u0259t edilir. Bel\u0259likl\u0259, alqoritmd\u0259 budaqlanma ba\u015f verir.<\/p>\n

Proqramla\u015fd\u0131rmada tez-tez eyni \u0259m\u0259liyyatlar qrupunun \u00e7oxlu sayda t\u0259krar olunmas\u0131 laz\u0131m g\u0259lir. Bu halda d\u00f6vr alqoritmind\u0259n istifad\u0259 olunur. D\u00f6vrl\u0259r sad\u0259 v\u0259 m\u00fcr\u0259kk\u0259b olur. Sad\u0259 d\u00f6vrl\u00fc alqoritmin bir d\u00f6vr\u00fc olur. \u018fg\u0259r h\u0259r hans\u0131 bir alqoritmd\u0259 bir ne\u00e7\u0259 daxili d\u00f6vr i\u015ftirak edirs\u0259, onda bel\u0259 d\u00f6vrl\u0259r\u0259 m\u00fcr\u0259kk\u0259b d\u00f6vr deyilir. M\u00fcr\u0259kk\u0259b d\u00f6vrl\u0259ri \u0259m\u0259l\u0259 g\u0259tir\u0259n sad\u0259 d\u00f6vrl\u0259r k\u0259si\u015f\u0259 bilm\u0259z.<\/p>\n

Proqramla\u015fd\u0131rma dill\u0259ri. Dil dedikd\u0259 \u2013 ist\u0259nil\u0259n i\u015far\u0259l\u0259r sistemini ba\u015fa d\u00fc\u015f\u0259c\u0259yik. \u0130\u015far\u0259 dedikd\u0259 is\u0259 informasiyan\u0131 \u00f6t\u00fcrm\u0259k \u00fc\u00e7\u00fcn x\u00fcsusi se\u00e7ilmi\u015f bir obyekt n\u0259z\u0259rd\u0259 tutulacaq. M\u0259s\u0259l\u0259n: ka\u011f\u0131zdak\u0131 h\u0259rf, \u0259l i\u015far\u0259si, sif\u0259tin ifad\u0259si, \u00e7eviricinin v\u0259ziyy\u0259ti v\u0259 s. Bu \u00e7ox \u00fcmumi bir t\u0259rif oldu\u011fundan bura heyvanlar\u0131n t\u0259bii dill\u0259rini, insanlar\u0131n dill\u0259rini d\u0259 daxil etm\u0259k olar. M\u00fcxt\u0259lif dill\u0259rin olmas\u0131 bir dild\u0259n ba\u015fqa bir dil\u0259 t\u0259rc\u00fcm\u0259 (translyasiya) problemini yarad\u0131r. Bel\u0259 baxanda, bizim b\u00fct\u00fcn f\u0259aliyy\u0259timiz bu v\u0259 ya ba\u015fqa m\u0259nada translyasiya il\u0259 ba\u011fl\u0131d\u0131r. Biz \u015f\u00fcurumuzda olan daxili t\u0259s\u0259vv\u00fcrl\u0259ri nitq\u0259, h\u0259r\u0259k\u0259t\u0259 v\u0259 s. \u00e7eviririk v\u0259 t\u0259rsin\u0259.
\nYeni obyekt yaratmaqla, biz onunla ba\u011fl\u0131 yeni bir dil d\u0259 yarad\u0131r\u0131q. M\u0259s\u0259l\u0259n, elmin inki\u015faf\u0131 x\u00fcsusi elmi dilin yaranmas\u0131na g\u0259tirib \u00e7\u0131xartd\u0131 (riyaziyyat, fizika v\u0259 s.).
\nBir qayda olaraq, sad\u0259 qur\u011fular\u0131, d\u00fcym\u0259l\u0259ri basmaqla, d\u0259st\u0259kl\u0259ri h\u0259r\u0259k\u0259t\u0259 g\u0259tirm\u0259kl\u0259 idar\u0259 etm\u0259k he\u00e7 d\u0259 \u00e7\u0259tin olmur. Amma el\u0259 m\u00fcr\u0259kk\u0259b obyektl\u0259r var ki, onlar\u0131 idar\u0259 etm\u0259k \u00fc\u00e7\u00fcn insan ya \u00e7\u0259tinlik \u00e7\u0259kir, ya da ola bilsin ki, he\u00e7 bacarm\u0131r. Bu halda, insanla ma\u015f\u0131n aras\u0131nda, bir n\u00f6v vasit\u0259\u00e7i \u2013 t\u0259rc\u00fcm\u0259\u00e7iy\u0259 ehtiyac olur. Bel\u0259 qur\u011fulara EHM\u2013l\u0259ri misal g\u0259tirm\u0259k olar. Onlar\u0131 idar\u0259 etm\u0259k \u00fc\u00e7\u00fcn insan \u00fc\u00e7\u00fcn sad\u0259 olan, onun dilin\u0259 yax\u0131n olan bir giri\u015f dilin\u0259 ehtiyac olur.
\nQeyd ed\u0259k ki, EHM -l\u0259r insan t\u0259r\u0259find\u0259n yarad\u0131lm\u0131\u015f obyektl\u0259r s\u0131ras\u0131nda \u0259n \u00e7\u0259tin idar\u0259 olunanlardand\u0131r. Bu m\u0259s\u0259l\u0259 o q\u0259d\u0259r obeyktin m\u00fcr\u0259kk\u0259bliyind\u0259n yox, daha \u00e7ox onun dilinin ( ma\u015f\u0131n dili \u2013 2-lik kodlar) insan dilind\u0259n uzaq olmas\u0131d\u0131r. Ona g\u00f6r\u0259 d\u0259 istehsal\u00e7\u0131lar\u0131n v\u0259 proqram\u00e7\u0131larin maraqlar\u0131n\u0131 n\u0259z\u0259r\u0259 alaraq bir \u00fcnsiyy\u0259t vasit\u0259sin\u0259 ehtiyac yaran\u0131r.
\nProqramla\u015fd\u0131rma dill\u0259ri adi dill\u0259rd\u0259n \u201cs\u00f6zl\u0259rin\u201d (ancaq translyatorun ba\u015fa d\u00fc\u015fd\u00fcy\u00fc) say\u0131na v\u0259 \u0259mrl\u0259rin ciddi yaz\u0131l\u0131\u015f qaydas\u0131na g\u00f6r\u0259 f\u0259rql\u0259nir. EHM-d\u0259 proqram yazmaq \u00fc\u00e7\u00fcn istifad\u0259 olunan formalla\u015fm\u0131\u015f dill\u0259r\u0259 proqramla\u015fd\u0131rma dill\u0259ri deyilir.
\nIst\u0259nil\u0259n proqramla\u015fd\u0131rma dilinin \u0259sas elementl\u0259ri bunlard\u0131r: dilin \u0259lifbas\u0131, sintaksisi v\u0259 semantikas\u0131.
\nDilin \u0259lifbas\u0131 dedikd\u0259, h\u0259min dild\u0259 i\u015fl\u0259n\u0259n b\u00fct\u00fcn simvollar n\u0259z\u0259rd\u0259 tutulur.
\nSintaksis- \u0259lifbada olan simvollardan dilin ayr\u0131-ayr\u0131 konstruksiyalar\u0131n\u0131n (komandalar\u0131n, operatorlar\u0131n) d\u00fcz\u0259ldilm\u0259sinin formal qaydalar\u0131d\u0131r. Bu qaydalar m\u00fcxt\u0259lif h\u0259ll alqoritml\u0259rini proqramla\u015fd\u0131rma\u011fa imkan verir.
\nSemantika- dilin bu v\u0259 ya dig\u0259r sintaksis konstruksiyalar\u0131n\u0131n t\u0259sviridir. M\u0259s\u0259l\u0259n, \u0259g\u0259r proqram\u0131n bu yerind\u0259 y =a*(b+c) ifad\u0259sinin hesablanmas\u0131 yaz\u0131l\u0131bsa, onda semantika qaydalar\u0131 ma\u015f\u0131na \u201cg\u00f6st\u0259rir\u201d ki, \u0259vv\u0259lc\u0259 (b+c) c\u0259mini taps\u0131n, sonra h\u0259min c\u0259mi a-ya vursun.
\nBel\u0259likl\u0259, h\u0259r hans\u0131 veril\u0259nl\u0259rin emal\u0131 prosesini birba\u015fa h\u0259yata ke\u00e7irm\u0259y\u0259 imkan ver\u0259n proqramlar, dili t\u0259yin ed\u0259n sintaksis qaydalara uy\u011fun olaraq \u0259lifbadak\u0131 simvollar\u0131n birl\u0259\u015fm\u0259si n\u0259tic\u0259sind\u0259 v\u0259 semantika qaydalar\u0131n\u0131 n\u0259z\u0259r\u0259 almaqla i\u015fl\u0259nib haz\u0131rlan\u0131r.
\nTranslyator v\u0259 kompilyatorlar. Proqramla\u015fd\u0131rma dili vasit\u0259sil\u0259 haz\u0131r proqram yox, ancaq qurulmu\u015f alqoritmi t\u0259svir ed\u0259n m\u0259tn yarad\u0131l\u0131r. \u0130nsan\u0131n ba\u015fa d\u00fc\u015fd\u00fcy\u00fc dild\u0259 olan bu proqram ma\u015f\u0131n\u0131n ba\u015fa d\u00fc\u015fd\u00fcy\u00fc dil\u0259 \u00e7evrilm\u0259lidir. Bunun \u00fc\u00e7\u00fcn komp\u00fcterd\u0259 translyatorlar v\u0259 kompilyatorlar olur.
\nProqram ancaq onlar\u0131n translyatorlar\u0131 olan halda icra oluna bil\u0259rl\u0259r. Translyatordan f\u0259rqli olaraq kompilyatorlar exe-fayllar\u0131n yarad\u0131lmas\u0131 \u00fc\u00e7\u00fcn istifad\u0259 olunur ki, onlar da s\u0259rb\u0259st icra oluna bil\u0259rl\u0259r (y\u0259ni, proqpamin yazildi\u011f\u0131 m\u00fchitd\u0259n (sistemd\u0259n) as\u0131l\u0131 olmadan).
\nProqramla\u015fd\u0131rma dill\u0259rinin s\u0259viyy\u0259l\u0259ri. M\u00fcxt\u0259lif tip prosessorlar m\u00fcxt\u0259lif tip \u0259mrl\u0259r sistemin\u0259 malikdir. \u018fg\u0259r proqramla\u015fd\u0131rma dili konkret prosessor tipin\u0259 y\u00f6n\u0259libs\u0259 v\u0259 onun x\u00fcsusiyy\u0259tl\u0259rini n\u0259z\u0259r\u0259 al\u0131rsa, onda ona a\u015fa\u011f\u0131 s\u0259viyy\u0259li proqramla\u015fd\u0131rma dili deyirl\u0259r. Assembler a\u015fa\u011f\u0131 s\u0259viyy\u0259li proqramla\u015fd\u0131rma dilidir. \u00c7\u00fcnki o, bir \u0259mri mnemonika adlanan simvol i\u015far\u0259m\u0259l\u0259rinin k\u00f6m\u0259yil\u0259 \u0259d\u0259dl\u0259r \u015f\u0259klind\u0259 yox, ma\u015f\u0131n kodlar\u0131 \u015f\u0259klind\u0259 verir. Assemblerin k\u00f6m\u0259yil\u0259 \u00e7ox s\u0259m\u0259r\u0259li v\u0259 kompakt proqramlar yaratmaq m\u00fcmk\u00fcnd\u00fcr. Assemblerd\u0259n ad\u0259t\u0259n, sistem \u0259lav\u0259l\u0259rin, drayver-proqramlar\u0131n, komp\u00fcterin aparat resurslar\u0131na m\u00fcraci\u0259t ed\u0259n proqram modullar\u0131n\u0131n haz\u0131rlanmas\u0131 \u00fc\u00e7\u00fcn istifad\u0259 olunur. A\u015fa\u011f\u0131 s\u0259viyy\u0259li proqramla\u015fd\u0131rma dill\u0259rind\u0259n, ad\u0259t\u0259n y\u00fcks\u0259k s\u0259viyy\u0259li pe\u015f\u0259kar proqram\u00e7\u0131lar istifad\u0259 edir. Bu dill\u0259rd\u0259 tutulan proqramlar yadda\u015fda az yer tutmaqla yana\u015f\u0131, daha s\u00fcr\u0259tl\u0259 icra olunurlar. Y\u00fcks\u0259k s\u0259viyy\u0259li proqramla\u015fd\u0131rma dill\u0259ri is\u0259 adi dil\u0259 daha yax\u0131n v\u0259 insan \u00fc\u00e7\u00fcn daha ayd\u0131n ba\u015fa d\u00fc\u015f\u00fcl\u0259ndir.<\/p>\n

\u00c7ox yay\u0131lm\u0131\u015f, b\u0259zi proqramla\u015fd\u0131rma dill\u0259ri haqq\u0131nda m\u0259lumat ver\u0259k.
\nFortran – Cim Bekus t\u0259r\u0259find\u0259n 1954-c\u00fc ild\u0259 yarad\u0131lm\u0131\u015f ilk kompilyas\u0131ya olunan proqramla\u015fd\u0131rma dilidir. Bu dild\u0259 ilk d\u0259f\u0259 olaraq proqramla\u015fd\u0131rman\u0131n \u0259n vacib anlay\u0131\u015flar\u0131 realiz\u0259 olunmu\u015fdur. Ondan b\u00fct\u00fcn d\u00fcnyada istifad\u0259 olunur. 2000-ci ild\u0259 onun yeni F2k versiyas\u0131 yarad\u0131lm\u0131\u015fd\u0131r. Fortrandan \u0259sas\u0259n riyazi, texniki m\u0259s\u0259l\u0259l\u0259rin proqramla\u015fd\u0131r\u0131lmas\u0131 \u00fc\u00e7\u00fcn istifad\u0259 olunur.
\nCobol – 1960-c\u0131 ill\u0259rd\u0259 yarad\u0131l\u0131b. \u018fsas\u0259n iqtisadiyyat sah\u0259sind\u0259 biznes m\u0259s\u0259l\u0259l\u0259rinin h\u0259lli \u00fc\u00e7\u00fcn n\u0259z\u0259rd\u0259 tutulan kompilyasiya olunan bir dildir. Bu dil \u00f6z\u00fcn\u00fcn \u201c\u00e7oxs\u00f6zl\u00fcl\u00fcy\u00fc\u201d il\u0259 f\u0259rql\u0259nir. B\u0259z\u0259n onun \u0259mrl\u0259ri ingilis ifad\u0259l\u0259rind\u0259n he\u00e7 d\u0259 f\u0259rql\u0259nmir. Bu dild\u0259, hal-haz\u0131rda aktiv sur\u0259td\u0259 istismar olunan \u00e7oxlu sayda \u0259lav\u0259l\u0259r haz\u0131rlanm\u0131\u015fd\u0131r.
\nPascal – 1970-ci ill\u0259rin sonunda Niklaus Virt t\u0259r\u0259find\u0259n yarad\u0131lm\u0131\u015fd\u0131r. Ondan b\u00f6y\u00fck layih\u0259l\u0259rin haz\u0131rlanmas\u0131nda m\u00fcv\u0259ff\u0259qiyy\u0259tl\u0259 istifad\u0259 etm\u0259k \u00fc\u00e7\u00fcn imkanlar n\u0259z\u0259rd\u0259 tutulmu\u015f, proqram\u0131n strukturuna olan t\u0259l\u0259bl\u0259r g\u00fccl\u0259ndirilmi\u015fdir.
\nBasic \u2013 Bu dil \u00fc\u00e7\u00fcn h\u0259m kompilyatorlar, h\u0259m d\u0259 interpretatorlar m\u00f6vcuddur. \u0130lk d\u0259f\u0259 proqramla\u015fd\u0131rman\u0131 \u00f6yr\u0259nm\u0259k m\u0259qs\u0259dil\u0259 1960-c\u0131 ill\u0259rd\u0259 yarad\u0131lan bu dil d\u00fcnyada \u0259n geni\u015f yay\u0131lm\u0131\u015f dill\u0259rd\u0259ndir.
\nC – Bu dil yaranan g\u00fcnd\u0259n k\u00fctl\u0259vi istifad\u0259 \u00fc\u00e7\u00fcn n\u0259z\u0259rd\u0259 tutulmam\u0131\u015fd\u0131r. Sad\u0259c\u0259, assembleri \u0259v\u0259z ed\u0259n bir proqram kimi planla\u015fd\u0131r\u0131lm\u0131\u015fd\u0131r. Y\u0259ni o, h\u0259m assembler kimi effektiv v\u0259 kompakt proqramlar yaratmaq imkan\u0131na malik olmaqla yana\u015f\u0131, h\u0259m d\u0259 konkret tip prosessorlardan as\u0131l\u0131 olmal\u0131 idi.
\nC++ – C-nin obyekty\u00f6n\u00fcml\u00fc geni\u015fl\u0259nm\u0259si olan bu dil 1980-c\u0131 ild\u0259 yarad\u0131lm\u0131\u015fd\u0131r. Bu dild\u0259 proqram\u00e7\u0131n\u0131n m\u0259hsuldarl\u0131\u011f\u0131n\u0131 k\u0259skin \u015f\u0259kild\u0259 art\u0131ra bil\u0259c\u0259k \u00e7oxlu sayda imkanlar n\u0259z\u0259rd\u0259 tutulmu\u015fdur.
\nJava – Bu dil 1990-c\u0131 ill\u0259rin \u0259vv\u0259lind\u0259 C++ dilinin \u0259sas\u0131nda yarad\u0131lm\u0131\u015fd\u0131r. O, C++-da olan b\u00fct\u00fcn a\u015fa\u011f\u0131 s\u0259viyy\u0259li imkanlar\u0131 aradan \u00e7\u0131xardaraq \u0259lav\u0259l\u0259rin i\u015fl\u0259nib haz\u0131rlanmas\u0131n\u0131 sad\u0259l\u0259\u015fdirm\u0259y\u0259 y\u00f6n\u0259lmi\u015fdir.
\nBaza veril\u0259nl\u0259rin proqramla\u015fd\u0131rma dill\u0259ri. Bu qrup dill\u0259r alqoritmik dill\u0259rd\u0259n h\u0259ll etdiyi m\u0259s\u0259l\u0259l\u0259r\u0259 g\u00f6r\u0259 f\u0259rql\u0259nir. \u0130lk bazalar b\u00f6y\u00fck informasiya massivl\u0259rinin emal\u0131na v\u0259 m\u00fc\u0259yy\u0259n \u0259lam\u0259t\u0259 g\u00f6r\u0259 bir qrup informasiyan\u0131n se\u00e7ilm\u0259sin\u0259 ehtiyac olanda yarad\u0131lm\u0131\u015fd\u0131r. Bunun \u00fc\u00e7\u00fcn strukturla\u015fd\u0131r\u0131lm\u0131\u015f sor\u011fular dili SQL (structured query language) dili yarad\u0131lm\u0131\u015fd\u0131r. O g\u00fccl\u00fc riyazi n\u0259z\u0259riyy\u0259y\u0259 \u0259saslanmaqla veril\u0259nl\u0259r bazas\u0131n\u0131 effektiv emal etm\u0259y\u0259 imkan yarad\u0131r.
\nB\u00f6y\u00fck veril\u0259nl\u0259r bazalar\u0131n\u0131 idar\u0259 etm\u0259k, onlar\u0131 effektiv emal etm\u0259k \u00fc\u00e7\u00fcn VB\u0130S (veril\u0259n bazas\u0131n\u0131n idar\u0259etm\u0259 sistemi) yarad\u0131ld\u0131. Hal-haz\u0131rda d\u00fcnyada 5 apar\u0131c\u0131 VB\u0130S istehsal\u00e7\u0131s\u0131n\u0131 g\u00f6st\u0259r\u0259 bil\u0259rik: Microsoft (SQL Server), \u0130BM (DB2), Oracle Software AG (Adabas), \u0130nformix v\u0259 Sybase. Onlar\u0131n m\u0259hsullar\u0131 \u015f\u0259b\u0259k\u0259d\u0259 minl\u0259rl\u0259 istifad\u0259\u00e7inin eyni zamanda i\u015fini d\u0259st\u0259kl\u0259yir, veril\u0259nl\u0259r bazalar\u0131 is\u0259 paylanm\u0131\u015f \u015f\u0259kild\u0259 bir ne\u00e7\u0259 serverd\u0259 saxlan\u0131la bil\u0259r.
\n\u0130nternet \u00fc\u00e7\u00fcn proqramla\u015fd\u0131rma dill\u0259ri. HTML (HiperText Markup Language) \u00e7ox tan\u0131nm\u0131\u015f, sad\u0259 bir dil olmaqla, m\u0259tnin formatla\u015fd\u0131r\u0131lmas\u0131, \u015f\u0259kill\u0259rin \u0259lav\u0259 olunmas\u0131, \u015firifl\u0259rin v\u0259 r\u0259ngl\u0259rin verilm\u0259si, istinadlar\u0131n v\u0259 c\u0259dv\u0259ll\u0259rin t\u0259rtib olunmas\u0131 kimi elementar \u0259mrl\u0259r\u0259 malikdir. \u00c7ox WEB- s\u0259hif\u0259l\u0259r HTML- d\u0259 v\u0259 onun geni\u015fl\u0259ndirilmi\u015f variantlar\u0131nda yaz\u0131lm\u0131\u015fd\u0131r.
\n1980-c\u0131 ill\u0259rd\u0259 PERL dili i\u015fl\u0259nib haz\u0131rland\u0131. O, b\u00f6y\u00fck m\u0259tn fayllar\u0131n\u0131n effektiv emal olunmas\u0131, m\u0259tn hesabatlar\u0131n\u0131n qenerasiya olunmas\u0131 v\u0259 m\u0259s\u0259l\u0259l\u0259rin idar\u0259 olunmas\u0131 vasit\u0259si kimi yarad\u0131lm\u0131\u015fd\u0131. Onun s\u0259trl\u0259rl\u0259, massivl\u0259rl\u0259 i\u015fl\u0259m\u0259k funksiyalar\u0131, veril\u0259nl\u0259rin \u00e7evrilm\u0259si vasit\u0259l\u0259ri, sistem informasiya il\u0259 i\u015fl\u0259m\u0259k imkanlar\u0131 da \u00e7ox geni\u015fdir.
\nWindows \u0259m\u0259liyyatlar sisteminin yaranmas\u0131 il\u0259 ba\u011fl\u0131 bu m\u00fchitd\u0259 i\u015fl\u0259y\u0259n yeni proqramla\u015fd\u0131rma dill\u0259ri d\u0259 meydana \u00e7\u0131xm\u0131\u015fd\u0131r. Bunlardan Visial Basic, Visial Delphy, Visial C v\u0259 b. g\u00f6st\u0259rm\u0259k olar. Bu proqramlar\u0131n k\u00f6m\u0259yil\u0259 m\u00fcxt\u0259lif tip praktik m\u0259s\u0259l\u0259l\u0259ri h\u0259ll etm\u0259k olar. \u201cVisial\u201d yaz\u0131s\u0131 onu g\u00f6st\u0259rir ki, h\u0259min proqram vasit\u0259si qrafik istifad\u0259\u00e7i interfeysin\u0259 malikdir. Y\u0259ni Windows sistemin\u0259 aid olan b\u00fct\u00fcn imkanlardan h\u0259min proqram vasit\u0259si istifad\u0259 ed\u0259 bil\u0259r.<\/p><\/blockquote>\n

<\/div>
\r\n