nyuuzyou/kompy huggingface dataset:
— pidjak; 1.2.2— - Mavzu: Zamonaviy kiyim tasnifi

|
Mavzu: Zamonaviy kiyim tasnifi
|
bet | 2/3 | Sana | 18.12.2023 | Hajmi | 8,38 Kb. | | #122768 |
Bog'liq Zamonaviy kiyim tasnifi-fayllar.org1.2.1 — pidjak; 1.2.2— jaket; 1.2.3 — kurtka va h.k.
Yosh — jmsiy jihatdan kiyim quyidagicha guruhlanadi: erkaklar kiyimi, ayollar kiyimi, bolalar kiyimi. Bolalar kiyimi o‘z navbatida — chaqaloqlar kiyimi, yasli yoshidagi, maktab yoshigacha, kichik maktab yoshi va o‘spirinlar kiyimiga
farqlanadi. 7
Yil fasliga va iqlimiy zonaga bog‘liq holda kiyim kichik guruhlarga bo‘linadi: bahorgi-kuzgi, yozgi, qishki va har mavsumli.
Kiyimning muayyan sharoitda ishlatilishiga qarab ushbu tasnifni yana davom ettirish mumkin. Masalan, ayollar ko'ylagi - kundalik, an’anaviy, uy ichi, ishchi va
h.k. bo‘lishi mumkin.
Sport kiyimlari sinfi sport turiga qarab kichik sinflarga, yosh — jinsga qarab
guruhlarga bo‘linadi.
Ishlab chiqarish kiyimlari sinfi vazifasiga ko‘ra uch kichik sinfga bo'linadi:
— maxsus kiyim; 3.2 — rasmiy kiyim; 3.3 — texnologik kiyim.
Maxsus kiyim himoyaviy funksiyasi bo‘yicha standart talablariga ko‘ra 13 guruh va 39 kichik guruhlarga bo'linadi. Misol uchun, mexanik ta’sirlardan, past va yuqori haroratlardan, radioaktiv moddalardan, rentgen nurlaridan, kislota, ishqor, yog‘ va h.k. ta’sirlardan himoyaviy guruhlari farqlanadi.
Maxsus kiyimlar, maishiy kiyimlardek, o‘z navbatida turlarga bo‘linadi.
Rasmiy kiyimlar — harbiy xizmatchilar kiyimi, dengiz va daryo xizmatchilari kiyimi, temir yo‘lchilar kiyimi, aloqachilar kiyimi va boshqalar. Rasmiy kiyimning asosiy xillari — shinel, palto, kitel, ko‘ylak, ich kiyim, bosh kiyim.
Texnologik kiyim — tibbiy va yuqori aniqlikni talab qiladigan ishlab chiqarishda odamni mehnat predmetlaridan muhofaza qilish uchun mo‘ljallangan.
Yosh va jinsga oid belgilar bo‘yicha rasmiy kiyim — erkaklar, ayollar kiyimlariga ajratiladi. Kiyim sharoitga bog‘liq holda esa yozgi, qishki, har mavsumli kiyimlarga ajratiladi.
Mazkur tasnif qulay bo‘lsa ham, qator kamchiliklardan xoli emas.
|
| |
Figure 13 – Single disk buffered throughput

|
Figure 13 – Single disk buffered throughput
|
bet | 22/47 | Sana | 30.03.2021 | Hajmi | 1,33 Mb. | | #13789 |
Figure 13 – Single disk buffered throughput. Basic and dynamic volumes show similar performance for buffered reads and writes. Buffered reads improve throughput for small read and write requests. Unlike unbuffered 4KB, and 8KB requests, buffered requests at those same sizes run at disk speed. 2KB write requests are the only exception to this: they require a 4KB read before each 2KB write. Buffered writes without WCE plateau at 10MBps. This is the same write plateau seen for unbuffered writes, however the plateau is earlier. This is because buffered writes smaller than 64KB are coalesced into 64KB blocks before they are written to disk. As we will show later, at 64KB requests and above, writes without WCE see a throughput ceiling of 10MBps due to the disk. The left graph’s dip in read performance at requests sizes larger than 64KB is due to a performance bug. Win2K does not contain this bug which is why the Win2K graphs show no such dip in their read throughputs.
Buffered request processor overheads in Figure 14 show similar overhead between basic and dynamic volumes with read and write requests showing similar overheads. Due to read-ahead and lazy writes, much of the actual request overhead was not being charged to our process. Instead, it was only being charged for the buffer copy. GetProcessTimes() therefore can significantly under-report the actual cost per request. 2KB write requests for both dmio and ftdisk can cost more than twice the processor time of larger requests. This is due to the extra read and merge that must take place for such small requests. Total processor cost equals fixed request cost plus the marginal cost per byte times the number of bytes per request. Since the overhead is the same per megabyte across all requests other than 2KB writes, this implies that the fixed overhead for each request is negligible while the marginal cost per byte dominates. On our machine, the fixed cost for both dynamic and basic volumes was 12s. The marginal cost for dynamic volumes was 7s per KB read and written while the marginal cost for basic volumes was 6s per KB read and 7s for each KB written.
In Windows 2000, writes still show a significant penalty for small 2KB requests, but the drop in overhead is much more drastic compared to NT4SP3 (see Figure 5). There is no significant penalty for small requests except for 2KB writes which must do a read before each write.
|
| |
DMA
  
PIO - Windows 2000 Disk io performance Leonard Chung

