nyuuzyou/kompy huggingface dataset:
Ultra fast cnn based Hardware Computing Platform Concepts for adas visual Sensors and Evolutionary Mobile Robots - bet 53

83
Chapter 8
8.
Implementation of CNN on GPU
In this chapter the focus lies on the following research question:
“Can it be
demonstrated by a series of concrete image processing examples of relevance for ADAS, that
CNN based processing does really meet the hard requirements related to speed and
robustness?“
Every millisecond during driving is important. This could be a minimum interval for
processing signals in vehicles. In some cases such as Lane Departure Warning (LDW),
Adaptive Cruise Control (ACC), Emergency Brake Assist (EBA) and Blind Spot Detection
(BSD) system should take a decision in a few milliseconds. Main bottleneck for video based
ADAS is preprocessing image and preparation for extracting meaningful data from the
image. DSP board could be a good alternative solution but due to complexity of image
preprocessing, we do need a very robust and flexible platform which has potential of
cascading function, sharing memory, soft reconfiguration and high speed processing.
Hence, CNN architecture which implemented on FPGA or GPU could be more interesting
for us. In ADAS the sequence of image preprocessing is clear for designer; therefore a
flexible architecture which can reconfigure the system and change the functionality of the
module by a small matrix template would be very interesting for them. High definition
quality of image and performing complex filter in term of computation time, color space
conversion, and extracting features in ADAS technology are hard requirements related to
the speed and robustness.
|
Ultra fast cnn based Hardware Computing Platform Concepts for adas visual Sensors and Evolutionary Mobile Robots - bet 55

8.3
Theory of Parallel Computing
Traditionally, computer software has been written for the serial computation and time
sharing computation. Therefore to solve a problem, an algorithm is constructed which
produces a serial stream of instructions. These produced instructions are executed
sequentially one after the other on the CPU of the computer.
87
Parallel computing on the other hand uses multiple processing elements simultaneously on
a problem. The problem is broken into parts which are independent so that each
processing element can execute its part of the algorithm simultaneously with others. The
processing elements can be diverse and include resources such as a single computer with
multiple processors, a number of networked computers, specialized hardware or any
combination of any of the above. The software speedup was achieved by using a CPU with
higher clock rates, which significantly increased each passing year. However, when clock
speed reached 4GHz, the increase in power consumption and heat dissipation formed what
is known as the “Power Wall”
which effectively caused the CPU clock rate to level off [136].
Along with this, many applications today require more computing power than a traditional
sequential computer can offer. All these things made the vendors search for an alternative
to make increase of available cores with in a processor instead of increasing the clock
rates. The increase of cores on the processor made the CPU clock rates to remain same or
even reduced to economize the power usage. The old software design used for the
sequential process will not get increased directly with the increase in the processor cores.
To get the benefit form the current developed multi core processor, new software has to be
designed to take the advantages of the new architecture. This makes the use of all available
multi cores and performs process in parallel. Parallel computing is defi
ned as “a form of
computation in which many calculations are carried out simultaneously, operating on the
principle that large problems can often be divided into smaller ones, which are then solved
concurrently (in parallel)".
Many different hardware architectures exist today to perform a single task using multiple
processors. Some examples are: Grid computing
–
a combination of computer resources
from multiple administrative domains applied to a common task.
Massively Parallel
Processor
(MPP) systems
–
known as the supercomputer architecture Cluster server
system
–
a network of general-purpose computers.
Symmetric Multiprocessing
(SMP)
system
–
identical processors (in powers of 2) connected together to act as one unit. Multi-
core processor
–
a single chip with numerous computing cores [136]. Heterogeneous
computing systems also provide an opportunity to dramatically increase the performance
of parallel and HPC applications on clusters with CPU and GPU architecture [137]. This
concept can be achieved by combining the GPU and multicore CPUs.
|
Ishlash tartibi - Цьу \ / М. M o‘minov, A. Mamadaliyev, A. To‘xtaboyev botanikadan amaliy mashg‘ulotlar

oyna bilan yopiladi va m ikroskopning sal katta
qilib k o ‘rsatadigan obyektivi orqali qaraladi.
Bunda
ju d a mayda, sariq ch o ‘ziq hujay
ralar k o ‘rinadi. M ikroskopning katta qilib
k o ‘rsatadigan obyektivida esa hujayra sirtida
palla borligi, buning o ‘rta qism ida “b o ‘g ‘im lar”
(tuguncha)joylashganligi k o ‘rinadi, b o ‘g ‘im ning
ikkitasi hujayranitig ichki uchida, bittasi o ‘rtasida
joylashadi. B o 'g ‘im lar orasida “chok” b o ‘lib,
shu chok vositasida protoplast tashqi m uhit
bilan
m unosabatda boMib
turadi ham da pinnulyariya
harakat qiladi. Pinnulyariyaning to ‘lqinsim on
57-
rasm.
Pinnulariya:
harakatini m ikroskopda k o ‘rish m um kin. Hu-
A) yonidan ko'rinishi; jayrad a sitoplazm a va yadro b o ia d i. H ujayra
B) enidan ko'rinishi.
,
. .
. ,
, . ,
,
, .
.
.
.
po sti devon bo ylab qo ng lr-sanq rangda len-
tasim on xrom atofor joylashadi.
Bitta pinnulariyadagi palla, chok, b o ‘g ‘in,
xrom otofom ing ras-
mini daftarga chizib olinadi.
Nazorat savollari:
1. D iatom su v o ‘tlari qayerlarda yashaydi?
2. U ning tashqi va ichki tuzilishini ayting?
3. D iatom su v o 'tla ri qanday usullarda k o 'p ay a d i?
Yashil suvo‘tlari (Chlorophyta boMimi)
Yashil suvo4lam ing xrom atoforlarida faqat xlorofill b o ‘lib,
boshqa pigm entlar bilan niqoblanm agani uchun yashil tusda
ko'rinadi. U lar bir hujayrali, k o ‘p hujayrali va koloniyali b o ‘lib ya
shaydi (56 - 57- rasm lar). Hujayralari sirt tom onidan b a ’zan pig-
mentli selluloza bilan qoplangan.
H ujayra ichida sitoplazm a, hu
jay ra shirasi bitta, b a ’zan bir nechta yadro ham da yashil xrom atofor
boMadi. X rom atofor spiral, to ‘rsimon, donador, lentasim on shakl-
larda b o ‘ladi. Bu b o ‘lim ga taalluqli k o ‘pgina suvo‘tlarining xro-
m atoforida
pirenoid deb ataladigan qattiq, dum aloq tanacha paydo
b o ‘ladi. Bu tanacha atrofida kraxm al to ‘planadi.
Yashil suvo‘tlari vegatativ, spora hosil qilish va jin siy y o ‘l bilan
ko‘payadi.
Yashash sharoiti qulay boMganda vegetativ, y a 'n i hujayrasi-
ning ikkiga b o ‘linishi yoki k o ‘p hujayrali ipining uzilishi y o ‘li bilan
ko‘payadi. A m m o zoospora
hosil qilib, urchish eng tipik k o ‘payish
hisoblanadi. Yashash sharoiti o g ‘irlashganda, bu suvo‘t jinsiy y o ‘l
bilan, y a ’ni kopulatsiya yoki konyugatsiya usulida k o ‘payadi.
Yashil suvo‘tlar uch sinfga b o ‘linadi: chin yashil suvo‘tlari
(Eusxlorophyta), konyugatalar (Sonjugatae), xaralar (Charae).
Chin yashil suvo‘tlar sinfidan ikki tartibning vakillari o ‘rganiladi.
58- rasm.
Ulotriks
59- rasm.
Volvoks
Few words to say about this book - bet 75

