18-ma’ruza: Qurilishda axborot jarayonlarini algoritmlash va dasturlash. Reja

18-MA’RUZA: Qurilishda axborot jarayonlarini algoritmlash va dasturlash.


REJA:

1. 
   Algoritm tushunchasi.
   
2. 
   Algoritmning xossalari.
   
3. 
   Algoritmning turlari.
   
4. 
   Algoritmning tasvirlash usullari.
   

Tayanch so’zlar: Algoritm, diskretlilik, tushunarlilik, aniqlik, ommaviylik, natijaviylik, blok-sxemalar, tarmoqlanuvchi algoritmlar, takrorlanuvchi algoritmlar, siklik algoritmlar.

Yuqorida qayd qilganimizdek, qo‘yilgan biror masalani kompyuterda yechish uchun, avval uning matematik modelini, keyin algoritmini va programmasini tuzish kerak bo‘ladi. Bu uchlikda algoritm bloki muhim ahamiyatga ega. Endi algoritm tushunchasining ta’rifi va xossalarini bayon qilamiz.

Algoritm bu oldimizga qo‘yilgan masalani yechish uchun zarur bo‘lgan amallar ketma-ketligidir.
Algoritm so‘zi va tushunchasi IX asrda yashab ijod etgan buyur alloma Muhammad al-Xorazmiy nomi bilan uzviy bog‘liq. Algoritm so‘zi Al-Xorazmiy nomini Yevropa olimlari tomonidan buzib talaffuz qilinishidan yuzaga kelgan. Al-Xorazmiy birinchi bo‘lib o‘nlik sanoq sistemasining tamoyillarini va undagi to‘rtta amallarni bajarish qoidalarini asoslab bergan.
In mathematics and computer science, an algorithm is a self-contained step-by-step set of operations to be performed. Algorithms perform calculation, data processing, and/or automated reasoning tasks.
The words 'algorithm' and 'algorism' come from the name al-Khwārizmī. Al-Khwārizmī (Persian: خوارزمی‎‎, c. 780–850) was a Persian mathematician, astronomer, geographer, and scholar.
Zamonamizning buyuk olimi Al Xorazmiy (780-850) algoritmga asos solgan.
An algorithm is an effective method that can be expressed within a finite amount of space and time[1] and in a well-defined formal language[2] for calculating a function.[3] Starting from an initial state and initial input (perhaps empty),[4] the instructions describe a computation that, when executed, proceeds through a finite[5] number of well-defined successive states, eventually producing "output"[6] and terminating at a final ending state. The transition from one state to the next is not necessarily deterministic; some algorithms, known as randomized algorithms, incorporate random input.[7]¹