Windows 2000 Disk io performance Leonard Chung
|
bet | 10/47 |
Sana | 30.03.2021 |
Hajmi | 1,33 Mb. |
| #13789 |
|
Table 7– DMA vs. PIO – 64KB unbuffered reads. DMA delivers greater throughput with less CPU utilization. DMA needs to be enabled for good performance. Since IDE RAID cards masquerade as SCSI controllers, they don’t require the user to specify DMA or PIO.
|
This section examines how these measurements were done along with issues we encountered.
Throughput measurement
SQLIO served as the primary test program for our measurements.
SQLIO is a workload generation and measurement tool that allows the user to specify for how long a file should be read or written and various parameters about how the IO should be done. Along
with measuring throughputs,
SQLIO outputs system and kernel timing information.
SQLIO is used by Microsoft’s NT Performance Group for their tests.
sqlio2 is a complete rewrite of
SQLIO. Among its features are the ability to plug in IO “personalities” which are modules specifying different
ways of doing disk IO, a cleaner code base, and more flexible test parameter specification and result output.
In order to ensure
the uniformity of results, each disk was first formatted before test files were copied to the disk in the same order. This made certain that our tests were always run from the same outer tracks on each disk, reducing the problem of media banding and maximizing test results.
We also scrubbed the file system cache between buffered runs in order to ensure our requests were going to disk instead of cache.
Unless otherwise noted,
SQLIO was used to generate all of the results in this paper except for buffered tests.
SQLIO was found to underreport the throughput of buffered reads during testing so
cacheflush was used for all buffered measurements.
SQLIO was modified to generate a trace file that is easily imported to an Excel spreadsheet or relational database. The format of the trace file is a comma-separated list where each line has the format:
Figure 2 – Read throughput variation across the Quantum Atlas 10K surface

|
Figure 2 – Read throughput variation across the Quantum Atlas 10K surface
|
bet | 13/47 | Sana | 30.03.2021 | Hajmi | 1,33 Mb. | | #13789 |
Figure 2 – Read throughput variation across the Quantum Atlas 10K surface. The read throughput on the inner band of the media is significantly less than the outer band. The inner band on the Atlas 10K has 35% less throughput than on the outer band. Measurements taken on the Fireball lct08 showed its inner band had 40% less throughput than on its outer band.
Zoned Disk and Variable Media Rates
Modern disks are zoned: tracks have a variable number of sectors and therefore a variable size rather than a fixed size. Each track’s size is a function of its circumference. Since tracks on the outer edge of the media have a larger circumference than tracks on the inner edge, outer tracks have more bits traveling under the disk head per second than inner tracks due to the disk’s constant angular velocity. The Ziff Davis WinBench 99 was used to generate Figure 2 that shows a throughput map of the disk as the head is moved from the outer to the inner tracks [ZD]. The stair stepping is due to banding on the media. Each band has the same number of sectors per track. Within each band, the throughput remains the same. From band to band however, the sectors per track changes, resulting in a sudden change in throughput. Figure 2 also shows that there is considerable variance among read speeds ranging 10%.
|
| |
Figure 7 – Asynchronous throughput using no file system buffering: NT4SP6 vs. NT4SP3

|
Figure 7 – Asynchronous throughput using no file system buffering: NT4SP6 vs. NT4SP3
|
bet | 16/47 | Sana | 30.03.2021 | Hajmi | 1,33 Mb. | | #13789 |
Figure 7 – Asynchronous throughput using no file system buffering: NT4SP6 vs. NT4SP3. Read and WCE write throughput for small requests has improved in SP6 as 2KB and 4KB requests now generate the same throughput as larger request sizes. The right graphs show a higher peak throughput as they were using faster SCSI drives. Unbuffered writes were measured on a ST34572 drive instead of our ST34371. The lower unbuffered write throughput we were able to achieve on NT4SP6 is likely due to differences in the drives under test, rather than due to differences between NT4SP3 and NT4SP6.
| Depths beyond four showed no additional throughput gains. Writes of three deep and beyond reach the same performance as WCE at 32KB requests.
|
| |
Overhead Measurement - Windows 2000 Disk io performance Leonard Chung

|
Windows 2000 Disk io performance Leonard Chung
|
bet | 12/47 | Sana | 30.03.2021 | Hajmi | 1,33 Mb. | | #13789 |
The Win32 API has a function called GetProcessTimes() which extracts timing information from a process. The user time and kernel time consumed by a process are among the information it returns. We originally used GetProcessTimes() as our only overhead measurement. However, it became clear that GetProcessTimes() often understated the actual processor cost that was being incurred, because GetProcessTimes() only returns the processor cost which was charged to that process. Measuring the cost per IO is complicated by the fact that not all of the processor time used is charged to processes. During certain situations, such as interrupt time, processor cycles aren’t charged to any process. Those cycles are unaccounted for by GetProcessTimes(). Measurements taken with GetProcessTimes() are the lower bound of the range of actual CPU overhead.
To get the upper bound, we measured system idle time. We measured idle time by using a soaker: a thread or set of threads running at idle priority that are set in a busy loop. They try to consume all available idle cycles, effectively becoming the idle process. By first measuring the soaker’s processor time while the system is idle, then measuring the soaker’s processor time while running a test, and finally calculating the delta, we can subtract out the background processor overhead and find the processor time being consumed by IO generation and the previously unaccounted processor time associated with the IO requests. Since the soaker looks only at total system idle time rather than processor consumption by individual processes, the soaker does not return results for a single process alone, but may include processor time used by other applications. The overhead reported by the soaker is the upper bound on CPU overhead. Unless otherwise noted, all of the overhead graphs shown are taken using a soaker.
At small request sizes, the upper bound can show a significant difference in the measured overhead from the lower bound. However, at larger request sizes these upper and lower bounds generally converge.
|
| |
GDI Improvements: Béziers, Paths, Transforms, Device-Independent Color

GDI Improvements: Béziers, Paths, Transforms, Device-Independent Color
GDI, the drawing API for Windows Versions 3.0 and 3.1, provides a useful device-independent drawing set for applications. As output devices have become more sophisticated, so have drawing needs; hence GDI has been improved.
Some Windows applications for Versions 3.0 and 3.1 have needed to implement high-level graphics functions using the low-level drawing primitives of the Windows environment. Although this capability has provided application vendors flexibility in extending the Windows GDI, it has not allowed them to take seamless advantage of advances in printer and display technology. Application developers have had to code their own algorithms for displaying graphics such as Bézier curves and paths. With the Windows 32-Bit API, developers can call new high-level graphics features that will take advantage of the built-in drawing capabilities in advanced output hardware. Under Windows 32, displaying Bézier curves can be handled by the graphics engine or by output devices that have implemented Bézier optimizations.
The Windows 32 GDI is a complete and general-purpose drawing package. Bézier curves are a general-purpose curve primitive from which a straight line can also be derived. This function combined with the PolyBézier functionality makes it possible to draw any combination of continuous lines and curves.
Windows 32 adds a Path API. A BeginPath EndPath sequence “closes” the sequence of drawing primitives between Begin and End. Thus, a BeginPath, PolyPolyBézier, EndPath sequence makes it possible to draw an arbitrary number of different filled shapes.
The Windows 32 transform API maps the virtual two-dimensional surface on which you draw to the two-dimensional output surface. This API, combined with the TrueType font technology first available with Windows Version 3.1, makes it possible to draw truly device-independent graphics that the system can map to the display surface, including the rotation of bitmaps, fonts, and metafiles.
Windows 32 will also provide a device-independent color model. Computer monitors and color printers use different technology to render colors. Additive mixing is used by computer monitors (RGB or Red, Green, Blue), while subtractive mixing (CYMK or Cyan, Yellow, Magenta, Black) is used by color printers. Without device-independent color, the different approach used by monitors and printers can result in mismatched colors.
|
The Windows Architecture - Since its original release in 1985, Microsoft