136
READING PASSAGE 8
Striking Back at Lightning With Lasers
Seldom is the weather more dramatic than when thunderstorms strike. Their electrical fury inflicts death or
serious injury on around 500 people each year in the United States alone. As the clouds roll in, a leisurely
round of golf can become a terrifying dice with death - out in the open, a lone golfer may be a lightning bolt’s
most inviting target. And there is damage to property too. Lightning damage costs American power companies
more than $100 million a year.
But researchers in the United States and Japan are planning to hit back. Already in laboratory trials they have
tested strategies for neutralising the power of thunderstorms, and this winter they will brave real storms,
equipped with an armoury of lasers that they will be pointing towards the heavens to discharge thunderclouds
before lightning can strike.
The idea of forcing storm clouds to discharge their lightning on command is not new. In the early 1960s,
researchers tried firing rockets trailing wires into thunderclouds to set up an easy discharge path for the huge
electric charges that these clouds generate. The technique survives to this day at a test site in Florida run by the
University of Florida, with support from the Electrical Power Research Institute (EPRI), based in California.
EPRI, which is funded by power companies, is looking at ways to protect the United States’ power grid
from lightning strikes. ‘We can cause the lightning to strike where we want it to using rockets,’ says Ralph
Bernstein, manager of lightning projects at EPRI. The rocket site is providing precise measurements of
lightning voltages and allowing engineers to check how electrical equipment bears up.
Figure - Ultra fast cnn based Hardware Computing Platform Concepts for adas visual Sensors and Evolutionary Mobile Robots

80
mechanism for loading data and storing it in the internal registers. For convolution based
video pre-processing we can just load the matrix coefficient that can change the
functionality of the system, and in the case of CNN we must change two different templates
and bias values. We know that the Impulse C from CoDeveloper is based on the
Communication Sequential Processor programming model. And it can generate the entire
necessary internal signal for synchronization and communication between hardware
modules. But for communication and exchanging values between hardware modules and
processor, there are some methods such as Processor Local Bus (PLB) and Fast and
Simplest Link (FSL). If we need only communication between two given modules, FSL is
the best, but for communication between a master and many slave modules, PLB can be
helpful. For Video and Image processing we do not need any high processing over the
processor, and the only reason behind that is initializing, re-configuring and debugging the
system; see Refs [124-126].
Figure - Ultra fast cnn based Hardware Computing Platform Concepts for adas visual Sensors and Evolutionary Mobile Robots

81
convolution calculations for every 3 rows, we can send it to the video output. In CNN, we
have to keep those pixels values in a buffer for the next n iterations. The number of n is
depending on the accuracy and on the DDA approximation. For this work we have used a
32bit MicroBlaze CPU for a combination of both hardware and software; hardware
convolution modules must connect to the memory and data path according to the Figure 7-
1 architecture. All the parameters and data can be transmitted between modules and
memory, which is based on FIFO stream buffers and
Processor Local Bus
(PLB) technique;
see Refs [127, 128].
7.10
Direct convolution vs. CNN
–
performance comparison
We have found by experience that in our design image smoothing operators, whether
linear or non-linear, such as uniform filter, median filter, Gaussian filter and so on, which is
easy to model by a direct convolution, are faster than a CNN based processing for the same.
The results of first order and second order derivatives for finding edging in direct
convolution was also faster than CNN implementation. The direct convolution method
needed only two clock pulses for each pixel, while CNN needed 10 clocks (it depends on the
number of DDA iterations).
Figure - Ultra fast cnn based Hardware Computing Platform Concepts for adas visual Sensors and Evolutionary Mobile Robots

82
implement these operations only by cascading convolution operators and some Boolean
arithmetic operations. For the complex algorithms like “skeleton”, CNN has clearly a very
good potential and it is easy to find a template to extract the image skeleton; see Refs [18,
129] [93, 96, 130].
7.11
Conclusion
In this chapter, a new method for CNN emulation on FPGA for real time machine vision
applications has been proposed. The system is implemented on Xilinx XtremeDSP kit 3400,
which is very flexible for video and image processing applications. The video is tested on
DVI and Camera in connection with 1024×768 pixels and 60 fps monochrome for direct
convolution and near 24 fps CNN emulation. The maximum frequency of the system is
200MHZ. The Computation of pixel operations for convolution method does only take two
clock pulses. And for the CNN implementation the number of clock pulses needed for a give
processing did depend on the accuracy needed to repeat the DDA iterations. The whole
design has been made by ISE 11.2, EDK 11.2 and Impulse CoDeveloper 6.3. The main
features of the convolution technique is that we don’t need to access to the ext
ernal
memory and the frame rate is high. That’s why it takes only two clock pulses. For
implementing complex filters such as nonlinear image processing, CNN-based processing is
clearly much better than convolution operations. To achieve the same result by cascading
some convolution operators would result is a significantly slower process than using only
one CNN operation processing.
Uslub: Aralash.

Shakl - 1- dars. Mavzu: Masalalarni kompyuterda yechish bosqichlari Darsning texnologik xaritasi

