nyuuzyou/kompy huggingface dataset:
Lokal o’zgaruvchi - Kompyuterlashgan loyihalash tizimlari fakulteti

bloklarga integratsiyalaydi. Shunday qilib, yaratilgan funktsional blok keyinchalik
har qanday programmada ishlatilishi (foydalanishi) mumkin.
Mashina tili. Mashina tilida programmalashda programmist MK bajaradigan
hamma amallarni, qayta ishlaydigan masalalarni ikkilik kodi ko’rinishida bayon
etadi. Mashina tilining afzallik tomonlaridan biri shundaki, ya’ni bu tilda MK ning
xotirasi pr
ogrammalashtirilganda uning har bir razryadini bitli o’zgartirish mumkin.
Programma mashina tilida yozilganda programmada
ishlatiladigan buyruqlar
(komandalar, sonlar, operandlar) hammasi 8-
razryadli ikkilik “0” yoki “1”
ko’rinishida yoziladi. Programmani eng oddiy ko’rinishidagi yozilishlari 8 lik yoki
16 lik sanoq sistemasida yoziladi.
Assembler tili. Mikrokontroller asosida qandaydir qurilmani yaratishdan avval
assembler
tilida
programmalash
asosi
bilan
yaxshi
tanishish
zarur.
Mikrokontrollerlar uchun qo
’shimcha programmalar yaratishda bu usuldagi
programmalashni faqatgina o’rganib qolmasdan tuzilgan programmani qadamma-
qadam bajarilishini hamda shu paytda qurilmada nima sodir bo’layotganligini yaxshi
bilishni o’rganishi kerak.
Assembler
tilida programman
i o’rganishni, yozishni va sozlashni sodda va
tushunarli bo’lishi uchun bir qancha usullar bor: Birinchidan - protsessorda
buyruqlarni bajarish jarayonini ko’rinib turishini qo’llash.
Ikkinchidan -
programmani o’qish va tushinishni soddalashtirish uchun strukturali programmalash
usulini qo’llash.
Buyruqni bajarilishini ko’rinishini eng yaxshi yo’llaridan biri protsessorni yoki
MK ni strukturali sxemasidan foydalanish. Sxema bo’yicha har bir buyruqni
bajarilishi belgilanadi, qayd qilinadi. Natijada buyruqlarni
bajarilish jarayoni
to’g’risidagi tasavvur yaxshi ta’minlanadi.
Assembler tilida MK ni programmalashda MK bajaradigan hamma ishlari
nazorat
qilish,
boshqarish,
qayta
ishlash
programmalari
assembler
tilida
qo’llaniladigan mnemonik belgilar ko’rinishida yoziladi. Masalan: mov B;
LDA: MVI va shunga o’xshash. ASSEMBLER tilida tuziladigan programmalar
qisqaroq hajmdagi masalalarni
katta tezlikda yechish, kichikroq obektlarni,
texnologik jarayonlarni parametrlarini, ularni ishchi uzellarini
ishlashini nazorat
qilish, boshqarish uchun qo’llaniladi: Masalan: manipulyatorlarni, robotlarni,
issiqxonalarni, tibbiy uskunalarni.
Parallel` interfeys orqali raqamli va uzluksiz signallarni kiritish va

5.11 - rasm. Parallel` interfeysning ob`ekt bilan ulanish sxemasi.
Bu yerda: BS1...BS8- ob`ekt uchun boshqarish
signallari; Dr1..Dr4- raqamli
datchiklar signallari; Da1..Da4-analog datchiklar signallari; U0,U1-analog
komutatorni boshqarish signallari; AK-
analog
komutator; ARO’- analog-raqamli
ơzgartirgich; Us- ARO’ning analog signal kirishi; P- ARO’ning ơzgartirish
jarayonini boshlashi
uchun boshqarish signali; KP-
ơzgartirish tugaganligini
kơrsauvchi signal; D0D7- analog datchik signalining raqamli ekvivalenti
chiqishlari.
Parallel` interfeysning A kanali
− boshqarish signallarini uzatish uchun, B
kanali
− uzluksiz signallarni raqamli ekvivalentini qabul qilish uchun, C kanalining
4 ta razryadi raqamli datchiklar signallarini qabul qilish uchun, qolgan 4 ta razryadi
AK va AR
O’ ni boshqarish uchun mơljallangan.
Ketma-ket interfeys orqali boshqarish ob`ekti bilan
bog’lanish.
Mikroprosesssorli boshqarish sistemasining ob`ekt bilan ketma-ket interfeys
orqali
bog’lanish sxemasi 5.12-rasmda keltirilgan
Mikroprotsessorli boshqarish sistemasidan parallel`
kodda qabul qilingan
boshqarish signallarini interfeys uzatgichi ketma-ket kodga aylantiradi va RG1 ga
uzatadi. RG1 da boshqarish kodi parallel` kodga aylantiriladi va kommutatsiya
sxemasining kirishlariga uzatiladi. Uzatish jarayonining tugaganligini
kơrsatuvchi
“T” signali kommutatsiya sxemasi kirishidagi boshqarish signallarini ơz chiqishlari
orqali boshqarish ob`ektiga uzatadi. Ob`ekt xolatini
nazorat qiliuvchi raqamli
Д0
Д7
КP
PI
А
С
В
Д0
.
.
Д7
А0
А1
RD
WR
R
CS
МSh
АSh dan
BSh
0
.
3
U0
U1
АК
Us
P
ARO’
BS1
BS8
Dr1
Dr4
D
а4
D
а1
К580ВВ55
datchiklar signallari RG2 ga parellel` kodda qabul qilinadi va ketmama-ket kodga
aylantirilib, interfeysga
sơngra yana parallel` kodga aylantirilib mikroprotsessorga
uzatiladi.
5.12 - rasm. Ketma-
ket interfeys yordamida ob`ekt bilan bog’lanish
sxemasi.
Bu yerda: B1...B8- ob`ekt uchun boshqarish signallari; Dr1..Dr8- raqamli
datchiklar signallari; RG1 va RG2 surish registrlari; K-kommutasiya sxemasi.
Nazorat savollari
1. Displey va klaviatura mikroprotsessor
tizimida nimaga xizmat
qiladi?
2. Yetti segmentli indikatorning ishlash prinsipini tushuntiring.
3. Yetti segmentli indikatorning parllel interfeysga ulanish sxemasini
tushuntiring.
4. Klaviaturani sistemaning ma`lumotlar shinasi bilan ulanish
sxemasini tushuntiring.
5. Maxsus klaviaturaning parallel interfeysga ulanish sxemasini
tushuntiring.
К155ИР13
ККI
Д0
.
Д7
А1
RD
WR
R
CS
МSh
АSh dan
BSh
К580ВВ51
т
УБ
Ч
ККБ
К
ТК
ХТ
Б
.
RG
1
Д0
.
.
Д7
U1
U2
DI
Q
0
1
.
.
7
К
B1
B2
B8
RG
2
Д0
.
.
Д7
U1
U2
DI
Q
0
1
.
.
7
Dp1
Dp2
.
Dp8
К155ИР13
Datchiklardan
EXISTS operatoridan foydalanish

