4.3. Murakkab tarmoqlangan hisoblash jarayonining algoritmi
Murakkab tarmoqlangan hisoblash jarayonida bitta yoki ikkala tarmoqlarda ham
mantiqiy ifodalarni hisoblash bloklari bo‗ladi (4.5-rasm).
1
2
3
4
5
Kiritish
x
x>0
Y=x-5
Y=x+5
Chiqarish
y
Boshlash
Tamom
Ha
Yo‘q
1
2
3
4
5
43
a)
b)
c)
4.5-rasm. Murakkab tarmoqlangan hisoblash jarayonining algoritmlari
18
18
R.Dadabayeva, Sh.Nasridinova, N.Shoaxmedova, L.Ibragimova, Sh.Ermatov. Axborot-kommunikatsion
texnologiyalar va tizimlar.-T.: ―Sano-standart‖ nashriyoti. O`quv qo`llanma. 2017.B. 260
44
Masala 2. Quyidagi ifodani hisoblashning blok-chizmasini tuzing (4.6-rasm).
x < 0 bo‗lganda, x
2
,
y= x = 0 bo‗lganda, 25,
x > 0 bo‗lganda, lnx.
4.6-rasm. Masala yechimining blok-chizmasi
4.6-rasmda murakkab tarmoqlangan jarayoni algoritmining blok-chizmasi
keltirilgan. Bu erda tarmoqlanish uchta yo‗nalish bo‗yicha bo‗lishi mumkin: 2,4,7;
2,3,5,7; 2,3,6.
Masala 3. Berilgan uchta A, V, S sonlarning eng kichigi kvadratini topish
algoritmining blok-chizmasini tuzing. Natijani R harfi bilan belgilaymiz (4.7-rasm).
Kiritish
x
x<0
x=0
y= x
2
y= 25
y= lnx
Chiqarish
y
Boshlash
Tamom
7
4
5
6
3
2
1
45
R= B
1
Yo‗q
Ha
Ha
Yo‗q
|