Uslub: Aralash.
Shakl: Savol-javob. Jamoa va kichik guruhlarda ishlash
Vosita: Elektron resurslar, darslik, plakatlar, tarqatma materiallar.
Usul: Tayyor prezentatsiya va slayd materiallari asosida.
Nazorat: Og'zaki, savol-javob, muhokama, kuzatish.
Baholash: Rag'batlantirish, 5 ballik reyting tizimi asosida.
Kutiladigan natijalar
|
O`quvchilar Paskal tilining alifbosi. Arifmetik amal belgilari. Munosabat belgilari. Mantiqiy amallar. Maxsus belgilar. Boshqaruv belgilari. O`zgarmas va o`zgaruvchilar. Funksiya va protseduralar haqida bilimga ega bo`ladilar.
|
Kelgusi rejalar (tahlil, o'zgarishlar)
|
O'qituvchi o'z faoliyatining tahlili asosida yoki hamkasblarining dars tahlili asosida keyingi darslariga o'zgartirishlar kiritadi va rejalashtiradi
|
Darsning borishi va vaqt taqsimoti
Savol va topshiriqlar
1. Turbo Paskalning ishga tushiruvchi fayl qaysi katalogda joylashgan ?
2.Dasturlashning integrallashgan muhiti nima?
3.Turbo Paskal integrallashgan muhitida dastur matni muharririni oching.
4.NONAME.PAS nimani bildiradi? Qaysi dasturda shu nomga o'xshash пот taklif etiladi?
5.Turbo Paskal ishchi maydonidagi dasturni ishga tushirish uchun qaysi klavishalar bosiladi?
|
Yangi mavzu bayoni - 1- dars. Mavzu: Masalalarni kompyuterda yechish bosqichlari Darsning texnologik xaritasi

Yangi mavzu bayoni:
Paskal dasturlash tilining keng tarqalishi va qo'llanilishiga asosiy sabab — dasturning soddaligi va undan foydalanishning qulayligidir. Dastavval Paskal tili universitetlarda qo'Uanilgan bo'lib, keyinchalik turli rusumli kompyuterlar uchun naqllari ishlab chiqildi.
1981- yilda Paskal tilining xalqaro standarti taklif etildi. Paskal tilining Borland firmasi tomonidan ishlab chiqilgan Turbo Pascal 7.0naqlidan hozirgi davrda keng foydalaniladi. U foydalanuvchilar uchun juda qulay tizim — dasturlashning integrallashgan muhitiga ega.
Integrallashgan muhit — dasturlashga yordamlashuvchi dastur bo'lib, u quyidagi asosiy vazifalarni bajarishi lozim: avalambor, u dastur matnini kiritish imkonini berishi;
vaqti-vaqti bilan kiritilayotgan dastur matnini tashqi xotirada saqlab turishi;
dasturni ishga tushirish uchun translyatorga ega bo'lishi;
sintaktik xatoliklarni aniqlash vositasiga ega bo'lishi kerak.
Turbo Paskal 7.0 integrallashgan muhiti sanab o'tilgan vazifalardantashqari yana ko'pgina vazifalarni ham amalga oshirish imkonini beradi.
«Turbo Pascal 7.0» dasturlash tizimi tashqi xotiraning, odatda,«ТР7» nomli katalogiga joylashtiriladi (umuman olganda boshqa katalogga joylashtirish ham mumkin). U yuzdan ortiq fayldan iborat bo'lib, fayllar vazifalariga qarab bir nechta kataloglarga joylashtirilgan (1-rasm). Turbo Paskal integrallashgan muhitini ishga tushiruvchi Turbo.exe fayli «BIN» katalogida joylashgan.Qolgan kataloglarda asosan yordamchi fayllar hamda Turbo Paskalning imkoniyatlarini namoyish etadi. Turbo.exe fayli ishga tushirilgach, ekranda Turbo Paskal integrallashgan muhiti interfeysi ochiladi. U menyular satri, oynalar sohasi
va ma'lumot satridan iborat
F3
|
ochish
|
Ctrl+F9
|
dasturni ishga tushirish
|
F2
|
saqlash
|
AK+F5
|
dastur natijasini ekranda ko'rish
|
Alt+F3
|
faol oynani yopish
|
AK+F9
|
dasturni kompilyatsiya qilish
|
Alt + x
|
chiqish
|
F6
|
bir oynadan ikkinchi oynaga o'tish
|
Masalan, «BGI»katalogida grafik holatda ishlash uchun zarur fayllar joylashgan.
Turbo Paskalning qolgan katalog va fayllari haqida darslikda keltirilgan qo'shimcha adabiyotlar ro'yxatidagi qo'llanmalardan yetarlicha maTumot olishingiz mumkin.
|
Darsning borishi va vaqt taqsimoti

|
Darsning borishi va vaqt taqsimoti
|
bet | 186/208 | Sana | 23.07.2021 | Hajmi | 1,92 Mb. | | #15865 |
Darsning borishi va vaqt taqsimoti
|
Dars bosqichlari
|
Vaqt
|
1
|
Tashkiliy qism
|
3 daqiqa
|
2
|
O'tilganlarni takrorlash
|
7 daqiqa
|
3
|
Yangi mavzu ustida ishlash
|
14 daqiqa
|
4
|
Yangi mavzuni mustahkamlash
|
13 daqiqa
|
5
|
Uyga vazifa
|
3 daqiqa
|
O’tilgan mavzuni takrorlash.
1.Qanday grafik formatlarni bilasiz?
2.BMP formatli rasmni JPEG va GIF formatiga PAINT dasturi
yordamida o'tkazing.
3.Web-sahifaga rasm joylashtirish qanday tashkil etiladi?
4. tegining qanday parametrlari bor?
5.Rasmni web-sahifaning chap yoki o'ng tomonida joylashtirish
qanday tashkil etiladi?
Yangi mavzu bayoni.
MS Word matn protsessori yordamida tayyorlangan hujjatda ro'y- xat hosil qilishning 2 xil usuli bo'lib, biri markerli (;Etugmasi yordamida) ikkinchisi tartiblangan ( := tugmasi yordamida) ro'yxatdir, masalan:
Markerli ro'yxat
|
Markerli
ro'yxat
|
Markerli
ro'yxat
|
Tartiblanagan
ro'yxat
|
Tartiblanagan
ro'yxat
|
•Informatika •Matematika •Tarix
|
o Informatika
o Matematika
o Tarix
|
♦ Informatika
♦ Matematika ♦Tarix
|
1. Informatika
2. Matematika
3. Tarix
|
A. informatika
B. Matematika
C. Tarix
|
Web-sahifaga ro'yxat kiritish uchun (unordered list - tartiblanmagan, ya'ni markerli ro'yxat) yoki (ordered list - tartiblangan ro'yxat) juft teglaridan foydalaniladi. Ko'rish mumkinki, HTML-hujjatda va |
| |
Boshlang’ich matn muallifi haqidagi xabar

Boshlang’ich matn muallifi haqidagi xabar
Manba matnining muallifi tomonidan ko‘rib chiqilgan mavzu bo‘yicha lirik
mulohazalar. Durdona asarlar nafaqat san’atda, balki tabiatda ham bo‘lishi
mumkin. Ehtimol, har birimiz kechqurun daryo bo‘ylab qayiqda suzganmiz. Suv
yuzasida aks ettirilgan ajoyib tabiat. Kechki quyosh botishi daraxtlar ortida kirib
ketadi, qushlar jim bo‘lib, gullar uxlab qolgandek. Yozuvchilar quyosh botishini
shunday ta’riflaydi.
Esse muammosini hal qilishda, yaratilgan matnning muallifiga qanday ta’sir
qilishini va umuman jamiyat uchun qanday ahamiyatga ega ekanligini ko‘rib
chiqish kerak. Shuning uchun, uning ifodalanishi xususiy holatlarga emas, balki
shunga o‘xshash vaziyatlarga ishora qilishi kerak. Masalan, agar manba matnining
muallifi bir kishining rahm-shafqati haqida gapirsa, esse muammosi barcha
odamlar uchun rahm-shafqat va uni tarbiyalash usullari bo‘lishi mumkin.
Yuqorida ta’kidlab o‘tilganidek, yaratilgan matnning barcha qismlari
mantiqiy ravishda bir-biriga bog’langan bo‘lishi kerak, shuning uchun kirish
qismidan so‘ng asosiy qismga mantiqiy-uslubiy "ko‘priklar" (ibora-o‘tish yoki
124
iboralar-o‘tishlar) kerak.
Masalan, matnning kirish qismi "Sivilizatsiya darajasi va ayolning hayoti"
quyidagi iboralar bilan yakunlanishi mumkin: "Davlatning rivojlanish darajasi,
uning madaniyatliligi bu davlatning ayollari yashaydigan sharoitlar bilan
belgilanadi. Yevropa, Osiyo, Shimoliy va Janubiy Amerikaning turli
mamlakatlariga nisbatan bunday shartlarni ko‘rib chiqamiz.
Asosiy qismda
manba matnining muallifi gapiradigan muammo sharhlanadi;
ayni paytda uning nuqtai nazarini shakllantirish emas, balki muallifning fikrini
iloji boricha to‘liq ifodalash kerak.
Boshlang’ich matnga asoslanib, savollarga javob berish kerak: nima uchun
bunday muammo yuzaga kelishi mumkin va uning paydo bo‘lishining obektiv va
subektiv sabablari nimada? Bundan tashqari, uning dalillari to‘plamini taqdim
etish kerak (faktlar ham umume’tirof etilgan, ham alohida tanlangan bo‘lishi
mumkin), bu muammoga o‘z qarashlarini bayon qilish va uni hal qilish yo‘llarini
taklif qiling.
Asosiy qism odatda manba matnida muhokama qilingan muammoning uchta
yoki to‘rtta eng muhim qoidalarini o‘z ichiga oladi. Ular mikromatnlar shaklida
taqdim etilgan mikromavzular deb ataladi. Har bir mikromatnda maxsus
mikroxulosalar mavjud, undan keyin ibora -o‘tishlar kuzatiladi.
Ushbu iboralarda ko‘rib chiqilgan mikrotema eslatib o‘tiladi va keyingisiga
o‘tiladiladi. Misol uchun, "Madaniyat darajasi va ayolning hayoti" matnida
mikrotemalar orasidagi o‘tish shunday bo‘lishi mumkin:
"Biz allaqachon bilamizki, bugungi kunda turli mamlakatlar aholisining
qariyb qirq foizi elektr jihozlaridan foydalanadilar, bu esa asosan ayollar
shug’ullanadigan uy ishlarini osonlashtiradi. Biroq, uy sharoitida mehnat hali-
hanuzgacha qo‘lda bajarilishi saqlanib qolgan davlatlarda ayollar qanday ijtimoiy
jihatdan himoyalangan? Keling, raqamlar va dalillarga murojaat qilaylik.
|
Zaxiralash turlari - Vazirligi muhammad al-xorazmiy nomidagi toshkent