The Windows Architecture
Since the IBM PC was introduced in 1981, personal computers have become much more diverse in capability and in configuration. This diversity will increase in the next few years as personal computers based on RISC processors and multiprocessor systems are introduced.
These diverse systems have different operating system needs. For example, a low-end battery-operated portable requires minimal memory and hard disk footprint to minimize weight and cost. It also requires power management to extend battery life. In contrast, network servers and mission-critical desktops require sophisticated security to ensure the integrity of data. RISC-based systems require portability for both the operating system and the applications.
Some vendors feel that the diverse range of hardware requires totally different operating systems with incompatible applications. They sell different operating systems for personal computers, workstations, servers, and in the future, pen-based systems. Each of their operating systems require unique, incompatible applications. Connectivity between these divergent platforms is complicated.
Microsoft is focused on a much simpler solution. We’re extending Windows into multiple, fully compatible implementations. Different implementations of Windows will be optimized for different classes of hardware. Customer investment in Windows development and Windows applications will be protected. Windows applications will run across the spectrum of hardware, from notepad-sized pen systems, to mission-critical desktops, to multiprocessor and RISC based systems.
Microsoft Windows is evolving into a complete operating system architecture. The Windows architecture addresses diverse requirements by supporting different modes of operation. Today Windows has three modes: Real-mode, Standard-mode, and Enhanced-mode. Real-mode provides compatibility with previous versions of Microsoft Windows. Standard-mode is optimized for an 80286 processor and provides access to the full 16 MB of memory supported by that chip. Enhanced-mode takes advantage of the 80386 and 80486 processors by providing support for multiple DOS applications and thru a technique called demand paging, provides applications with access to more memory then is physically present in the machine. All three modes support both DOS and Windows applications.
Building upon the success of Microsoft Windows Version 3.0, Microsoft will introduce Version 3.1 in late 1991. Version 3.1 incorporates significant customer feedback; it improves performance, introduces a newly designed file manager, improves network connectivity, and improves system reliability. Version 3.1 will support Windows Standard-mode and Enhanced-mode.
Also during 1991, Microsoft will enhance Windows Standard-mode and Enhanced-mode by providing extensions for sound, animation, and CD-ROM access, called Windows with Multimedia. We will also release extensions for clipboard and pen-style computing, called Microsoft Windows for Pen Computing.
|
Windows NT - Since its original release in 1985, Microsoft

Windows NT
In 1992, Microsoft will introduce a new product called Windows NT (New Technology). Windows NT is built on a modern, 32-bit, operating system kernel. Windows NT will deliver an extremely robust client environment for mission-critical applications, a high-end desktop platform, and a portable, scalable server environment (See Figure 3). Windows NT will also transform Windows into a Microsoft LAN Manager server platform, thus adding a fourth server platform to the three currently supported by LAN Manager: OS/2®, UNIX, and VMS®.
Windows NT does not require DOS to function. However, it is compatible with the large installed base of DOS and Windows applications. In addition to compatibility with existing applications, Windows NT includes the features required to meet the needs of the high-end desktop and server marketplace in the 1990s and beyond.
To support large server applications, Windows NT provides completely symmetric multiprocessor support. With Windows NT, tasks are symmetrically distributed between processors on a per thread basis. This design provides maximum utilization of each processor in a multiprocessor system and simplifies the development of multiprocessor applications.
Security is required for network servers and many mission-critical applications. To meet this need, Windows NT has been designed as a secure operating system. Microsoft is working with the U.S. Government to certify Windows NT as C2-level secure. In addition, the internal design of Windows NT can be enhanced in future releases to B-level security.
Windows NT is highly portable. It is being developed concurrently on x86 and MIPS-based RISC platforms. MIPS-based computers will be available from more than 60 hardware manufacturers who are members of the ACE (Advanced Computing Environment) consortium. With Windows NT, existing DOS and Windows programs will run unchanged on MIPS-based computers.
In addition to these advanced capabilities, the kernel-based design of Windows NT can be thought of as a nucleus which is compatible with different operating system environments. The kernel design provides Windows NT compatibility with DOS and Windows applications. It also allows Windows NT to support the OS/2 and POSIX application program interfaces, both of which are under development at Microsoft. This design also allows Windows NT to support applications written to the new Windows 32-Bit application program interface.
|
Quyidagi so‘rovda s belgisi nimani anglatadi: SELECT * FROM STUDENT s; 
*jadval nomini qayta nomlash 
120