68
Operator ANY ostkiso„rov chiqargan
xamma qiymatlarni oladi,
(bu misol uchun – Buyurtmachilar jadvalidagi xamma City qiymatlari), i
va rost deb baxolaydi agar ularning ixtiyoriysi (ANY) tashqi so„rov
satridagi shaxar qiymatiga tengbo„lsa. ANY operatori o„rniga IN yoki
EXISTS
ishlatish mumkin, lekin ANY “= “ operatordan boshqa
relyasionn operatorlarni ishlatishi mumkin. Misol: Xamma sotuvchilarni
alfavit bo„yicha kelgan buyurtmachilari bilan birga topish.
-MODUL. SINFDAN TASHQARI O‘QISH MЕTODIKASI

281
Maktab o‘quvchini o‘qish malakasi bilan qurollantirish bilan bir qatorda
kitobni mustaqil o‘qiy
oladigan, uni tushunadigan, ma'lum bir mavzuga oid
kitoblarni
tanlay oladigan, gazeta va jurnallarni ham mustaqil o‘qiydigan faol
kitobxonni tarbiyalaydi. Shu jihatdan sinfdan tashqari o‘qish (STO‘) tarbiyaning
asosiy quroli sifatida xizmat qiladi, ko‘p narsani bilishga havasni orttiradi.
STO‘ning maqsadi o‘qish malakalarini takomillashtirish, kitob tanlay
oladigan, muntazam kitob o‘qiydigan, o‘qilgan kitobni to‘g’ri baholay oladigan
ongli kitobxonni tarbiyalashdir.
Maktablarda 1959 yildan boshlab maxsus STO‘ darslari tashkil etilgan.
STO‘ darslari 1—2sinfda haftada 1 marta, 3—4sinfda 2 haftada 1
marta
o‘tkaziladi. Savod o‘rgatish jarayonida esa haftadagi oxirgi alifbe darsining
17—20 daqiqasi ajratiladi.
Sinfdan tashqari o‘qish o‘quv dasturi bilan chambarchas bog’liq bo‘lib,
unda ko‘zda tutilgan maqsad va vazifalarni amalga oshirishda yaqindan yordam
beradi. Buning uchun o‘quvchilarda kitobxonlik madaniyatini tarbiyalash, ularni
oddiy kitobxondan ijodkor kitobxon darajasiga ko‘tarish talab etiladi.
o‘quvchilarda kitobga havas uyg’otishda har bir bolaga yakka tartibda
yondashish, Shaxsiy qiziqishlarini hisobga olish zaair.
Bolalarda kitob ustida
ishlash
malakasini
shakllantif
ish
ularda
kitobxonlik
madaniyatini
tarbiyalashning muhim omilidir. Bunda o‘qish uchun ajratilgan soatlardan
foydalaniladi.
Badiiy va ilmiyommabop asarlar mustaqil ravishda va izchil o‘qib
borilsagina, o‘quvchilarning dunyoqarashini shakllantirish va kengaytirishga
xizmat qiladi.
Sinfdan tashqari o‘qish tanish bo‘lmagan
mualliflarning kitoblari
muqovasi, titul varag’i, kirish so‘zi, mundarijasi va suratlariga qarab asarning
taxminiy mazraunini aniqlashga o‘rgatish vazifasini amalga oshirishga xizmat
qiladi.
Sinfdan tashqari o‘qish darslarining asosiy vazifasi o‘quvchida
badiiy
kitoblarni o‘qishga havas uyg’otish, o‘qigan kitoblari yuzasidan kundalik yurita
282
olishga o‘rgatish, bolalar adabiyotining mashhur adiblari hayoti va ijodi bilan
elementar tarzda tanishtirish hisoblanadi.
Bolalarda ezgulikka muhabbat, yovuzlikka nafrat uyg’otish,
ularning
bog’lanishli nutqini o‘stirish, adabiyestetik tafakkurini yuksaltirish sinfdan
tashqari o‘qish darslarining ham tub mohiyatini tashkil etadi.
STO‘ darslarining
muhim vazifalaridan biri mustaqil o‘qish
Taymer va darajali uzilishlar kontollerining tuzilishi va ishlash