Yakshanba Dushanba Seshanba Chorshanba Yakshanba Dushanba Seshanba Chorshanba
a) O‘sib boruvchi zaxiralash b)
Differensial zaxiralash
6.1-rasm. Zaxiralash turlari
Differensial zaxiralash: ushbu zaxiralash usuli to‘liq va o‘sib boruvchi usullarning mujassamlashgan ko‘rinishi bo‘lib, oxirgi zaxiralangan nusxadan boshlab bo‘lgan o‘zgarishlarni zaxira nusxalash amalga oshiriladi.
Masalan, yuqoridagi misolni qaraylik. To‘liq zaxiralash yakshanba kuni, differensial nusxalash esa shanbagacha amalga oshirilishi jadvalda keltirilgan bo‘lsin. Yakshanba kuni to‘liq zaxira nusxalash amalga oshirilganidan so‘ng, dushanba kuni differensial zaxiralash kun o‘tishi bilan amalga oshiriladi. Bu holat o‘sib boruvchi zaxiralashga o‘xshab ketadi. Biroq, seshanbada, zaxira nusxalash yakshanba va dushanbadagi o‘zgarishlar uchun amalga oshiriladi. Shundan so‘ng, chorshanbada
zaxiralash yakshanba, dushanba va seshanba kunlari uchun amalga oshiriladi (6.1 – rasm “b”).
Well, I have thought about it and where I work there are no safe places to leave

TEST
Timetable for Isle of Man holiday
OK, so what does the holiday consist of? Well, on day one you’ll arrive in time for a short introduction by
your tour manager, followed by dinner in the hotel. The dining room looks out at the
river
Q15
, close to
where it flows into the harbour, and there’s usually plenty of activity going on.
On day two you’ll take the coach to the small town of Peel, on the way calling in at the Tynwald Exhibition.
The Isle of Man isn’t part of the United Kingdom, and it has its own parliament, called Tynwald. It’s claimed
that this is the world’s oldest parliament that’s still functioning, and that it dates back to 979. However, the
earliest surviving reference to it is from
1422
Q16
, so perhaps it isn’t quite as old as it claims!
Day three we have a trip to the mountain Snaefell. This begins with a leisurely ride along the promenade
in Douglas in a horse-drawn tram. Then you board an electric train which takes you to the fishing village
of Laxey. From there it’s an eight-kilometre ride in the Snaefell Mountain Railway to the
a locked cupboard - Customer satisfaction survey

TEST
Enquiry about joining Youth Council
CAROLINE: Good Morning. Youth Council. Caroline speaking.
ROGER:
Oh, hello, I’m interested in standing for election to the Youth Council, and I was told to give
you a call.
CAROLINE: That’s good. Could you I have your name, please?
ROGER:
Yes, it’s Roger
Brown.
Example
CAROLINE: Thank you. I’m Caroline, the Youth Council administrator. So do you know much about what
the Council does, Roger?
ROGER:
I’ve talked to Stephanie – I think she’s the chair of the Council.
CAROLINE: That’s right.
ROGER:
And she told me a lot about it. How it’s a way for young people to discuss local issues, for
example, and make suggestions to the town council. That’s what made me interested.
CAROLINE: Fine. Well let me take down some of your details. First of all, how old are you? You know
the Council is for young people aged from 13 to 18?
ROGER:
I’ve just turned 18.
CAROLINE: And where do you live, Roger?
ROGER:
Well, that’s a bit complicated. At the moment I’m looking for a flat to rent here, so
Ma’lumotlarni qayta tiklash va hodisalarni qaydlash

|
Ma’lumotlarni qayta tiklash va hodisalarni qaydlash
|
bet | 82/111 | Sana | 20.05.2024 | Hajmi | 2,03 Mb. | | #246571 |
Ma’lumotlarni qayta tiklash. Ma’lumotlarning yo‘qolishi har qanday tashkilot uchun jiddiy muammo hisoblanadi. Shu sababli, ma’lumotlarni qayta tiklash usullaridan foydalanish talab etiladi. Ushbu jarayon ma’lumotlarning qanday yo‘qolganiga, ma’lumotlarni qayta tiklash dasturiy vositasiga va ma’lumotlarni tiklash manziliga bog‘liq.
Ma’lumotlarni eltish vositalarida, USB xotirada, qattiq diskda, DVD va boshqa saqlagichlarda ma’lumotlarni qayta tiklash mumkin. Qayta tiklash jarayonining muvaffaqqiyatli amalga oshirilishi foydalanuvchining malakasiga bog‘liq. Ma’lumotlarni qayta tiklash jarayonida bilim va to‘g‘ri tanlangan vosita muhim hisoblanadi.
Ma’lumotlarni qayta tiklash har doim ham muvaffaqiyatli bo‘lmasligi mumkin. Agar saqlagichda xatolik mavjud bo‘lsa yoki unga ko‘p zarar yetgan bo‘lsa, ma’lumotlarni tiklashning imkoni bo‘lmasligi mumkin. Ma’lumotlarning qayta tiklanishi ehtimoli ularning yo‘qolishi sababiga bog‘liq. Ma’lumotlarni yo‘qolishiga sabab bo‘luvchi hollar quyidagilar:
Faylni o‘chirish: agar fayl o‘chirilsa, ushbu soha qaytadan yozilgunga qadar saqlagichda mavjud bo‘ladi. Ma’lumotlar saqlangan sohadagi kichik xotiraga ma’lumotlar yozilishi butun ma’lumotlarni tiklanmasligiga sababchi bo‘lishi mumkin. Windows OTda NTFS fayl tizimida ma’lumotlarni o‘chirish algoritmi mavjud va ma’lumotlarni tiklash ham ushbu algoritm asosida amalga oshiriladi.
Faylning zararlanishi: agar OT zararlansa, ma’lumotlarni diskning qismlar jadvali yordamida tiklash mumkin. Agar diskning qismlar jadvali ham zararlangan bo‘lsa, qayta tiklashning maxsus vositalaridan foydalanishga to‘g‘ri keladi.
Qattiq diskning fizik zararlanishi: qattiq diskka fizik ta’sir bo‘lishi, faylni zararlanishiga qaraganda, katta yo‘qotishlarga sabab bo‘lishi mumkin. Bu esa ma’lumotlarni qayta tiklashning maxsus sathidan foydalanishni talab etadi. Zararlangan fizik diskdan ma’lumotlarni tiklash vaqtida, tiklash jarayonining muhiti turli ifloslanishlardan holi bo‘lishi zarur. Ya’ni, bu jarayon toza xonada amalga oshirilishi shart. Chang bo‘lgan sohalarda ma’lumotlarning qayta tiklanishi qiyin bo‘ladi.
Ma’lumotlarni qayta tiklashda quyidagilarni esda saqlash zarur:
ma’lumotlar yo‘qolgan qattiq diskga qayta tiklangan ma’lumotlarni yozmaslik;
turli zaxira nusxalarni amalga oshirish va ularni turli manzillarda saqlash;
ma’lumotlarni qayta tiklash har doim ham 100% samara bermasligi.
Amalda saqlagichlardagi yo‘qolgan ma’lumotlarni tiklashda maxsus dasturiy vositalardan foydalaniladi. Ularga Recovery My Files, EASEUS Data Recovery Wizard, Advanced Disk Recovery, Handy Recovery, R-Studio, Data Recovery Pro, Recuva, Total Recall, Pandora Recovery kabilarni misol sifatida keltirish mumkin.
|
| |
Gayubova komila anvarovna yulanova nargiza davlatovna akademik yozuv - bet 67