|
Quyidagi so‘rovda s belgisi nimani anglatadi: SELECT * FROM STUDENT s;
*jadval nomini qayta nomlash
120
|
bet | 8/45 | Sana | 07.01.2024 | Hajmi | 109,51 Kb. | | #131376 |
Bog'liq Savollar Javoblar (2)119. Quyidagi so‘rovda s belgisi nimani anglatadi: SELECT * FROM STUDENT s;
*jadval nomini qayta nomlash
120. Quyidagi so‘rovda STUDENT nimani anglatadi: SELECT * FROM STUDENT s;
*jadval nomi
121. Qidiruv so‘rovlarini tezlashtirish uchun qaysi MBBT mexanizmi ishlatiladi
*indekslar
122. Keltirilgan qaysi MBBT tekin GNU lisenziyasi bilan tarqatiladi
*MySQL
123. CREATE TABLE jadval yaratish operatorida NULL nimani anglatadi?
*Ustinda qiymat bermaslikka ruxsat berishni
124. CREATE TABLE jadval yaratish operatorida NOT NULL cheklagichi nimani anglatadi?
*Ustunga tegishli bo‘lgan satr qiymatlari bo‘sh
bo‘lmasligini
125. So‘rovlarda qanday elementlarga psevdonim belgilash mumkin
*Jadval va qatorlarga
126. Qaysi korxona relyatsion MBBT yaratish bilan shug‘ullanmaydi
*GOOGLE
127. SELECT operatorini vazifasi?
*Jadvaldan ma’lumotlarni tanlash
128. UPDATE operatorini vazifasi?
*Jadvalda qatorni o‘zgartirish
129. DELETE operatorini vazifasi?
*Qatorni o‘chirish
130. INSERT operatorini vazifasi?
*Jadvalga satr qo‘shish
131. Bitta so`rovning ichida joylashgan ikkinchi so‘rov qanday nomlanadi, misol: SELECT * FROM
STUDENT WHERE group_id IN (SELECT id FROM group WHERE number‘217-15’)
*quyi so‘rov
132. Quyidagi savol qanday javob qaytaradi SELECT * FROM
students s FULL JOIN Groups g ON s.group_id g.id
* NULL qiymatiga ega bo‘lmagan s.group_id g.id tengligi orqali bog‘lanadigan
groups va students jadvalidagi barcha qatorlarni chiqaradi
133. Qaysi korxona relyatsion MBBT yaratish bozorida yetakchi xisoblanadi
*ORACLE
134. Qaysi peredikat saralash uchun ishlatiladi?
ORDER BY
135. Qaysi peredikat guruhlash uchun ishlatiladi?
*GROUP BY
|
| |
Tushuncha qanday ma’lumotlar modeliga tegishli? 
*relyatsion 
64

|
Tushuncha qanday ma’lumotlar modeliga tegishli?
*relyatsion
64
|
bet | 5/45 | Sana | 07.01.2024 | Hajmi | 109,51 Kb. | | #131376 |
Bog'liq Savollar Javoblar (2)63.
Tushuncha qanday ma’lumotlar modeliga tegishli?
*relyatsion
64.
Domen bu ....?
* ustun
65.
Nuqtalar o‘rniga to‘g‘ri keladigan so‘zni ko‘rsating. ……….ustunlar to‘plami berilgan
qatorlar guruhidir
* Jadval
66.
Katakcha massiv shaklidagi qiymatni qabul qiladimi
*yo‘q
67.
Jadval ma’lumot kaliti bu ....
* Jadval ma’lumotlar yig‘indisi bo‘lib, uning har bir
qatorini aniqlaydi
68.
Realyatsion ma’lumotlar bazasida ma’lumotlarni saqlashning asosiy formasi
*Jadval
69.
Realyatsion maydonda mohiyat aloqa diagrammasini o‘zgartirganda atribut nimaga
o‘zgaradi?
*atributga
70.
Unikal identifikator nima
* Bir qatorni boshqa qatordan ajratib turadigan
qiymatga ega ustun
71.
Jadvalning har xil qatorlari bir xil qiymatdagi kalitga ega bo‘ladimi?
*Yo‘q
72.
Qator bu?
* yozuv, kortej, ekzempleyar,borliq
73.
Realyatsion maydonda mohiyat aloqa diagrammasini o‘zgartirganda mohiyat nimaga
o‘zgaradi?
* jadvalga
74.
Unikal maydon deb qanday qatorga aytiladi
* qiymati qaytarilmaydigan maydon
75.
Ustun bu?
*maydon, atribut
76.
Qaysi MBBT da ustun va maydonning kema-ketligi ahamiyatsiz?
*realyatsionda
77.
Realyatsion algebrada qanday operatsiya turlari mavjud
*An’anaviy va noan’anaviy
78.
(A UNION V) UNION S ≡ A UNION (V UNION S)
* Assoativ xususiyati
79.
A UNION B ≡ V UNION A
*Kommunikativ xususiyat
80.
Jadval ma’lumotlar strukturasi qanday aniqlanadi?
* jadval ustunlari nomlanishi bilan
81.
Noan’anaviy realyatsion operatsiyalar
* Bog‘lanish, tanlash, proeksiya, bo‘lish
|
| |
Windows 32-Bit API - Since its original release in 1985, Microsoft

Windows 32-Bit API
Developers and end-users have made enormous investments in Windows programming and Windows applications. Most of these applications have been developed to run on both the 16-bit 80286 processor and the 32-bit 80386 and 80486 systems. Although highly capable, programs written to the Windows 16-Bit API, which is supported by Windows 3.0, are constrained by the memory limits inherent in a 16-bit architecture. Code must be divided into segments which cannot exceed 64K (65,536 bytes). This makes programming more difficult. It also imposes a performance penalty on high-performance 80486 and RISC-based systems.
The success of Windows Version 3.0, made it clear that an easy migration path from existing 16-bit Windows applications to a 32-bit programming interface was required. Unfortunately, OS/2 Presentation ManagerTM (PM) was not an appropriate path. Although similar in appearance from an end-user perspective, the programming details of Windows and PM are completely different. So different in fact that most software developers found it necessary to completely rewrite their application when going from Windows to Presentation Manager. This is a major reason why there are so few OS/2 PM applications available.
The Windows 32-Bit API (Windows 32) has been designed to make the transition from the Windows 16-Bit API (Windows 16) to 32-bit as easy as possible. Only minimal changes have been made to the syntax of the Windows 32 API. The API names are the same as Windows 16. The semantics are identical. The message order is identical. In fact, it is possible to keep a single source code base and compile that source code into both 16-bit and 32-bit programs (see Figure 4).
While the Windows 32 API is extremely compatible with the Windows-16 API, it also contains significant new features. These features include preemptive multitasked processes that use separate address spaces, preemptive threads, semaphores, shared memory, named pipes, mailslots, and memory mapped file I/O. GDI (Graphics Device Interface) improvements include Bézier curves, paths, transforms, and a device-independent color model.
The Windows 32-Bit API is fully supported in both Windows Enhanced-mode and Windows NT-mode. The Windows 32-Bit API will first be available in the Windows NT product during 1992. It will be added to Windows Enhanced-mode in late 1992 or early 1993. Programs written to the Windows 32-Bit API will run binary compatibly on both Windows NT-mode and Windows Enhanced-mode. All Windows 32 features are supported by both Windows Enhanced-mode and Windows NT-mode, including preemptive multitasking. Windows 32 programs will be fully source compatible between x86 and MIPS processors. Software Developer Kits for the Windows 32-Bit API will be available in late 1991.
The following highlights some key features of the Windows 32-Bit API.
|
Windows 2000 vs. NT4 - Windows 2000 Disk io performance Leonard Chung

|
Windows 2000 Disk io performance Leonard Chung
|
bet | 17/47 | Sana | 30.03.2021 | Hajmi | 1,33 Mb. | | #13789 |
Windows 2000 vs. NT4
Now we contrast Windows 2000 on “old” hardware with NT4 on “old” hardware. As Figure 8 indicates, peak sequential I/O performance under Windows 2000 is virtually identical to that of NT4SP6. Read and write performance, and their associated overheads, are the same as NT4SP6. This holds true with both basic and dynamic volumes. Just as in NT4SP6, the buffered read performance bug for requests above 64KB is gone.
Windows 2000 NTFS unbuffered write throughput is comparable to NT4SP6. Like NT4SP6, increased write depth increases throughput up to four deep writes. Beyond that, the device is saturated, and additional outstanding requests do not increase throughput.
Figure 8 – Windows 2000 Advanced Server buffered and unbuffered throughput on a Basic volume. These graphs are show the sequential I/O performance attained using basic volumes under Win2K. Win2K is shown as having an almost identical performance to NT4SP6. Differences in buffered write performance are due to drive banding. Buffered reads under Win2K don’t show a dip at 128KB and above as the performance bug which caused the dip in NT4SP3 buffered reads doesn’t exist in Win2K.
T
|
| |
Windows 32-bit APIs—The Future of Windows

Windows 32-bit APIs—The Future of Windows
Millions of people are actively using Windows Version 3.0 today. Corporations and independent software vendors are making major commitments to Windows and investments in Windows applications.
To protect this investment, Microsoft is evolving Windows into a complete architecture. Through separate implementations, Microsoft Windows will run on vastly different types of hardware; from pen-based notepad computers to multiprocessor and RISC systems.
Windows NT and future versions of Windows Enhanced-mode will support the Windows 32-Bit APIs. Designed to simplify migration of Windows applications from 16-bit to 32-bit, these APIs will also make it easy to develop new 32-bit Windows applications. They contain significant new features which will enable a new generation of powerful Windows applications.
In addition, the Windows 32-Bit APIs will be used as the foundation for future versions of Windows under development at Microsoft. This technology, often called Information at Your FingertipsTM, will make it even easier to use personal computers and will provide significant new functionality to Windows users.
Microsoft and MS-DOS are registered trademarks,Windows and Information at Your Fingertips are trademarks of Microsoft Corporation.
OS/2 is a registered trademark and Presentation Manager is a trademark licensed to Microsoft.
IBM is a registered trademark of International Business Machines.
VMS is a registered trademark of Digital Equipment Corporation.
|
Compatibility with Windows 16-Bit APIs

Compatibility with Windows 16-Bit APIs
Windows Version 3.0 and 3.1 applications will be able to run in Windows Enhanced-mode and Windows NT-mode systems that support the Windows 32 API. To be compatible with versions 3.0 and 3.1, all Windows 16 applications will run as one process in one address space. They will be nonpreemptive with respect to one another but preemptive with respect to the rest of the system, which mirrors their behavior under Windows Version 3.0 Enhanced-mode. Windows 16 applications run against the Windows 32-Bit APIs without a “layer” and without any state mapping or message reordering like that necessary to run them on OS/2 version 2.0.
Windows executables will also run on RISC-based Windows NT machines (see Figure 5). Excellent performance is expected on this platform because although some code will be run against 80286 emulator technology, all Windows calls will be mapped directly to the Windows NT software.
|
Kernel: The Base Operating System

Kernel: The Base Operating System
The Windows 32-Bit API on both Window NT-mode and Windows Enhanced-mode provides preemptive thread-based multitasking. It also runs all Windows 32-Bit and MS-DOS applications in separate address spaces so that they cannot corrupt one another.
The Windows 32-Bit API is designed to be portable beyond the 80386 and 80486 processors and in particular to be portable to RISC architectures. All these processors have different features but have in common 32-bit addressing and paged virtual memory architectures. Paged virtual memory is more efficient to implement and executes faster than segmented virtual memory. Memory management in Windows 32-Bit is secure because the operating system places different memory objects in different pages of memory and allows an application to control access permissions (Read, Write, Read/Write, Execute, and so on) to memory objects.
Given a large 32-bit address space, the operating system can conveniently and efficiently optimize file I/O because processes treat the file as a very large memory object and randomly access that object. The operating system, through page faulting, can detect read access to a file and bring in that data. It can detect when a shared file is written to and then write out that data. With process-settable access permissions and sparse allocation of physical memory pages, processes can implement very efficient data access, even when access patterns are entirely unpredictable.
|
Networking Extensions - Since its original release in 1985, Microsoft

Networking Extensions
Each time the APIs are further standardized in a particular area, it becomes easier to write significant new applications. Because of the variety of networking layers, ranging from network card interfaces and protocol stacks to the wide array of network IPC mechanisms, networking is probably the most confusing interface for developers today. Windows 32 will include standard network APIs that can replace those that network providers have previously needed to supply. Windows 32 will expose driver-style interfaces similar to the WinNet APIs provided by Windows Version 3.0 so that third-party vendors can plug their network services into the Windows open architecture.
Some of the new, 32-bit WinNet APIs being defined are file, print, named pipes, mailslots, server browsing and machine configuration. This means applications can rely on a consistent programming interface regardless of the underlying network. Even if a network is not present, the APIs are still available and will return appropriate error codes.
The Windows 32-Bit API includes peer-to-peer named pipes, mailslots, and APIs to enable RPC (Remote Procedure Call) compilers. With Windows 32, a mail-server vendor can build a messaging service on named pipes and asynchrononous communication that will run on top of any network operating system, protocol stack, or network card — each of which could come from a different network vendor.
|
Mavzu: Murakkab foizlar, masalalar yechish.
Mustaqil ish: 1 soat

|
Mavzu: Murakkab foizlar, masalalar yechish.
Mustaqil ish: 1 soat
|
bet | 4/69 | Sana | 15.12.2023 | Hajmi | 18,04 Mb. | | #119823 |
Bog'liq 1-kurs Matematika to\'plam tayyorBu sahifa navigatsiya:
- Mavzu
Mavzu: Murakkab foizlar, masalalar yechish.
Mustaqil ish: 1 soat
|
NA
|
2
|
amaliy vaziyatlarda ro‘y beradigan ayrim hodisalar va jarayonlarning, modellarini qura oladi va tahlil qila oladi.
|
sodda foizlar, murakkab foizlarga oid masalalarni yechib beradi;
|
sodda foizlar, murakkab foizlar
|
o‘rganilgan matematik tushunchalar, faktlar va algoritmlarni nostandart
vaziyatlarda qo‘llay oladi va yangi bilimlar hosil qila oladi
|
9
|
Mavzu: Sodda ratsional tenglamalar.
|
NA
|
2
|
Sodda ratsional tenglamalar va ularning sistemalari
|
Ratsional tenglamalarga, teng kuchli tenglamalarga ta'rif beradi, teng kuchli tenglamalar sistemasiga misol keltiradi
|
Sodda ratsional tenglamalar , teng kuchli tenglamalar
|
Sodda ratsional tenglamalar , teng kuchli tenglamalar
|
10
|
Mavzu: Ratsional tenglamalar sistemalari
Mustaqil ish: 2 soat
|
NA
|
2
|
Sodda ratsional tenglamalar va ularning sistemalari
|
Ratsional tenglamalarga, teng kuchli tenglamalarga ta'rif beradi, teng kuchli tenglamalar sistemasiga misol keltiradi
|
Sodda ratsional tenglamalar , teng kuchli tenglamalar
|
Sodda ratsional tenglamalar , teng kuchli tenglamalar
|
11
|
Mavzu: Sodda irratsional tenglamalar
|
NA
|
2
|
Sodda irratsional tenglamalar va ularning sistemalari
|
irratsional tenglamalarga, teng kuchli irratsional tenglamalarga ta'rif beradi, teng kuchli irratsional tenglamalar sistemasiga misol keltiradi
|
Sodda irratsional tenglamalar , teng kuchli irratsional tenglamalar
|
Sodda irratsional tenglamalar , teng kuchli irratsional tenglamalar
|
12
|
Mavzu: Irratsional tenglamalar sistemalari.
|
NA
|
2
|
Sodda irratsional tenglamalar va ularning sistemalari
|
irratsional tenglamalarga, teng kuchli irratsional tenglamalarga ta'rif beradi, teng kuchli irratsional tenglamalar sistemasiga misol keltiradi
|
Sodda irratsional tenglamalar , teng kuchli irratsional tenglamalar
|
Sodda irratsional tenglamalar , teng kuchli irratsional tenglamalar
|
13
|
|
|
| |
Moxiyat-aloqa modelining asosiy tushunchalari 
atribut, jadval, aloqa 
46

3
49.
Talaba va guruh ob’ektlari orasidagi aloqa modelini aniqlang
*n:1
50.
Shahar va viloyat ob’ektlari orasidagialoqa modelini aniqlang
* 1: m
51.
Moxiyat-aloqa modelini kim taklif qilgan
*Piter Chen
52.
Talaba va auditoriya ob’ektlari orasidagi munosabat turini aniqlang
*n:m
53.
FIO (o‘qituvchi, kafedra) Guruh (Guruh,fan,FISh) va o‘qituvchi
(NO_o‘qituvchi,FIO_o‘qituvchi kafedra) jadvallar orasida munosobatlar qanday
* m : n
54.
Relyatsion modeldan keyin qanday ma’lumotlar bazasi vujudga keladi
*assotsiativ
55.
Daraxt ko‘rinishida qaysi ma’lumotlar bazasi tasvirlanadi?
*ierarxik
56.
Ma’lumotlar bazasini boshqarishda avval ma’lumotlar bilan ishlashning qanday prinsiplari
mavjud bo‘lgan?
*Pastki darajada tashqi xotira ma’lumotlarini
boshqarish
57.
Relyatsion nazariyada quyidagilardan qaysi biri ta’luqli emas?
*Piter Chen
58.
Ma’lumotlar bazasiga tegishli tushunchani aniqlang?
*mavjudlik
59.
Kortrej bu ....?
* qator
60.
Edigan Kod kim bo‘lgan?
*matematik
61.
Munosobat nima?
*jadval
62.
Relyatsion bazaga o‘xshash juda bo‘lgan analogini ko‘rsating?
*ikki o‘lchamli jadval
Relyatsion ma’lumotlar bazasining asosiy tushunchalari aniqlang? 
*Jadval, maydon, yozuv 
32

|
Relyatsion ma’lumotlar bazasining asosiy tushunchalari aniqlang?
*Jadval, maydon, yozuv
32
|
bet | 3/45 | Sana | 07.01.2024 | Hajmi | 109,51 Kb. | | #131376 |
Bog'liq Savollar Javoblar (2)31.
Relyatsion ma’lumotlar bazasining asosiy tushunchalari aniqlang?
*Jadval, maydon, yozuv
32.
SQL tilining alfavitida nechata harf bor ?
*27
33.
Relyatsion ma’lumotlar bazasi bu
*munosabatlarning majmuasi yoki ikkilik jadvallari
34.
Ob’ektlar xolatini aks ettiruvchi va ko`rilayotgan predmet sohasida ular orasidagi
munosabatlarni nomlangan ma’lumotlar to`plami........ deb ataladi.
*ma’lumotlar bazalari
35.
Markazlashtirilgan to`plam va ma’lumotlardan jamoaviy foydalanish zarur bo`lgan
dasturiy, til, tashkiliy va texnik vositalar tizimi ........deb ataladi.
*ma’lumotlar banki
36.
Amaliy masalalar uchun avtomatlashtirilgan ishlov berishni ta’minlovchi dastur yoki
dasturlar kompleksiga .............deyiladi.
*MBBT
37.
Ma’lumotlarni taqdim etishning relyatsion modeli: foydalanuvchiga ma’lumotlar qaysi
ko‘rinishda uzatiladi
*jadvallar
38.
Ma’lumotlar bazalarini muvoffaqiyatli amal qilishining zaruriy sharti bu…dir.
*yaxlitlikni ta’minlash
39.
Tezkorlik va xotira sarfi ko`rsatkichlari bo`yicha samarali ish olib borish imkoniyati
bu......yutug’idir.
*tarmoq modellari
40.
Ma’lumotlarni taqdim etish modeli nima
*Malumotlar bazasida saqlanuvchi ma’lumotlar
mantiqiy strukturasi
41.
.Qo`llanish tavsifiga ko`ra MBBTlar qanday turlarga bo`linadi?
*shaxsiy va ko`p foydalanuvchilar
42.
Ma’lumotlarni taqdim etishning tarmoq modeli: ma’lumotlar nima orqali taqdim etilgan
* ixtiyoriy graf
43.
Ma’lumotlarni taqdim etish modelining qaysi biri eng keng tarqalgan xisoblanadi
ob’ektga yo‘naltirilgan
44.
Ma’lumotlarni taqdim etishning ierarxik modeli: ma’lumotlar nima orqali taqdim etilgan
*daraxt turidagi graf
|
| |
3 NFga o`tishdan oldin albatta qaysi normal formaga bo`lishi shart 
* 2 NF 
102

4
103. Qaysi bir MBBT klient-server turiga kirmaydi
*ACCESS
104. TRUE va FALSE Qiymatini qabul qiluvchi toifalar qanday nomlanadi?
*Bul tipli
105. Butun toifa ko`rsating
*NUMERIC
106. NOT, AND, OR operatorlari vazifasi nimadan iborat?
*Mantiqiy amallar
107. Jadvaldagi ustunga qo‘yilgan qanday cheklanish ustun qiymatlarining yagonaligini ta’minlaydi
*UNIQUE
108. Jadvaldagi ustunga qo‘yilgan qanday cheklanish ustun qiymatlarini bog‘langan jadvaldagi birlamchi kalit qiymatlaridan oladi
*FORGN KEY
109. NOW() funksiyasining vazifasini ko`rsating
*Joriy sana va vaqtni ko`rsatadi
110. DATE() funksiyasini vazifasini tanlang
*Joriy sanani ko`rsatadi
111. MAX() agregat funksiyasining vazifasini ayting
*Belgilangan ustunning eng katta qiyati
112. MIN() agregat funksiyasining vazifasini ayting
*Belgilangan ustunning eng kichik qiyati
113. AVG() agregat funksiyasining vazifasini ayting
*Belgilangan ustunning o`rta arifmetigi
114. COUNT() agregat funksiyasining vazifasini ayting
*Belgilangan obyektning qatorlar soni
115. CREATE operatori vazifasi?
* Ma’lumotlar bazasidan obekt yaratish
116. ALTER operatori vazifasi?
* Ma’lumotlar bazasidan obektni o‘zgartirish
117. DROP operatori vazifasi?
*Ma’lumotlar bazasidan obektni o‘chirish
118. Agar siz ustun rezultat qaytaruvchi jadvalga kirishni xohlasnagiz qanaqa kalit so‘zdan
so‘ng SQL so‘rovi ko‘rsatilishi kerak?
*SELECT
Nuqtalar o'rnini to'ldiring: DDL - … ?