6.4-rasm.
K580BI53 seriyasidagi taymerning va
K580BH59 seriyadagi
darajali uzilishlar kontrollerining sxematik k
ơrinishi.
Masalan K580VI53 taymeri 3 ta bir-biriga b
og’lik bơlmagan 16 razryadli
ayiruvchi sanash qurilmalaridan iborat. Ular 2/10 lik va 2
lik sanoq sistemalarida
ishlashi mumkin. Xar bir sanash qurilmasini bir necha ish rejimidan (mul`tivibrator,
yakkavibrator, tu
g’ri impul`slar generatori va x.k.) biriga programmlashtirish
mumkin. Xar bir sanash qurilmasi Ci
– impul`slar kirishiga, Ui –boshqarish kirishiga
va OUTi
– chiqish signaliga ega.Taymerni programmalash davomida uning sanash
qurilmasiga 16 razryadli son yoziladi. Ui-boshqarish singnali ruxsati bilan Ci-
kirishidagi xar bir impul`s sanash qurilmasidagi sonni bittaga kamaytiradi va
u “0”
soniga yetganda OUTi
– chiqishida ish rejimiga mos bơlgan singnal xosil bơladi.
Masalan, taymer schetchiklaridan birini impul`slar ketma-ketligi ko'rinishidagi
signal beruvchi,
«Elektronika NSTM-01» robotining chiziqli xarakat yuritmalari yơl
datchikiga, ulash mumkin.
Darajali uzilishlar kontrolleri (DUK) mikroprotsessorli
boshqarish
sistemalarida apparat vositalari va programma asosida xosil qilinadigan turli uzilish
sơroqlariga (asosiy programmani vaqtincha tơxtatib, uzilish sơrog’iga mos
programmani ishga tushirish va u bajarib
bơlingandan sơng asosiy progammani
uzilish
bơlgan joyidan davom ettirish) xizmat kơrsatish uchun mơljallangan. DUK
ning ishlash prinsipi bilan tanishishni K580VN59 katta
integral sxemasi misolida
k
ơramiz (6.5-rasm). Xar bir DUK 8 ta uzilish so’rog’iga (IR0, IR1,..., IR7) xizmat
k
ơrsata oladi.
T
OUTO
OUT1
OUT2
U
cc
Д0
.
.
Д7
А0
А1
CS
RD
WR
C
0
У
0
C
1
У
1
C
2
У
2
DUK
INT
IR0
IR1
IR2
IR3
IR4
IR5
IR6
IR7
U
cc
GND
Д0
.
.
Д7
А0
CS
INTA
RD
WR
CASO
CAS1
CAS2
MS
6.5-ra
sm. “Elektronika NSTM-01" roboti impul`sli datchigining ishlash
prinsipi.
Bir nechta DUKlarni kaskadlash sxemasi orqali ulash bilan 64 tagacha
uzilish
sơrog’iga xizmat kơrsatuvchi sxemani xosil qilish mumkin. CAS0, CAS1,
CAS2 - kaskadlash sxemasi b
ơyicha ulanish kirishlari. Bunday sxemada bitta DUK
yetakchi, qolganlari ergashuvchi xisoblanadi. Ularning yetakchilik yoki
ergashuvchanlik maqomi MS kirishi orqali
ơrnatiladi. INT, INTA – mikroprotsessor
bilan bo
g’lanish singlari.
Biror
IRi-kirishi orqali uzilish
sơrog’i kelganda DUK mikroprotsessorga
INT orqali uzilish
sơrog’i yuboradi. Mikroprotsessor
bajarayotgan komandasini
oxiriga yetkazib, uzilishga tayyorlik singnali INTA ni DUKga uzatadi va undan 3
baytli podprogrammaga
ơtish komandasini qabul qiladi. Bu podprogrammada
kelgan uzilish s
ơrog’iga mos xizmat kơrsatish programmasi joylashgan bơladi. 6.6-
rasmda taymer va DUKning mikroprotsessorli sistemaning adreslar, ma`lumotlar va
boshqarish shinalariga ulanish sxemasi keltirilgan.
6.6
– rasm. Taymer va DUKni sistema shinalariga ulanish sxemasi
U
п
(0,4мм)
+5В
U
п
t
1
2
3
Raz’yomga
BSh
АSh
1
SELECT book.title, author.name FROM author LEFT JOIN

|
SELECT book.title, author.name FROM author LEFT JOINBog'liq Mundarija kirishSELECT book.title, author.name FROM author LEFT JOIN
book ON book.author = author.id
E‟tibor bering tashыi jamlanmada WHERE o„rniga ON kalit so„zi
ishlatiladi.
MySQL tabiiy tashqi jamlashdan (natural outer join)foydalanishga
imkon beradi. Tabiiy tashqi jamlash ikki jadval ikki ustuni bir xil nom
va bir xil tiga ega bo„lgan hamda shu ustundagi qiymatlar teng bo„lgan
satrlarni birlashtirishga imkon beradi:
SELECT my_prod.name FROM my_prod NATURAL LEFT
JOIN their_prod
Jadvallarni o‘zi bilan jamlash.
Jadvallarni o„zi bilan jamlash uchun xar bir satrning o„zi yoki
boshqa satrlar bilan kombinatsiyasini xosil qilishingiz mumkin. So„ngra
xar bir satr predikat yordamida baxolanadi. Bu turdagi jamlash boshqa
turdagi jamlashdan farq qilmaydi, farqi ikki jadval bir xildir. Jadvallarni
jamlashda qaytariluvchi ustun noilari oldiga jadval nomi qo„yiladi. Bu
usutunlarga so„rovlarda murojaat qilish uchun xar xil nrmlarga ega
bo„lishi kerak. Buning uchun vaqtinchalik nomlar Ya‟ni psevdonimlar
qo„llandi. Ular so„rov FROM jumlasida jadval nomidan so„ng bo„shlik
qo„yib yoziladi.
Misol: bir xil reytingga ega xamma buyurtmachilar juftlarini
topish.
SELECT a.CName, b.CName, a.Rating FROM Customers a,
customers b WHERE a.Rating = b.Rating;
Bu holda SQL a va b jadvallarni jamlagandek ish tutadi. Yuqorida
keltirilgan misolda ortiqcha satrlar mavjud, xar bir kombinatsiya uchun
ikkita
qiymat.
Birinchi
psevdonimdagi
A
qiymat
ikkinchi
psevdonimdagi B qiymat bilan kombinatsiyasi olinadi, so„ngra ikkinchi
psevdonimdagi A qiymat birinchi psevdonimdagi B qiymat bilan
kombinatsiyasi olinadi.
Xar gal satr o„zi bilan solishtiriladi. Buni oldini olish soda usuli
ikki qiymatga cheklanish kiritish, toki birinchi qiymat ikkinchisidan
kichik bo„lsin yoki alfavit bo„yicha oldin kelsin. Bu predikatni
63
aasimmetrik qiladi, natijada xudi shu qiymatlar teskari tartibda
olinmaydi.
Misol:
|
| |
Listen and check. Then repeat

|
Listen and check. Then repeat Pdf ko'rish
|
bet | 87/255 | Sana | 14.06.2024 | Hajmi | 18,95 Mb. | | #263803 |
Bog'liq {teacherscom library} EFL Grade 8 TB
Listen and check. Then repeat.
2
Look at the photos and complete the sentences
with
wide
,
high
,
long
and
deep
.
VOCABULARY
READING
EP
111
ABOUT YOU
What are your favourite places or things
in nature?
What activities do you like doing outside?
Where do you like doing them?
5
What can you see in the photos on page 91?
What do you think this strange story is about?
6
Read the article quickly. Check your answers to
Exercise 5.
7
Read the article again. Complete the text with
wide, high, long
and
deep.
8
In pairs, discuss these questions.
1
Do you think the Yeti is real, or is it just a story?
2
What do you think the footprint in the snow
belongs to?
1
Mount Everest is 8,848 metres
.
2
The Amazon River is 11 kilometres
and
6,400 kilometres
.
3
Lake Titicaca is 107 metres
.
3
Match the words in Exercise 1 to the adjectives in
the box.
deep high long wide
4
Think about your country. Give the names of …
•
two high mountains
•
an area of deep water
•
a long river
•
a wide lake.
EP
100 metres
long
15 metres
deep
40 metres
|
| |
Answers - Efl prepare Teacher's Book Grade 8

|
Efl prepare Teacher's Book Grade 8 Pdf ko'rish
|
bet | 89/255 | Sana | 14.06.2024 | Hajmi | 18,95 Mb. | | #263803 |
Bog'liq {teacherscom library} EFL Grade 8 TB111
Answers
1 high 2 wide, long 3 deep
3
Demonstrate the first word in Exercise 1 as a class:
Teacher:
What are cliffs like?
Student:
They’re usually high.
Point out that
snow
and
water
are uncountable so the
question is
What is snow/water like?
Students continue in
pairs.
Answers
cliff: high, wide
mountain: high
field: long, wide
river: long, wide, deep
island: long, wide
snow: deep
lake: long, wide, deep
water: deep
4
In pairs, allow the students about two minutes to think
of examples of each one. If appropriate, allow them to
check their ideas online. Then, check answers as a class.
Answers
Students’ own answers
BACKGROUND INFORMATION
The Yeti, also known as the Abominable Snowman, is a
mythical creature which lives in the Himalayas (Nepal,
India, Russia, China, etc.) and leaves its tracks in the snow.
Modern explorers have claimed to have seen their tracks
in the snow and some have even brought back samples
from Yetis, e.g. skin, hair and teeth. Recent DNA tests have
shown that these samples belong to real animals such as
dogs and bears.
5
Ask students to describe the two photos on page 91 (the
mountain and footprint) and say what they think the
story is about.
Answers
Students’ own answers
6
Ask students to read the text to check their ideas.
Encourage them to say which four words are missing
from the text (
wide
,
high
,
long
and
deep
).
Answers
Students’ own answers
7
Point out that they will need to use each word once.
|
| |
SELECT * FROM Customers - Mundarija kirish mavzu

70
Ikki yoki undan ortiq jadvallar jamlanganda
ularning chiqish
ustunlari jamlash uchun o„zaro muvofiq bo„lishi kerak. Bu shuni
bildiradiki, xar bir so„rov bir xil sondagi ustunlarni ko„rsatib,
bu ustunlar
mos tartibda kelishi va xar biriga mos tiplarga ega bo„lishi kerak. Sonli
maydonlar bir xil tipga va kattalikka ega bo„lishi kerak. Simvolli
maydonlar bir xil sondagi simvollarga ega bo„lishi kerak.
Moslik
ta‟minlovchi yana bir shart bo„sh (NULL) qiymatlar jamlanma ixtiyoriy
ustunida man etilgan bo„lishi kerak. Bu qiymatlar boshqa jamlovchi
so„rovlarda ham man etilgan bo„lishi kerak.
Bundan tashqari siz ostki
so„rovlarda UNION operatoridan, hamda jamlovchi so„rov
SELECT
operatorida agregat funksiyalardan foydalanishingiz mumkin emas. Siz
individual so„rovlardagi kabi natijani tartiblash uchun ORDER BY
operatoridan foydalanishingiz mumkin. Jamlanma
ustunlari chiqarish
ustunlari bo„lgani 4chun ulapr nomlarga ega bo„lmaydi, shuning uchun
nomeriga qarab aniqlanishi lozim.
Demak ORDER BY operatorida
ustun nomeri ko„rsatilishi lozim. Foydali jamlanmalardan biri ikki
so„rovnni jamlashda ikkinchi so„rov birinchi so„rov
chiqarib tashlagan
satrlarni tanlashidir. Bu tashqi jamlanma deyiladi.
Misol: O„z shaxarlarida buyurtmachilarga ega yoki ega emasligini
ko„rsatgan xolda xamma sotuvchilarni chiqarish.
SELECT * FROM Orders WHERE AMT >

65
Korrellangan (mutanosib) joylashtirilgan ostki so‘rovlar.
SQL tilida ostki so„rovlardan foydalanilganda tashqi so„rov FROM
qismidagi ichki so„rovga mutanosib so„rov yordamida murojaat
qilishingiz mumkin. Bu xolda ostki so„rov asosiy so„rov
xar bir satri
uchun bir martadan bajariladi.
Misol: 3 oktyabrda buyurtma bergan xamma buyurtmachilarni
toping.
SELECT * FROM Customers a WHERE ‘1990/10/03’ IN
SELECT a.CName, b.CName, a.Rating FROM Customers a

64
Bu holda ostki so„rov faqat bitta 11 qiymat chiqaradi, lekin
umumiy xolda bir necha qiymatlar bo„lishi
mumkin va ular ichidan
DISTINCT faqat bittasini tanlaydi. Ixtiyoriy sondagi satrlar uchun
avtomatik ravishda bitta qiymat xosil qiluvchi funksiya turi - agregat
funksiya bo„lib, undan ostki so„rovda foydalanish mumkin.
Masalan, siz summasi 4 oktyabrdagi bajarilishi lozim bo„lgan
buyurtmalar summasi o„rta qiymatidan yuqori bo„lgan xamma
buyurtmalarni ko„rmoqchisiz:
Table 3.6 Attribute Type Declarations Part 1: Associating an Element with an

- 79 -
9.
NMTOLKENS
10.
NOTATION
Let’s take a look at each type (or groups of types since several are similar) in greater
detail.
String Attributes
Strings in attribute types are like strings in all programming languages—they are a series
of character data. In XML, string lengths not defined and can be arbitrarily long. From a
design perspective, however, we do not recommend using long strings in your attributes.
To assign a string type to an attribute called authors to an element of type book, here’s
what you’d do:
CDATA
default
>
The CDATA keyword implies a string. Strings can contain all text characters except for
special characters like quotation marks and ampersands. These exceptions are noted in
Table 3.3
. You can include these characters by using the entity references specified in
Table 3.3
.
Here’s what a book element, as specified above, could look like (assume the element
type declaration has already been made to allow PCDATA):
The Hobbit
Scenario: Specifying a List of Subelements: Only One Occurrence

- 73 -
For this declaration, a legitimate XML representation would be:
…
Other legal answers would be only choice2 or choice3. Thus,
...
...
would be unacceptable as the declaration specifies
only
one occurrence of the elements
specified can occur. Similarly,
…
is not allowed because choice4 has not been specified in the list of acceptable choices.
Scenario: Specifying a Subelement That Occurs Once or Not at All
Suppose you create an online form that requires information from a user, some of which
is optional. For example, say you’re asking for personal information and that title is not a
required field, while the user’s name and e-mail address is required. You only want one
occurrence of each field and you want it in a particular order. Here’s how to specify it:
According to this, the parser thinks an element of type user consists of one element of
type name, one element of type e-mail, and optionally one element of type title.
Here’s what a valid user element looks like:
Austin Sours
austins@being_silly.com
International Man of Tartness
An equally valid user could look like this:
Austin Sours
austins@being_silly.com
A nonvalid user element would be:
Austin Sours
- 74 -
international man of tartness
This example is not valid because the necessary e-mail_address element is missing.
General Points - Microsoft Word Applied xml a toolkit for Programmers Wiley doc

- 99 -
example, Title may refer to a book’s name or describe how to address a person (Mr.,
Mrs., or Ms.).
•
Namespaces are easy to use; however, they are not necessarily less verbose. Recall
the W3C’s intentions behind XML: “Terseness in XML markup is of minimal
importance.”
•
Namespaces give you a unique way for naming each attribute and element. This feature
gives you a great amount of control over manipulating the values of attributes and
elements for unique formatting purposes or for taking the values and performing further
processing.
Summary
In this chapter, we went through a lot of effort trying to describe the basics and underlying
semantics of the XML syntax as well as how to go about making DTDs for describing the
structure of your data. These basics are useful as they help you create XML applications.
Nothing is worse than making an application for something whose specs are not well
understood. We hope that after reading this chapter, you’ve eliminated that problem.
We also made many references to what the parser’s reaction to syntax is like. These are
important to you as a programmer because the parser can do a lot of the grunt work
associated with making applications. The parser can take care of basic error-checking
functions—checking that the markup is well formed and that it is valid against the DTD or
schema—which often make up more than half the code of an application. You can
bypass a lot of this by using a standard parser, which is why we spent so much time
describing the parser’s reactions to different scenarios.
Finally, all the information in this chapter is a building block to help you on your way to
creating the next generation of applications across the Web. Now that you’ve got the
basics nailed down, you can move on to the more challenging aspects of creating
applications with XML.
xmlns
:mama="http://mamazon.com/schema"
xmlns

- 98 -
We’ve prefixed all the mama:book elements with the mama prefix to tell the parser that
each component used is to be validated against the Mamazon.com schema.
2.75
We’re trying to illustrate that it is possible to use components described across many
different schemas and DTDs. Here, we’ve made up a mythical electronic commerce
organization that globally defines standards for currency units. While the mama:price
element is subject to validation against Mamazon’s schema, its currency attribute is
subject to validation against the E-commerce Organization’s schema.
Also, we should clarify that we’re assuming that the mama schema has a provision for
allowing a currency attribute in it whose definition comes from the E-commerce
Organization.
Here we’re using a book element whose definitions are described in the
http://NarnesAndBobel.com/book.dtd
file. When this element is parsed to check for
validity, the parser checks it against the type definitions expressed in that DTD. Thus, the
rest of the nab:book element’s structure—in this case its attributes—have to look exactly
as it would if it were working in isolation. We’ve prefixed all of the nab:book attributes with
the nab prefix to tell the parser that each component used is to be validated against the
NarnesAndBobel DTD.
You should buy the book from Mamazon.com
Wait a minute; these elements don’t have any prefixes! That’s fine. Remember that you
don’t
have
to validate everything. In this case, because this element is our own and we
have control over it, we decided not to validate it against anything. Our Result element is
not limited to only containing elements and attributes defined in the xmlns: attribute
values.
Namespaces - Microsoft Word Applied xml a toolkit for Programmers Wiley doc

- 96 -
Both are legitimate ways of representing information. Both structures can be defined in a
DTD. But how does one differentiate between these book types? This example is
intentionally scaled down, but you can easily imagine what much more complicated real-
life situations could be. For example, when the same attribute name is used in a single
document with many elements:
Furthermore, when you decide to do special formatting on the book’s name, how do you
distinguish it from the reviewer name attribute? Things can get pretty nasty very quickly,
but lest you think we’re evil people for making you read this entire chapter only to tell you
that an insurmountable obstacle prevents you from making a real-world XML application,
rest assured! There is a solution.
Fortunately, the good people at the W3C have been giving a lot of thought to this
situation. The solution they recommend was finalized in January 1999 and is expressed
in the concept of
namespaces
. Namespaces are a way of uniquely qualifying element
and attribute names on the Web, thus avoiding conflicts between elements (and
attributes) that have the same name.
The idea is to declare a namespace and a corresponding prefix for each DTD or schema
(see the section
“Concluding Thoughts on DTDs”
) and to preface every element or
attribute that is from a particular DTD with its corresponding namespace prefix.
We see the look of consternation on your face, which means its time for another
example. In this one, we’ve combined the information from both our vendors:
Scenarios: Specifying Subelements That Occur at Least Once and

- 75 -
declaration would look like this:
The parser now thinks that a user element is made of one name type element; none, one,
or several e-mail_address type elements; and one optional title element.
Here’s what a valid user looks like:
Austin Sours
austins@being_silly.com
austins@being_even_sillier.commail_address>
International Man of Tartness
It could also look like this:
Austin Sours
International Man of Tartness
or even this:
Austin Sours
A nonvalid user
element would look like this:
austins@being_silly.com
International Man of Tartness
We just described most of the simple element type descriptions, and nothing is stopping
you from using more complicated combinations of the “zero or one” (?), “zero or more”
(*), and “one or more” (+) content model operators.
Again, we recommend keeping things as simple as possible—we’re big fans of the KISS
(keep it short and simple) philosophy—but we realize some scenarios won’t let you do
that. Table 3.5 lists some examples of how you can make elements with more specialized
content models.
Part II
: XML Document Object Model (DOM)

- 100 -
10:
Chapter 4:
Introduction to Document Object
Model (DOM)
Overview
XML was introduced to alleviate interoperability problems across platforms and networks.
A standard language, combined with a DTD (or another schema construct), provides a
standard data way of exchanging data. Not only does data need to be in a standard
format, but the way data is accessed should also be standardized. XML provides the
constructs for putting data into a standard format, and as we shall soon see, the
Document Object Model provides a standard way of accessing data. A Web developer,
who provides some script inside a Web page that makes use of an XML document,
shouldn’t have to recode the script to work in every browser.
Some overhead is involved when using XML documents, because extracting data from the
tags in an XML document can be arduous. A parser is used to take care of checking a
document’s validity and extracting the data from the XML syntax. A layer of abstraction
between the application and the XML document is made possible by the XML Document
Object Model (DOM) specification, which has been standardized by the W3C. This layer of
abstraction comes in the form of interfaces that have methods and properties to manipulate
an XML document. In other words, when using the DOM, you don’t need to worry about the
XML syntax directly. For example, the methods, getAttribute(...) and setAttribute(...), allow
you to manipulate the attributes on an element in an elegant fashion. Legacy systems can
use these interfaces to provide access to legacy data as if the data was natively stored in
XML. In other words, your legacy data can be made to look like an XML document by
implementing the DOM interfaces on top of the legacy database.
Table 3.7 Attribute List Declarations Part 2: Assigning an Attribute’s Type

|
Table 3.7 Attribute List Declarations Part 2: Assigning an Attribute’s TypeBog'liq Ceponkus, Hoodbhoy - Applied XML - Toolkit for ProgrammersTable 3.7 Attribute List Declarations Part 2: Assigning an Attribute’s Type
Partial Attribute Type Declaration
Interpretation
CDATA
d
e
fault
>
A string type attribute. An element of type
car
has a
manufacturer
attribute associated with it
that contains string information.
Acceptable XML document entries for
car
:
- 83 -
or
(American|European|Japanes)
default
>
An enumerated attribute type. An element of
type
car
has a
manufacturer
attribute associated
with it that can only contain one of the following
values: American, European, or Japanese.
Acceptable XML document entries:
or
or
Unacceptable entry:
ENTITY
default
>
An ENTITY attribute type. An element of type
car
has a
logo
attribute associated with it that
can hold one previously declared entity.
Acceptable XML document entry (assume
pentagon
is a previously declared entity):
Unacceptable entry:
ENTITIES
default
>
ENTITIES attribute type, similar to ENTITY
types. An element of type
car
has a
logo
attribute associated with it that can hold one or
more previously declared entities.
Acceptable XML document entries (Assume
pentagon
and
arrow_head
are previously
declared entities):
or
- 84 -
Unacceptable entry:
ID
default
>
ID attribute type. An element of type
car
has a
chassis_number
attribute associated with it that
holds a value that is unique throughout the
entire XML document. IDs start with either a
letter(A–Z), an underscore (_), or a colon (:).
Acceptable XML document entry (assume
C12345
hasn’t been used before):
Unacceptable entry (assume above element is
included in document):
Reference
IDREF
default
>
IDREF attribute type. An element of type
car_to_recall
uses a
Reference
attribute
associated with it that points to another element
in the document bearing a unique ID value.
Acceptable XML document entry (assume
C12345
has been uniquely assigned to a
element—possibly
car
, though not necessarily
so):
"C12345">
Unacceptable entry:
"
unused_ID
">
Reference
IDREFS
default
>
IDREFS attribute type, plural of IDREF. An
element of type
cars_to_recall
uses a
Reference
attribute associated with it to point to one or
more other elements in the document bearing
unique ID values.
Acceptable XML document entries (assume
C12345
and
B67890
have been uniquely
assigned to some elements in the document):
or
"C12345">
- 85 -
Unacceptable entries:
"
unused_ID
">
or
NMTOKEN
default
>
NMTOKEN attribute type. An element of type
car
has a
hubcap_type
attribute whose values
contain no white space.
Acceptable XML document entry:
Unacceptable entry:
|
| |
Литература - Toshkent davlat texnika universiteti xalqaro ilmiy-texnik anjuman

МЕЖДУНАРОДНАЯ НАУЧНО-ТЕХНИЧЕСКАЯ КОНФЕРЕНЦИЯ
АКТУАЛЬНЫЕ ПРОБЛЕМЫ ЦИФРОВИЗАЦИИ ЭЛЕКТРОМЕХАНИЧЕСКИХ И
ЭЛЕКТРОТЕХНОЛОГИЧЕСКИХ СИСТЕМ
118
ишлашининг технологик схемалари ва усулларини такомиллаштириш ҳамда
энергетик кўрсаткичларини оптималлашга қаратилган илмий тадқиқотлар олиб
борилмоқда. Ушбу йўналишда, жумладан, суғориш насос станцияларда талаб
этилган сув сарфини етказиб беришда насос ишчи
паррагини айланиш тезлигини
частота ўзгартиргич асинхрон двигател тизимининг бошқариш самарадорлиги ва
ишончлилигини ошириш бўйича тадқиқотлар устивор ҳисобланади. Шу билан
бирга мавжуд сув таъминоти технологик тизимларини замонавий талабларга жавоб
берадиган автоматлаштирилган электр юритмалари ва
энергия тежайдиган
режимларга эришиш учун мўлжалланган автоматик бошқариш тизимларини ишлаб
чиқиш ва такомиллаштириш ҳам долзарб вазифалардан ҳисобланади. Насос
агрегатларини энергия тежамкор бошқариш усулининг энг самаралиси частота
билан ростланадиган электр юритмаларни қўллашдир.
Toshkent davlat texnika universiteti xalqaro ilmiy-texnik anjuman - bet 68

МЕЖДУНАРОДНАЯ НАУЧНО-ТЕХНИЧЕСКАЯ КОНФЕРЕНЦИЯ
АКТУАЛЬНЫЕ ПРОБЛЕМЫ ЦИФРОВИЗАЦИИ ЭЛЕКТРОМЕХАНИЧЕСКИХ И
ЭЛЕКТРОТЕХНОЛОГИЧЕСКИХ СИСТЕМ
102
Жадвал 1.
5000Д-32 русумли марказдан қочма насос, босим қувурларининг
бутун узунлиги
бўйича асосий ишчи кўрсаткичлари
№
т/с
Бьефлар
сатҳининг
фарқи
, м
НА сув
бериши
Q*, м
3
/с
НА
напори
, м
НА
ФИК
НА
қуввати
, кВт
НА солиштирма
электр энергия
сарфи Э*,
кВт соат/млн.м
3
1.
22,5
0,776
0,797
0,972
0,742
0,9836
2.
23
0,804
0,781
0,975
0,748
0,9768
3.
23,5
0,832
0,766
0,976
0,755
0,9742
4.
24
0,860
0,750
0,977
0,762
0,9711
5.
24,5
0,889
0,734
0,976
0,769
0,9729
6.
25
0,917
0,719
0,975
0,776
0,9765
7.
25,5
0,946
0,705
0,972
0,783
0,9837
Насос станцияси аванкамерасидаги сув сатҳлари ўзгаришининг насос
агрегатининг энергия тежамкор режимларини таҳлил қилиш мақсадида Тошкент
вилояти ―Рамадан‖ насос станцияси мисолида, гидромеханик ва электромеханик
ускуналарнинг реал техник тавсифларини ҳисобга олган ҳолда, 5000Д-32
русумли
марказдан қочма насос, босим қувурларининг бутун узунлиги бўйича геометрик
ўлчамларини, жумладан сўриш,
коммуникация ва умумий, босим қувурлари
тавсифларини киритган холда, шунингдек, маҳаллий қаршиликлардаги босим
йўқотишлари қийматларини (сурилма клапани,
тескари клапанлари, равон
бурилиш жойлари, аста-секин кенгайиш ѐки торайиш ва бошқаларни) ҳисоблаш
учун ишлаб чиқилган математик модели ва услубига мувофиқ, Насос агрегатини
асосий ишчи кўрсаткичлари ҳисобланди ва улар 1 – жадвалда келтирилди.
Методы - Toshkent davlat texnika universiteti xalqaro ilmiy-texnik anjuman

МЕЖДУНАРОДНАЯ НАУЧНО-ТЕХНИЧЕСКАЯ КОНФЕРЕНЦИЯ
АКТУАЛЬНЫЕ ПРОБЛЕМЫ ЦИФРОВИЗАЦИИ ЭЛЕКТРОМЕХАНИЧЕСКИХ И
ЭЛЕКТРОТЕХНОЛОГИЧЕСКИХ СИСТЕМ
108
формирователя тока статора (ФТС). Увеличится и корректирующее напряжение
положительной обратной связи
,
вычисляемое по выходному току
I
звеном с
передаточной функцией
, (5)
где
– постоянная времени задержки контура тока.
Рис. 4. Механические характеристики электропривода (кривые 1, 2)
и результирующая характеристика – 3 при наличии положительной
обратной связи по току
С ростом корректирующего сигнала возрастет и
сигнал управления
, что
приводит в конечном итоге к росту фазного напряжения
асинхронного
двигателя и увеличению его критического момента, который пропорционален
квадрату фазного напряжения –
. Характеристика 2 соответствует
возросшему фазному напряжению
. В результате
действия положительной
обратной связи электропривод формирует механическую характеристику
замкнутой системы 3, жесткость которой определяется коэффициентом
. Для
формирования сигнала положительной обратной связи по току может
использоваться модуль тока статора
I
1
, активная составляющая тока статора
Re
,
ток
в звене постоянного тока.
Однако если через обмотки статора асинхронного двигателя не протекают
токи нулевой последовательности, то
достаточно двух датчиков тока, а ток в
третьей фазе, например B , можно определить через токи фаз A и C :
,
(6) , где
мгновенные значения токов в фазах A, B и C.
Векторные диаграммы при скалярной
IR
–компенсации для случаев идеального
холостого хода и наличии нагрузки на валу двигателя изображены на рис. 5.
Рис. 5. Векторные диаграммы асинхронного двигателя
МЕЖДУНАРОДНАЯ НАУЧНО-ТЕХНИЧЕСКАЯ КОНФЕРЕНЦИЯ
АКТУАЛЬНЫЕ ПРОБЛЕМЫ ЦИФРОВИЗАЦИИ ЭЛЕКТРОМЕХАНИЧЕСКИХ И
ЭЛЕКТРОТЕХНОЛОГИЧЕСКИХ СИСТЕМ
109
при скалярной
IR
-компенсации: а – режим холостого хода;
б – при наличии нагрузки на валу двигателя.
Husnixat darslarini rejalashtirishga qo‘yiladigan talablar

146
oquvchilarga to‘g’ri yozish uchun harflar va so‘zlar nimalardan va qanday hosil
bo‘lishi haqida va to‘g’ri o‘tirish qoidalari, mchkani tutish yo‘llari haqida
ma’lumotlar berib o‘tadi. O‘qituvchl yozuv jarayonida ishtirok etadigan tana
qismlarini ko‘rsatadi. Biron -bir o‘quvchi sinf xonasining o‘rtasiga chiqarib
tartib bilan o‘quvchining boshi, ko‘zi, yelkasi va h.zolarni ko‘rsatib,
o‘quvchilarni o‘z s avollariga javob berishlarini talab qiladi.
Agar o‘quvchilar ayrim tana qismlarini old yelka, barmoq bo‘g’inlarini
bilmasalar, o‘qituvchi ularning nomini aytib, yozuvda u yoki bu tana qismining
qanday ishtirok etishini tushuntirib o‘tadi.
So‘ng o‘qituvchi yozuv jarayonida noto‘g’ri o‘tiris bir qancha jiddiy
kasalliklarning kelib chiqishiga sabab bo‘lishini va keyinchalik butun hayoti
davomida qolishi haqida ma’lumot berib o‘tadi. Bula rga masalan: uzoqni ko‘ra
olmaslik, bukchayish, nafas olishning qiyinlashuvi va o‘zidan keyin ko‘krak
qafasi kasalliklarining kelib chiqishiga va hokzolarga sabab bo‘ladi.
Undan
keyin
o‘qituvchi o‘quvchilarga tushuntirib o‘tganlarining
hammasini takrorlab berishlarini taklif etadi va yozayotganda to‘g’ri o‘tirish
tartibini ko‘rsatib beradi.
Stolga o‘tirayotganda o‘quvchilarga yaxshi ko‘rinadigan joyga (eng
yaxshisi profil holda) o‘tirib: ‘Qaranglar, men hozir yozish jarayonida qanday
o‘tirish talab etilsa, shunday o‘tiraman. Sizlar ham men qanday o‘tirsam,
shunday o‘tirishga harakat qiling. Qarang-chi, men qanday o‘tiribman, egilibmi,
yo to‘g’ri?’
O‘quvchilar: To‘g’ri.
O‘qituvchi: qaranglar, mening qo‘llarim qayerdaturi bo‘ladi va diqqat bilan
qarang-chi, tirsaklarim qanday holda turibdi?
Yuqori sathda programmalash tillari

Yuqori
sathli til
– termini (so’zi) oson o’qish uchun mo’ljallangan
programmalarni yozishda qo’llaniladigan tillarni belgilash uchun xizmat qiladi.
Yuqori tilda yozilgan programma keyinchalik assembler tiliga aylantiriladi undan
keyin esa mikroko
ntroller bajarishi uchun obekt kodiga ya’ni mashina kodiga (bitlar
va baytlarga) o’zgartiriladi.
Yuqori sathli tillarni asosiy xarakteristikalarini keltiramiz:
-
o’rnatilgan funktsiyani ulanadigan bibliotekalarini borligi (masalan: konsolli
kiritish/chikarish);
-
har xil turdagi qiymatlar (8, 16, 32 bitli va o’zgaruvchi nuqtali);
-
lokalli va globalli o’zgaruvchilardan ko’rsatkichlardan va qiymatlar
strukturasidan foydalanish;
-
xotirani taqsimlash;
- apparatli registrlarga kirish imkoniyati;
- simuly
ator/emulyatorlar uchun simvolik ma’lumot.
Ushbu xususiyatlarga ega bo’lgan o’rnatilgan (
vstroenniy)
MK uchun bu
xarakteristikalarni amalga oshirish muammo tug’diradi.
“STEP-5” paketi.
Bu paket SIMATIC S-
5 oilasiga mansub bo’lgan SIEMENS firmasida ishlab-
c
hiqariluvchi logikali kontrollerlarni programmalash uchun qo’llaniladi. Bu paket
DOS operatsion sistemasi PG-7xx turidagi programmatorlar bilan birga
ushbu sabablar tufayliishlatiladi:
- Logikali kontrollerlarda ROM programma
xotirasi va RAM qiymatlar
xotirasini hajmini chegaralanganligi tufayli;
-
Logikali kontrollerlarda operatsion sistemani yoki BIOS ni yo’qligi tufayli;
-
Ma’lumotlarni kiritish/chiqarishni oldindan aniqlash (chiqish raqamli,
analogli, ketma-ket kiritish/chiqarish kabi rejimlarda ishlatilishi mumkin).
Bulardan tashqari, zamonaviy kross vosita paketlar
aralash programmalarni
osongina yozishga imkon beradi. Programmalarni modulini bir qismi Ci tilida tezligi
bo’yicha zarur bo’lgan modulini boshqa qismini assemblerda yozish mumkin. Ci
kom
pilyatorlari boshlang’ich tekstlarga assemblerli instruktsiyalarni o’rnatishga
imkon beradi.
Mikrokontrollerlarga programma ta’minotini yaratishda foydalaniladigan
jamg’armalarni (resurslarni) hajm ko’rsatilgan chegaradan
bajarilishi oshmasligi
kerak bo’lgan bir qancha qoidalar bor:
Apparatli vositalar bilan (tashqi qurilmalar) faqat bitta turli interfeysni qo’llash:
Qism programmalar uchun spetsifikali bo’lgan global o’zgaruvchilarni
identifikatsiyalash va ularni yana kodda qo’llamaslik.
Imkoni bor joyni h
ammasida lokal o’zgaruvchilarni qo’llash.
Vaqtincha qo’llaniladigan o’zgaruvchilarni borligi nazarda tutilsa,
u holda
programma ularni unikalli qo’llashni ta’minlashi kerak.
SELECT * FROM Salepeople - Mundarija kirish mavzu

69
Bu operator Rimdagi xamma buyurtmachilar baxolari qiymatlarini
tekshiradi. Shundan so„ng Rimdagi xamma buyurtmachilardapn baxosi
yuqori bo„lgan buyurtmachilarni topadi.
Rimda eng yuqori baxo -
Giovanni (200). Demak 200 dan yuqori qiymatlar olinadi.
ANY operatori uchun bo„lgani kabi ALL operatori uchun ham IN
va EXISTS yordamida al‟ternativ konstruksiyalar yaratish mumkin.
ALL asosan tengsizliklar bilan ishlatiladi, chunki qiymat "xammasi
uchun teng " ostki so„rov natijasi bo„lishi mumkin agag xamma natijalar
bir xil bo„lsa. SQL da < > ALL ifoda aslida ostki so„rov natijasining "
xech qaysisiga teng emas " ma‟noni bildiradi. Boshqacha qilib aytganda
proedikat rost agar berilgan qiymat ostki so„rov
natijalari orasida
topilmagan bo„lsa. Agar oldingi misolda tenglik tengsizlikka
almashtirilsa, reytingi 300 ga teng bo„lgan
xamma buyurtmachilar
chiqariladi, chunki ostki so„rov 100 va 200 ga teng reytinglarni topgan.
ALL va ANY – orasidagi asosiy farq, ostki so„rov
xech qanday
natija qaytarmagan xolatda ko„rinadi. Bu xolda ALL - avtomatik
(“TRUE”) ga teng, ANY bo„lsa avtomatik (“FALSE”) ga teng.
Misol: Buyurtmachilar jadvali xammasini chiqarish
Insert into  values (,,) - Mundarija kirish mavzu

|
Mundarija kirish mavzuBog'liq Mundarija kirishInsert into values (,,);
Bunday yozuvda VALUES kalit so„zidan keyin qavs ichida
ko„rsatilgan
qiymatlar
jadvaldagi
yangi
qo„shilgan
satrning
maydonlariga kiritiladi. Kiritish jadvalini CREATE TABLE operatori
bilan yaratilish paytidagi ustunlarni ko„rsatish tartibida amalga
oshiriladi. Masalan, STUDENT jadvalida yangi satrni qo„shish
quyidagicha amalga oshirish mumkin.
Insert into Student Values (101, ‘Aliyev’, ‘Rustam’, 200, 3,
‘Uzbekistan’, ‘6/10/1979’, 15);
Agar birorta maydonga NULL qiymati qo„shish zarur bo„lsa u
oddiy qiymat kabi kiritiladi.
Insert into Student Values (101, ‘Aliyev’, Null, 200, 3, ‘Uzbekistan’,
‘6/10/1979’, 15);
Ba‟zi hollarda maydonlarning qiymatini CREATE TABLE
komandasida berilgan tartibdan boshqa tartibda kiritish zaruriyati paydo
bo„lsa yoki qiymatlarni ba‟zi bir ustunlarga kiritish talab etilmasa,
INSERT komandasining quyidagi ko„rinishi ishlatiladi.
Insert into Student (Student_ID, City, Surname, Name) Values
(101, ‘Uzbekistan’, ‘Aliyev’, ‘Rustam’ );
Qavs ichidagi ro„yxatda nomi keltirilmagan ustunlarga avtomatik
ravishda sukut bilan jadval tavsiflashda (CREATE TABLE
komandasida) tayinlangan qiymat yoki NULL qiymat tayinlanadi.
INSERT komandasi yordamida, bir jadvaldan qiymat tanlab olib
uni boshqa jadvalga joylashtirish mumkin.
Insert into Student1 SELECT * from Student where CITY=‘Xiva’;
Bunda Student1 jadvali CREATE TABLE komandasi yordamida
yaratilgan bo„lishi kerak va Student jadvali strukturasiga o„xshash
bo„lishi kerak.
76
Jadvaldagi satrlarni o`chirish uchun DELETE komandasi
ishlatiladi. Quyidagi ifoda Exam_Marks1 jadvalidan barcha satrlarni
o`chiradi.
|
| |
91
MYSTERIES IN NATURE
     
180 UNIT 15
1

180 UNIT 15
1
Look at the photos. What do you know about
Loch Ness and the Loch Ness Monster?
2
Read the article quickly and match the
pictures A–C to the paragraphs 1–3.
READING
3
Read the article again and answer the questions.
1
When do people think they see things on
the loch?
2
What does ‘loch’ mean?
3
How big is Loch Ness?
4
Which has more water: the lakes of Wales
and England or Loch Ness?
5
When did people first see a monster?
TALKING POINTS
Do you think there is a monster
living in Loch Ness?
If not, why do so many people
think they see something?
B
Loch is the Scottish Gaelic word for ‘lake’. Loch Ness is in
the north of Scotland not far from Inverness. The loch is
230 m deep – it’s the second deepest loch in Scotland –
36 km long and nearly 3 km wide. There’s more water in
Loch Ness than all the water in all the lakes in England and
Wales. That’s a lot of water for something to hide in!
The weather around the loch changes quickly.
One minute it’s sunny, the next it’s cloudy, the next
there’s a bit of rain, and then it’s sunny again. It can
be a windy place, too. Clouds move quickly through
the sky and on sunny days the clouds make shadows
on the water. It’s easy to think you see something in
the water. When it’s foggy, the fog sits on the loch
and it’s possible to think you see things then too.
The story of the Loch Ness Monster, or ‘Nessie’,
started about 1,500 years ago. Then people called it
a giant water animal. In the 1930s, a new road beside
the loch brought more people to the area and more
people started to see more strange things. In fact,
over 1,000 people think they saw a strange animal in
the loch.
There are several photos of some of the strange
animals. Could any of them be Nessie?
(SELECT ODate FROM Orders b WHERE a.CNum = b.CNum)

66
4. Shundan so„ng asosiy so„rov predikatida 3 oktyabrdagi qiymat shu
to„plamga tegishliligini tekshiradi. Agar bu rost bo„lsa Hoffman satrini
chiqarish uchun tanlaydi.
5. Shundan so„ng u butun protsedurani Giovanni satrini satr –
kandidat sifatida foydalanib qaytaradi va saqlab qo„yadi, toki
Buyurtmachilar xamma satri tekshirilib bo„lmaguncha.
6. Ba‟zida xatolarni topish uchun maxsus yaratilgan so„rovlardan
foydalanish kerak bo„ladi.
7. Misol: Quyidagi so„rov Buyurtmachilar jadvalini ko„rib
chiqib
SNum va CNum mos kelishini tekshiradi va mos bo„lmagan satrlarni
chiqaradi.
ID, IDREF, and IDREFS Attributes

- 81 -
A valid part could look like this:
more part information
An IDREF is a pointer to the any of the unique IDs previously stated in the document. If
the above part element has been included in the document (with its unique
code_number), then it is possible to refer to it only on the basis of its ID value. Here’s the
attribute declaration:
IDREF
default
>
A valid part_to_order element would be:
more part_to_order information
The IDREFS type is similar except that it allows multiple references to IDs. An attribute
declaration of a parts_to_order element could look like this:
IDREFS
default
>
The corresponding valid element could look like this:
more parts_to_order
information
Birinchi vazifa - N. B. Adizova, R. X. Jumayev, R. A. Qo‘ldoshev, S. R. Ismatov ona tili o‘qitish metodikasi

161
topilmaydi. Bunday usul bilan vazifani tekshirish ularda uchraydigan xatoning
oldini olishning birdan-bir to‘g’ri yo‘lidir.
S a k k i z i n ch i g u r u h m a sh q l a r
Darsning maqsadi. «Uzunchoq» va «kaltaroq»
tushunchasini
anglatish.
Birinchi vazifa. Ikki xil uzunlikdagi yotiq va tik tayoqcha
elementlarini yozib ko‘rsatish.
Bu vazifa ham rangli qalam bilan bajariladi. O‘quvchilar bu
tayoqchalarning qaysi biri uzun, qaysi biri
qisqa ekanini solishtirib
ko‘radilar.
T o‘ q q i z i n ch i g u r u h m a sh q l a r
Darsning maqsadi. Harf elementlarini bir qatorga to‘g’ri
joylashtirishga o‘rgatish.
Birinchi vazifa. O‘quvchilarga bir qator cho‘zinchoq doira shaklini
yozib mashq qildirish.
Ikkinchi vazifa. O‘quvchilarga zangori qalam bilan cho‘zinchoq
doira
ichiga bir xil masofada kichik tayoqcha chizib chiqish topshiriladi. Har bir
tayoqcha bargning o‘rta qismi, ya’ni uning tomirlari vazifasini bajaradi.
Bargning ham kichik tayoqcha, bu esa bargning bandi hisoblanadi
Tayyorgarlik mashqlarini bunday tashkil etish o‘quvchilarni avtoruchka
bilan yozishga tayyorlashda katta rol o‘ynaydi.
Ammo tayyorgarlik davrida
o‘quvchilar yozuvga taalluqli bo‘lgan hamma malakalarni to‘liq hosil qildilar
deb bo‘lmaydi. Shuning uchun ayrim tayyorgarlik mashqlarini harflarini
o‘rgatish
davrida ham olib borish mumkin, masalan, kichik
u harfini
162
yozdirishga o‘rgatishda uning ikkinchi osti tugunchakli elementining
bog’lanishida qiynalishlari mumkin.
Yuqorida ko‘rsatilgan tayyorgarlik mashqlari qat’iy bo‘lmay o‘qituvchi
o‘quvchilarning kuchiga qarab
bir oz soddalashtirishi yoki, aksincha,
murakkabroq qilib olishi mumkin.
Ayrim mashqlarda harf elementlari nuqtalar bilan qo‘shib berilgan:
bunday ishlar o‘quvchilarning chamalash qobiliyatlarini o‘stirishga yordam
beradi.
Sinfda husnixat mashqlari o‘qituvchi
tomonidan doskada yozib ham
ko‘rsatiladi.