126
b) agar matn muallifining ixtiyorida mavjud bo‘lgan
dalillar unga juda
ishonarli tuyulmasa, ularni bir vaqtning o‘zida ko‘rib chiqish mumkin. Biroq
oxirgi dalil oldingi ma’lumotlarga qaraganda yaxshiroq qabul qiluvchining
xotirasida saqlanishini
yodda tutish kerak, shuning uchun oxirgi dalil eng kuchli
bo‘lishi kerak.
Tezisni isbotlash uchun siz kamida uchta dalilni tanlashingiz kerak, chunki
"bir dalil shunchaki haqiqatdir, ikkita dalilga e’tiroz
bildirish mumkin, uchta
dalilda bu yanada qiyinlashadi va to‘rtta dalil qabul qiluvchi tomonidan unga
bosim o‘tkazish usuli sifatida ko‘riladi".
~
mantiqiy xulosa
— so‘z inson tomonidan muayyan hurmat talab qiladi.
Mikroxulosalardan keyin asosiy qismning oxirida o‘tish iborasi ishlatilishi
kerak. "Inson nomi — uning taqdiri" matnida bu ibora shunday bo‘lishi mumkin:
"
So‘z odamlar ustidan buyuk kuchga ega va biz bu ism ham so‘z ekanini
unutmasligimiz kerak
". Shundan so‘ng essening oxirgi qismi- xulosa qismi keladi.
Xulosa qism muallifning matnda yozgan eng muhim narsani qisqacha
takrorlashini va umumiy xulosa chiqarishini ko‘rsatadi. Hech qanday qo‘shimcha
ma’lumot va yangi fikrlar mavjud bo‘lmasligi kerak.
Essening oxirgi qismi, hatto esse eng yoqimli bo‘lmagan savollarni ko‘rib
chiqishga bag’ishlangan bo‘lsa ham, hayotni tasdiqlovchi hamda o‘quvchi uchun
umid va hayotga ishonchni ilhomlantirishi kerak. "Inson nomi — uning taqdiri"
matnida yakuniy qism quyidagicha ifodalanishi mumkin: "Shunday qilib, biz
ko‘rib chiqqan nomning insonning taqdiriga ta’siri haqidagi misollar,
uning
taqdiri inson nomi bilan bog’liq degan fikrni tasdiqlaydi".
Esse publitsistik janrlarga kiradi va uni yozganda publitsistik nutq uslubi
qo‘llaniladi. Bundan tashqari, esseda boshqa uslublarning elementlari (masalan,
ilmiy, rasmiy-idoraviy, og’zaki) uchrashi mumkin. Ishlatilgan so‘z
birikmalari
ko‘tarilgan savollarning tabiatiga bog’liq, ammo essening matnlarida so‘zlashuv
va jargon so‘zlar ishlatilmaydi.
- DARS. BIR NECHA INDEKSLI MASSIVLAR

|
- DARS. BIR NECHA INDEKSLI MASSIVLAR
|
bet | 45/89 | Sana | 16.11.2023 | Hajmi | 313,45 Kb. | | #100010 |
Bog'liq @AKT Official C haqida o\'zbekcha darslar majmui44 - DARS. BIR NECHA INDEKSLI MASSIVLAR.
Massivlar bir necha indeksga ega bo'lishlari mumkin. C++ kompilyatorlari eng kamida 12 ta indeks bilan ishlashlari mumkin. Masalan, matematikadagi m x n kattalikdagi matritsani ikkita indeksli massiv yordamida berisak bo'ladi.
int matritsa [4][10];
Yuqorida to'rt satrlik, 10 ustunlik matritsani e'lon qildik. Bir indeksli massivlar kabi ko'p indeksli massivlarni initsalizatsiya ro'yhati bilan birga e'lon qilish mumkin. Masalan:
char c[3][4] = {
{ 2, 3,9, 5}, // birinchi satr qiymatlari
{-10, 77,5, 1}, // ikkinchi " "
{ 90,233,3,-3} // uchinchi " "
};
int m[2][2] = {56,77,8,-3}; // oldin birinchi satrga qiymatlar beriladi,
// keyin esa ikkinchi satrga
double d[4][3][6] = {2.55, -46,0988}; // birinchi satrning dastlabki ikkita
// elementi qiymat oladi,
// massivning qolgan elementlari esa
// nolga tenglashtiriladi
Massivning har bir indeksi alohida [] qavslar ichiga olinishi kerak. Yuqoridagi c[][] massivining ikkinchi satr, birinchi ustunidagi elementi qiymatini birga oshirish uchun
++c[1][0]; // yoki c[1][0]++;
// c[1][0] += 1;
// c[1][0] = c[1][0] + 1;
deb yozishimiz mumkin. Massiv indekslari 0 dan boshlanishini unutmaslik zarur. Agar
++c[1,0];
deb yozganimizda hato bo'lar edi. C++ bu yozuvni
++c[0];
deb tushunar edi, chunki kompilyator vergul bilan ajratilgan ro'yhatning eng ohirgi elementini qabul qilardi. Hullas, C++ dagi ko'p indeksli massivlar dasturchiga behisob imkoniyatlar beradi. Undan tashqari, ular hotirada statik joylashganligi uchun ularning ishlash tezligi kattadir. C++ dagi ko'p indeksli massivlar hotirada ketma-ket joylashgandir. Shu sababli agar massiv funksiyaga kirish parametri sifatida berilsa, faqat birinchi indeks tushurilib qoldiriladi, qolgan indekslar esa yozilishi shartdir. Aks taqdirda funksiya massiv kattaligini to'g'ri keltirib chiqarolmaydi. Massiv parametrli bir funksiya e'lonini beraylik.
//Ko'p indeksli massivlar
# include
int indeks = 3;
int intArray[indeks][4] = {}; // hamma elementlar 0 ga tenglashtirildi
void printArray(int mass[][4], int idx){ // funksiya e'loni
for (int i = 0; i < idx; i++) { // massivning birinchi indeksini
// o'zgartirsa bo'ladi
for (int k = 0; k < 4; k++){ // massivning ikkinchi indeksi o'zgarmaydi
cout << mass[i][k];
}
cout << endl;
}
return;
}
...
int main()
{
...
printArray(intArray); // funksiya chaqirig'i
...
return (0);
}
Massivning indekslarini funksiyaga bildirish yana muammoligicha qoladi. Albatta, birinchi indeksdan tashqari qolgan boshqa indekslar kattaligini funksiya ichida berish ma'noga egadir. Lekin birinchi indeks kattaligini tashqaridan, qo'shimcha parametr sifatida bersak, funksiyamiz chiroyliroq chiqadi, turli kattalikdagi massivlarni o'lish imkoniga ega bo'ladi.
|
| |
Mavzu yuzasidan mashq va topshiriqlar