Nuqtalar o'rnini to'ldiring: DDL - … ?
702. d. Mа’lumоtlаrni Tаvsiflash Tili
703.
SQLdа quyidagi javoblardan tаrtiblаsh spetsifikаtоri kiritish formati aniqlang.
704. a. ORDER BY tаrtiblаsh spetsifikаtоri
705.
SQLdа AVG ( ifоdа ) DISTINCT ustun nоmi formatining vazifasi
706. a. AVG() – Ustundаgi hamma qiymаtlаr o'rtаsi qiymаtini hisoblаydi.
707.
SQLdа mаssiv qanday tаrtibdа аmаlgа оshirilаdi?
708. a. Indeksi bo`icha
709.
Mахsus kоmаndа оrqаli аniqlаnuvchi fоrmаtdаgi pul.
710. b. MONEY
711.
SQLdа ………….. sinfi nаtijаviy to'plаm mа’lumоtlаrigа hamdа shu nаtijаviy to'plаm bilаn bоg'liq metа mа’lumоtlаrgа murоjааtni
tа’minlаydi.
712. c. Result
713.
SQL tilidagi ALTER TABLE ADD ; kommandasining vazifasini aniqlang.
714. d. Jаdvаlgа ustun qo'shish uchun kоmаndаning tipik sintаksisi
715.
Haqiqiy sonlarni saqlash uchun qaysi tipdagi maydondan foydalanish kerak?
716. c. Sonli (Числовой)
717.
SQLdа MAX() – Ustundаgi hamma qiymаtlаr eng kаttаsini аniqlаydigan formatni to`g`risini toping.
718. d. MAX ( ifоdа )
719.
IN operatorining vazifasini aniqlang.
720. a. Tanlov asosida boshqa ma`lumotlarga mos bo'lgan ma`lumotlarni yigishga imkon beradi.
721. b. Yangi shaklni qo'shadi.
722. c. Loyixani almashtiradi.
723.
Nuqtalar o'rnini to'ldiring: DML - … ?
724. a. Mа’lumоtlаrni O'zgаrtirish Tili
725.
Yil tipidagi ma`lumotlarni saqlash uchun sonli maydonning quyidagi turi yetarli:
726. a. Bayt;
727. b. Butun;
728. d. Haqiqiy;
729.
SQLdа SUM ( ifоdа ) DISTINCT ustun nоmi formatining vazifasi
730. a. SUM() – Ustundаgi hamma qiymаtlаr summаsini hisoblаydi.
731.
SQLdа HAVING ifоdаsidаn guruхlаrni qаytаrish shаrti yozilаdi vа ………..bilаn birgа ishlаtilаdi.
732. d. GROUP BY
http://fayllar.org
Realyatsion ma’lumotlar bazasida qaysi so‘rovtillari qo‘llaniladi 
*SQL 
83

|
Realyatsion ma’lumotlar bazasida qaysi so‘rovtillari qo‘llaniladi
*SQL
83
|
bet | 6/45 | Sana | 07.01.2024 | Hajmi | 109,51 Kb. | | #131376 |
Bog'liq Savollar Javoblar (2)82.
Realyatsion ma’lumotlar bazasida qaysi so‘rovtillari qo‘llaniladi
*SQL
83.
Ma’lumotlar bazasi jadvali nima uchun kerak:
*ma’lumotlarni saqlashga
84.
An’anaviy realyatsion operatsiyalarga nimalar kiradi
*kesib olish, umumlashtirish,farqlanish,dekart
ko‘paytma
85.
Birinchi normal formada quyidagicha talab qo‘yiladi
* Jadvalning hamma maydonlari bir - biri bilan
funksional bog`langan bo`lishi kerak
86.
Normallashtirish nimaga kerak
*Anomaliyadan holi bo‘lish uchun
87.
Ikkinchi normal formada quyidagicha talab qo‘yiladi:
* Jadvalning hamma maydonlari birinchi kalitga
bog‘liq
88.
Nechta normal forma mavjud?
*6
89.
Uchinchi normal formada quyidagicha talab qo‘yiladi:
* Tranzitiv boglanish bo`lishi
90.
SQL kengaytmasi nimani anglatadi?
*Sutrukturalashgan so‘rov tili
91.
Qaysi SQL operatorlari jadvallar sxemasini boshqarishi mumkin?
*CRATE, ALTER, DROP
92.
Qaysi SQL operatorlari ma’lumotlar ustidan murakkab amallarni bajaradi?
*SELECT, UPDATE, INSERT, DELETE
93.
Obektning nomi ma’lumotlar jadvalida qanday nomlanadi?
*identifikatorlar
94.
Sana vaqt toifasi
*TIMESTAMP
95.
,+, -,* , / operatorlari qanday nomlanadi.
*Arifmetik amallar
96.
Jadvaldagi ustunga qo‘yilgan qanday cheklanish ustun qiymatlarining bo‘sh bo‘lmasligini
ko‘rsatadi
*NOT NULL
97.
‘Paris’ – bu
*Satrli konstanta
98.
VARChAR
* O‘zgaruvchan toifadagi satr tipi
99.
>, <, >, <, <>, operatorlari ........deyiladi
* Solishtirish amallar
100. Obyektdagi ma`lumotlarning funksional bog`lanishi va kamida bitta birmalchi kalit
bo`lishi qaysi normal formani qanoatlantiradi
*1 NF
|
| |
SELECT * FROM STUDENT WHERE SURNAME‘P’; 
*P harfiga teng bo‘lgan familyalar chiqadi. 
137

|
SELECT * FROM STUDENT WHERE SURNAME‘P’;
*P harfiga teng bo‘lgan familyalar chiqadi.
137
|
bet | 9/45 | Sana | 07.01.2024 | Hajmi | 109,51 Kb. | | #131376 |
Bog'liq Savollar Javoblar (2)136. SELECT * FROM STUDENT WHERE SURNAME‘P’;
*P harfiga teng bo‘lgan familyalar chiqadi.
137. Bir nechta shartlardan foydalanishda WHERE operatorida shartlar orasi qanday ajratiladi?
*Kalit so‘zlar, AND yoki OR operatorlari
138. SELECT operatoridan FROM so‘zidan keying yozuv nimani bildiradi?
*jadvalning nomini
139. Qaysi peredikat berilgan shartni qanoatlantiruvchi qidruvni amalga oshiradi?
*WHERE
140. Qaysi peredikat Saralash uchun ishlatiladi?
* ORDER BY
141. To‘gri yozilgan SELECT operatorini ko‘rsating.
*SELECT * FROM
142. INSERT, UPDATE, DELETE quyidagilarning biriga ishlamaydi?
* DML
143. Qaysi operatorda WHERE ishlatib bo‘lmaydi?
*INSERT
144. Ikkilamchi kalit nimani ko‘rsatadi
* birlamchi kalitni
145. DROP va DELETE operatorlarining farqi nimada
DROP ob`yektni DELETE ma`lumotni o`chiradi
146. SELECT * FROM STUDENT WHERE SURNAME‘P%’;
* P bilan boshlanuvchi familyalar chiqadi
147. CREATE TABLE, ALTER TABLE, DROP TABLE Komandalarini qaysilarda ishlatib bo‘ladi
*DDL
148. SELECT operatoridan keyin * nimani bildiradi?
*hamma ustunlarni belgilashni
149. Qaysi operator yordamida «qo`shish» amali bajariladi
*SELECT + JOIN
150. Qaysi operator yordamida «kesishuv» amali bajariladi
* INTERSECT
151. Qaysi operator yordamida «Проекция» amali bajariladi
*SELECT
152. Qaysi operator yordamida «tanlash» amali bajariladi
*SELECT + WHERE
153. Qaysi operator yordamida «birlashtirish» amali bajariladi
*UNION
154. Operatorlarning qaysi biri natijaviy tanlovda eng ko‘p qatorlar sonini chiqaradi
*dekart ko‘paytmasi
155. Ichki bog‘lanish operatori – bu
*INNER JOIN
156. Chap tashqi bog‘lanish operatori – bu
*LEFT OUTER JOIN
|
| |
The Windowing System and System Classes

The Windowing System and System Classes
The Windows windowing system is called User. The most significant change to User is the desynchronization of the per-window message queue from the system message queue. This change prevents errant, looping applications that stop processing their messages from blocking the computer system’s entire user interface, thus making other applications unavailable.
With the addition of input queue time thresholds, the system can provide default handling for a looping or an otherwise nonresponsive process. From an end-user perspective, this means the they can do other things while one application is busy. For example, if a word processing program is busy printing a 100 page document, a user can minimize that application and begin working on a spreadsheet. This effectively minimizes the time the user waits with an “hourglass” on their screen.
The desynchronization of the message queue is completely compatible with the Windows Versions 3.0 and 3.1 message model. The message ordering is the same. If WM_xyz came after WM_abc, it still does. This compatibility is entirely necessary because in Windows 32 systems, existing Windows applications run on top of the Windows 32-Bit message system. The messages are simply copied from the 32-bit stack to the 16-bit stack and passed onto the application; therefore message order cannot change.
|