128
Mustaqillik davri o‘tmish tarixiga yaqindan haqiqat ko‘zgusida boqishni
taqozo etgach, bunday nuqsonlar ma’lum bo‘lib qoldi. Shu tufayli shoir ijodini
zarracha kamsitmagan holda unga tanqidiy yondashishni taqozo etadi.
30-yillar G’afur G’ulom hikoya, ocherk, felyetonlar qatori «Netay»,
«Yodgor», «Tirilgan murda» kabi qissalarini ham o‘z kitobxoniga taqdim etdi.
Ulug’ Vatan urushi yillarida shoir o‘z ijodining butun haroratini fashist
bosqinchilariga qarshi kurashayotgan xalqqa, uning muqarrar g’alabasiga
bag’ishladi. U «Sen yеtim emassan», «Oltin medal», «Kuzatish», «Vaqt»,
«Sog’inish» kabi she’rlarini ijod qildi, publitsistik ocherk va maqolalar yozib,
xalqni jang va mehnat g’alabasiga otlantirdi. So‘nggi yillarda G’afur G’ulomning
20 ga yaqin she’riy to‘plamlari chop etildi. Ayniqsa, shoirpning «Kuzatish», «Sen
yеtim emassan», «Qish», «Bizning ko‘chada ham bayram bo‘lajak», «Vaqt»,
«Onalar» singari asarlarida dunyo xalqlarini fashizm vabosidan xalos etgan
jangchilarimning mardona kurashlari tasvirlangan.
G’afur G’ulom urush yillarida yozilgan she’rlaridan jamlangan «Sharqdan
kelayotirman» to‘plami uchun 1946 yili Ittifoq Davlat mukofotiga sazovor bo‘ldi.
G’afur G’ulom o‘z davrida «Hurmat belgisi» (1944), uch marta «Mehnat Qizil
Bayroq» ordeni (1937, 1951, 1961), Lenin ordeni (1949), medallar va faxriy
yorliqlar bilan taqdirlangan. U O‘zbekiston Fanlar akademiyasining a’zosi (1943)
edi. 60 yillik yubileyi munosabati bilan unga O‘zbekiston xalq shoiri faxriy unvoni
berildi. Shoirning ko‘pgina asarlari qardosh xalqlar, Osiyo va Yevropa tillariga
tarjima qilingan.
Matn yuzasidan savol va topshiriqlar.
1. Matnni o‘qib gapirib bering.
2. Notanish so‘zlar lug’atini tuzing.
3. Matn yuzasidan esse yozing.
-topshiriq - Gayubova komila anvarovna yulanova nargiza davlatovna akademik yozuv

138
14-mavzu.
Referat. Referat turlari
Nazariy ma’lumot.
Referat.
Biror ilmiy, metodik, pedagogik mavzudagi
asarning qisqacha
mazmuni haqidagi bayon (yozma ma’ruza) referat hisoblanadi. Referat muallifning
o‘z asari haqida bo‘lsa avtoreferat deyiladi. Avtoreferatda asarning qisqacha
mazmuni, yangiliklari, metodik usullari, ilmiy qurilishi, foydalanilgan adabiyotlari
ustida fikr yuritiladi. Amalda ilmiy va obzor referatlari ko‘proq uchraydi. Ilmiy
referatlarga fanda, metodikaga, tarbiyaga va texnikaga
oid ishlarning qayerda
amaliyotda sinab ko‘rilganligi haqida ham xabar beriladi.
Referatlar quyidagi mezonlar bo‘yicha ajratiladi:
bayon qilish mazmuniga ko‘ra - reproduktiv va produktiv;
birinchisi, o‘z
navbatida, referat -rezyume va referat-konspektga;
ikkinchisi-doklad, sharhlarga
bo‘linadi;
manbani tahlil qilish bo‘yicha -
qismli, monografik, aspektli, birlashtirilgan;
yo‘nalishiga ko‘ra – maqsadli va umumiy;
bayonning to‘liqligini hisobga olganda – indikativ va
axborot beruvchi;
tayyorlash usuliga ko‘ra - ijodiy, xizmat, nazorat, o‘quv.
Matn, maqolaga yozilgan referatning tuzilishi va tarkibiy qismlari.
Matn, maqolaga yozilgan referatning tuzilishi va tarkibiy qismlari quyidagilardan
iborat:
- DARS. C++ DA SINFLAR - 1 – dars. C++ Dasturlash tilining kelib chiqishi xaqida ma’lumot

|
1 – dars. C++ Dasturlash tilining kelib chiqishi xaqida ma’lumot
|
bet | 67/89 | Sana | 16.11.2023 | Hajmi | 313,45 Kb. | | #100010 |
Bog'liq @AKT Official C haqida o\'zbekcha darslar majmui67 - DARS. C++ DA SINFLAR.
SINF-STRUKTURA TUSHUNCHASI KENGAYTMASI SIFATIDA.
Sinflarni eng soda holda qo’yidagicha tasvirlash mumkin:
Sinf-kaliti Sinf-soni {komponentalar ruyhati}
Sinf komponentalari sodda holda tiplangan ma'lumotlar va funktsiyalardan iborat bo’ladi. Figurali qavslarga olingan komponentalar ro’yhati sinf tanasi deb ataladi. Sinfga tegishli funktsiyalar komponenta-funktsiyalar yoki sinf funktsiyalari deb ataladi. Sinf kaliti sifatida Struct hizmatchi so’zi ishlatilishi mumkin. Masalan qo’yidagi konstruktsiya kompleks son sinfini kiritadi.
Struct complex 1
{ double real;
double imag;
void define (double re=0.0, double im=0.0)
{ real=re; imag=im;}
void display (void)
{cout<=”real=”<cout<=”imag=”<}
};
Strukturadan bu sinfning farqi shuki komponenta ma'lumotlardan (real, imag) tashqari ikkita komponenta funktsiya (define() va display ()) kiritilgan. Bu kiritilgan sinf o’zgaruvchilar tipi deb qaralishi mumkin. Bu tiplar yordamida konkret ob'ektlarni qo’yidagicha tasvirlash mumkin:
Misol uchun:
Complex x,y;
Complex dim[8];
Complex *p=1x;
Sinfga tegishli ob'ektlar qo’yidagicha tasvirlanadi;
Sinf-nomi . ob'ekt-nomi
Dasturda ob'ekt komponentasiga quyidagicha murojaat qilish mumkin:
Sinf-nomi.ob'ekt-nomi :: komponenta-nomi yoki soddaroq holda ob'ekt-nomi. Element-nomi
Misol uchun:
x!=real=1.24;
x!=imag=0.0;
dim[3]. Real=0.25;
dim[3]. Imag=0.0;
Sinfga tegishli funktsiyalarga qo’yidagicha murojaat qilinadi:
funktsiya-nomi.ob'ekt-nomi;
Misol uchun:
X. define.(Bu holda real=0.9 va imag=0.0)
X. define.(Bu holda kompleks son 4.3+i*20.0)
Display funktsiyasi ekranda kompleks son qiymatlarini tasvirlaydi. Sinfga tegishli ob'ektga ko’rsatkich orqali komponentalarga quyidagicha murojat qilinadi:
Ob'ektga-ko’rsatkich>element-nomi
Yuqorida ko’rsatilgan P ko’rsatkich orqali H ob'ekt elementlariga qo’yidagicha qiymat berish mumkin:
P>real=2.3
P>imag=6.1
Huddi shu shaklda sinfga tegishli funktsiyalarga murojat qilinadi:
P>display;
P>define(2.3, 5.4);
|
| |
Struktura haqidagi ma'lumotni kiriting

|
Struktura haqidagi ma'lumotni kiriting
|
bet | 66/89 | Sana | 16.11.2023 | Hajmi | 313,45 Kb. | | #100010 |
Bog'liq @AKT Official C haqida o\'zbekcha darslar majmuiStruktura haqidagi ma'lumotni kiriting:
Sign=sigma
Weight=16
Sign=omega
Weight=44
Sign=alfa
Weight=0
Ruyhatni chiqarish
Sign=sigma weight=16
Sign=omega weight=44
Dasturda ma'lumotlarni kiritish tsikl orqali bajariladi. Tsikl tugatilishi sharti navbatdagi strukturaning int weight elementiga kiritilgan nol qiymatdir.
Strukturalar ro’yhati dinamik tashkil etiladi. Beg va end ko’rsatkichlar nol qiymati orqali initsializatsiya qilingan. Dasturda (struct cell*) tip o’zgartirishidan foydalanilgan chunki malloc funktsiyasi har doim void tipidagi ko’rsatkich qaytaradi.
66 - DARS. RUYHATLAR BILAN ISHLASHDA REKURSIYADAN FOYDALANISH.
Ruyhatning har bir buginida ma'lumot va keyingi element adresi joylashgan.Agar bu ko’rsatkich nol qiymatga ega bo’lsa ro’yhat ohirigacha o’qib bo’lingan. Ruyhatni kurib chiqishni boshlash uchun birinchi elementining adresini bilish etarlidir. Ruyhatni yaratish rekursiv funktsiyasi va ruyhatning elementlarini ekranga chiqarish rekursiv funktsiyasini kurib chiqamiz. Ruyhatni rekursiv tuldirish funktsiyasi quyidagi prototipga ega:
Struct cell* input(void);
Bu funktsiya klaviatura orqali kiritilgan ma'lumotlar bilan to’ldirilgan ro’yhatga ko’rsatkich qaytaradi. Funktsiyaga har gal murojaat qilinganda yangi ruyhat yaratiladi. Agar ruyhatning navbatdagi strukturasining weight o’zgaruvchisiga nol qiymat berilsa funktsiya o’z ishini to’htatadi. Aks holda klaviatura orqali tuldirilgan struktura ruyhatga ulanadi va uning struct cell*pc elementining qiymati funktsiya tanasidan rekursiv chaqirilgan input() funktsiyasi qaytargan qiymatga teng bo’ladi.
Funktsiya tanasi:
Struct cell
{
char sign[10];
int weight;
struct cell*pc;
};
#include
#include
struct cell * input(void)
{
struct cell*p;
p=(struct cell*) malloc(sizeof(struct sell));
printf(“sign=”);
scanf(“%s”,&p->weight);
if (p->weight==0)
{
free(p);
return NULL;
}
p->pc=input();
return p;
/* */
void output(struct cell * p)
{
if (p==NULL)
{
printf(“\nRuyhat tugadi”);
return;
}
printf(“\nsign=%s\tweight=%d”,p->sign,p->weight);
output(p->pc);
}
void main()
{
struct cell * beg=NULL;
printf(“\Ruyhat elementlarini kiriting:\n”);
beg=input();
printf(“\n Ruyhatni chikarish:”);
output(beg);
}
Dastur bajarilishiga misol:
Ruyhat elementlarini kiriting:
Sign=Zoro
Weight=1938
Sign=Zodiac
Weight=1812
Sign=0
Weight=0
Ro’yhatni chiqarish:
Sign=Zoro weight=1938
Sign=Zodiac weight=1812
Ruyhat tugadi
|
| |
Soliq to‘lovlaridan ozod qilish

377
yaroqsiz bo‘lgan yoki demontaj qilingan bo‘lsa, soliq imtiyozi
butun soliq davri uchun soliqni to‘lash bo‘yicha majburiyat-
larning tiklanishi bilan bekor qilinadi;
(O‘zbekiston Respublikasining Soliq kodeksi, XVI bo‘lim. Yer
solig‘i, 428-modda. Soliq imtiyozlari)
15.1.2. Suv tejovchi sug‘orish texnologiyalarni joriy qilish
uchun kreditlar ajratish
O‘zbekiston Respublikasi Prezidentining 2020 yil 11 dekabr-
dagi PQ-4919-son “Qishloq xo‘jaligida suvni tejaydigan
texnologiyalarni joriy etishni yanada jadal tashkil etish chora-
tadbirlari to‘g‘risida” gi qaroriga asosan suv tejovchi sug‘orish
tizimlarini joriy qilayotgan qishloq xo‘jaligi tovar ishlab
chiqaruvchilariga (yuridik shaxslarga) suv tejovchi sug‘orish
tizimlarini joriy qilish uchun tijorat banklari tomonidan talabga
ko‘ra kreditlar ajratilishi belgilab qo‘yilgan.
15-BOB. SUV TEJOVCHI SUG‘ORISH

376
–
soliq to‘lovlaridan ozod qilish;
–
suv tejovchi texnologiyalarni joriy qilish uchun kreditlar
ajratish;
–
suv tejovchi texnologiyalarni joriy qilish xarajatlarini
qoplash
uchun
davlat
budjetidan
va
maxsus
jamg‘armalardan subsidiyalar ajratish;
–
suvni tejaydigan texnologiyalarni xarid qilish va qurishga
ajratiladigan bank kreditlari bo‘yicha foiz xarajatlarining
bir qismini qoplash uchun subsidiyalar ajratish;
–
suv tejovchi texnologiyalarni chetdan olib kelinayotgan
uskunalarini bojxona to‘lovlaridan ozod qilish kabi bir
qator imtiyozlar yaratilgan.
- DARS. DINAMIK INFORMATSION STRUKTURALAR

|
- DARS. DINAMIK INFORMATSION STRUKTURALAR
|
bet | 65/89 | Sana | 16.11.2023 | Hajmi | 313,45 Kb. | | #100010 |
Bog'liq @AKT Official C haqida o\'zbekcha darslar majmui66 - DARS. DINAMIK INFORMATSION STRUKTURALAR.
Ma'lumotlarni statik va dinamik tasvirlash.
Dasturlash tillarida o’zgaruvchilar tiplari va ta'rifi bu o’zgaruvchilar uchun ajratiladigan hotira turini va o’zgaruvchilar qiymatlari chegaralarini belgilaydi. Asosiy tiplar (int, double va hokazo) lar uchun bu belgilar kompilyatorga bog’likdir. Murakkab tiplar ya'ni massivlar va strukturali tiplar uchun hotiraga talab ularning ta'rifiga bog’likdir. Masalan double array[10] ta'rif hotiradan 10*sizeof bayt joy ajratilishiga olib keladi.
Struct mixture
{
int ii;
long ll;
char cc[8];
};
Bu ta'rif har bir Struct mixture tipidagi ob'ekt hotirada sizeof(int)+sizeof(long)+8*sizeof(char) bayt joy egallashini ko’rsatadi. Ob'ekt aniq hajmini qo’yidagi amal hisoblaydi:
Sizeof(struct mixture)
Bu usulda kiritilayotgan ob'ektlar faqat statik ma'lumotlarni tasvirlashga imkon beradi. Lekin ko’p misollarda tarkibi, hajmi o’zgaruvchan bo’lgan murakkab konstruktsiyalardan foydalanishga to’gri keladi. Bunday o’zgaruvchan ma'lumotlar dinamik informatsion strukturalar deb ataladi.
Bir elementli ruyhat.
Eng soda dinamik informatsion struktura elementlari qo’yidagi strukturali tip orqali ta'riflangan ob'ektlardan iborat ruyhatdir.
Struct strukturali tip nomi
{
struktura elementlari ;
Struct strukturali tip nomi*kursatkich;
};
Qo’yidagi misolni ko’rib chiqamiz, Klaviatura orqali ihtiyoriy sondagi strukturalarni bir bog’lamli ro’yhatga birlashgan holda kiritish, so’ngra ruyhat elementlarini kiritilgan tartibda ekranga chiqarish. Ruyhat bilan ishlash uchun uchta ko’rsatkichdan foydalaniladi: beg ruyhat boshiga ko’rsatkich, end ruyhat ohiriga ko’rsatkich, rex ro’yhatni boshidan qarab chiqish uchun ishlatiladigan ko’rsatkich.
Qo’yidagi dastur qo’yilgan vazifani bajaradi:
#Include
#include
struct cell {
char sign[10];
int weight;
struct cell * pc;
};
void main()
{
struct cell * rex;
struct cell * beg=NULL;
struct cell * end=NULL;
do
{
rex=(struct cell*malloc(sizeof(struct cell));
printf(“sign=”);
scanf(“%s, & rex->sign);
printf(“weight=”);
scanf(“%d”,&rex->weight);
if (rex->weight==0)
{
free(rex);
break;
}
if (beg==NULL&&end==NULL)
beg=rex;
else
end->pc=rex;
end=rex;
end->pc=NULL;
}
while(1);
printf(“\nRuyhatni chikarish:”);
rex=beg;
while(rex!=NULL);
{
printf(“\nsign=%s\tweight=%d”,rex->sign,rex->weight);
rex=rex->pc;
}
}
Dastur bajarilishiga misol:
|
| |
Sug‘orish suvlarini tuzlilik darajalari bo‘yicha turlari

134
Tuproqni elektr tokini o‘tkazishini o‘lchash orqali tuproqning
sho‘rlanganlik darajasini baholash
fermer uchun eng oson
bo‘lgan va arzon usuldir.
Tuproqning elektr o‘tkazuvchanligini o‘lchash yordamida
qisqa muddat ichida tuproq na’munalarini an’anaviy usulda tahlil
qilishdagidan ko‘ra ko‘proq ma’lumotlar olish mumkin.
Tuproqning elektr o‘tkazuvchanligi
tuproqning namlik
sig‘imiga bog‘liq tarzda o‘zgaradi. Masalan, qum tuproqlarning
elektr o‘tkazuvchanligi past, soz tuproqlarning elektr o‘tkazuv-
chanligi o‘rtacha, loyli tuproqlarniki esa yuqori darajaga ega.
Demak, tuproqning elektr o‘tkazuvchanligi
uning mexanik
tarkibi, tuzilishi va undagi namlikning miqdoriga bog‘liq.
Tuproqning elektr o‘tkazuvchanligi bir metrga desisimens
(dS/m) o‘lchov birligida o‘lchanadi. Bu o‘lchamni
osonlik bilan
miqdoriy o‘lchamlarga mg/g yoki % larga aylantirish mumkin.
Jahon miqyosida sho‘rlanishni o‘lchashning xalqaro tizimi
qabul qilingan bo‘lib, mazkur tizim 1.39-jadvalda aks ettirilgan.
Tuproqning sho‘rlanishi va
suvning tuzlilik darajasini
turlicha ko‘rinishlarda ifodalash mumkin.
Tuproq sho‘rlanishida eng ko‘p qo‘llaniladigan ko‘rsatkich
bu to‘yingan tuproq bilan suv aralashmasining elektr o‘tkazuv-
chanligidir (ECe). Elektr o‘tkazuvchanlik bir metrga desisimens
elektr o‘tkazish qobiliyati (dS/m) ko‘rinishida ifodalanadi. Bu
ko‘rsatkich asosida Bernshteyn tuproq sho‘rlanishini quyidagicha
tasniflashni taklif qilgan:
•
ECe = 0-2 – sho‘rlanmagan tuproq;
•
ECe = 2-4 – kuchsiz sho‘rlangan tuproq. Tuzlar ta’siriga
chidamsiz bo‘lgan ekinlarning hosildorligi kamayadi.
•
ECe = 4-8 – o‘rtacha sho‘rlangan tuproq. Ko‘p
ekinlar-
ning hosildorligi kamayadi.
•
ECe = 8-16 – sho‘rlangan tuproq. Tuzga chidamli bo‘lgan
ekinlargina ko‘zlangan hosilni beradi.
Tuproq sho‘rlanishini qishloq xo‘jaligi ekinlarining

138
•
tuzga o‘rtacha ta’sirchan ekinlar
– kam darajadagi tuproq
sho‘rlanganligiga chiday oladigan va 2-4 dSm/m li
sho‘rlanish sharoitida hosilini yo‘qotmaydigan o‘simliklar;
•
tuzga o‘rtacha chidamli ekinlar
– o‘rtacha yuqori
darajadagi tuproq sho‘rlanganligiga chiday oladigan va 4-8
dSm/m li sho‘rlanish sharoitida hosilini yo‘qotmaydigan
o‘simliklar;
•
tuzga chidamli ekinlar –
yuqori darajadagi sho‘rlanishga
chidaydigan va hosilini yo‘qotmaydigan o‘simliklar.
Butun dunyoda olib borilgan ko‘p yillik ilmiy tadqiqotlar
juda katta hajmdagi materiallarni umumlashtirish va qishloq
xo‘jaligi ekinlarini tuproq sho‘rlanishiga chidamlilik qobiliyati
bo‘yicha sinflashtirish imkonini berdi.
Ayrim qishloq xo‘jalik ekinlarini tuzga chidamliligi bo‘yicha
toifalanishi natijalari 1.40 -jadvalda aks ettirilgan.
Tuproq sho‘rlanishini baholash usullari
Hozirgi kunda tuproq sho‘rlanishini o‘lchash va baholash-
ning ko‘plab usullari mavjud bo‘lib, quyidagi usullar ularning
asosiylari sanaladi:
And what about parking? - Customer satisfaction survey

WOMAN:
Of course.
OFFICIAL: Now, are you having a band?
WOMAN: Yes.
OFFICIAL: Well, they’ll have a lot of equipment, so rather than using the front door they should
park
their van round the back and use the stage door there
Q7
. You can open that from
inside but don’t forget to lock it at the end.
WOMAN: OK.
OFFICIAL: And talking of bands, I’m sure I don’t need to tell you this, but you must make sure that no
one fiddles about with the black box by the fire door – that’s a system that cuts in when the
volume reaches a certain level. It’s a legal requirement.
WOMAN:
Sure. Anyway, we want people to be able to talk to one another so we don’t want anything
too loud. Oh, that reminds me, we’ll be having speeches – are there any microphones
available?
OFFICIAL: Yeah. Just let the caretaker know, he’ll get those for you. Right, now when the event is
over we do ask that the premises are left in good condition. So there’s