ID
int64 383
2.08k
| Split
stringclasses 1
value | Domain
stringclasses 4
values | SubDomain
stringclasses 24
values | Format
stringclasses 1
value | Tag
stringclasses 2
values | Language
stringclasses 1
value | Question
stringlengths 28
336
| Answer
stringclasses 2
values | Explanation
stringlengths 29
771
⌀ |
|---|---|---|---|---|---|---|---|---|---|
2,038 |
Test
|
Operating System
|
Memory Management
|
Assertion
|
Reasoning
|
English
|
When the operating system adopts a paging storage management method, it requires each process to have a page table, and the process's page table must reside in memory.
|
True
|
When multiple processes are executed concurrently, the page tables of all processes mostly reside in memory. There is only one Page Table Register (PTR) set up in the system, which contains the starting address and the length of the page table in memory. Normally, when a process is not executing, the starting address and the length of the page table are stored in the process's own Process Control Block (PCB). These two pieces of data are loaded into the Page Table Register only when the process is scheduled. Each process has a separate logical address and its own page table.
|
2,039 |
Test
|
Operating System
|
Memory Management
|
Assertion
|
Reasoning
|
English
|
To ensure that a virtual memory system functions effectively as intended, the programs that are executed should have the characteristic that their instruction locality is not excessive.
|
False
|
Virtual storage technology is based on the principle of locality of programs. The better the locality, the more effectively the virtual storage system can function.
|
2,040 |
Test
|
Operating System
|
Memory Management
|
Assertion
|
Reasoning
|
English
|
In demand paging storage management, if the FIFO page replacement algorithm is used, the number of page faults increases as the number of available page frames increases.
|
False
|
In demand paging storage management, if the FIFO page replacement algorithm is used, the Belady's anomaly may occur, where the number of page faults can increase instead of decrease when the resident set size is increased. However, there is another situation. For example, with the page sequence 1,2,3,1,2,3, there are 6 page faults when there are 2 page frames, and 3 page faults when there are 3 page frames. Therefore, in demand paging storage management, if the FIFO page replacement algorithm is used, the number of page faults may increase or decrease as the number of available page frames increases.
|
2,041 |
Test
|
Operating System
|
Memory Management
|
Assertion
|
Reasoning
|
English
|
A virtual memory system uses a paging memory management scheme with the LRU page replacement algorithm. Given the page access sequence 18178272183821317137, assuming the memory capacity is 4 pages and initially empty, the number of page faults is 6.
|
True
|
Interrupts are generated when accessing the 1st, 2nd, 4th, 6th, 11th, and 17th pages, resulting in a total of 6 interrupts.
|
2,042 |
Test
|
Operating System
|
File Management
|
Assertion
|
Knowledge
|
English
|
The directory entry for FAT32 does not include the physical location of the file control block.
|
True
| null |
2,043 |
Test
|
Operating System
|
File Management
|
Assertion
|
Knowledge
|
English
|
File dumping is a solution provided by the operating system to ensure that no other users can use the file without the authorization of the file owner.
|
False
| null |
2,044 |
Test
|
Operating System
|
File Management
|
Assertion
|
Knowledge
|
English
|
From the user's perspective, the purpose of introducing a file system in an operating system is to save user and system documents as well as data.
|
False
| null |
2,045 |
Test
|
Operating System
|
File Management
|
Assertion
|
Knowledge
|
English
|
The index file consists of a logical file and an index table.
|
True
| null |
2,046 |
Test
|
Operating System
|
File Management
|
Assertion
|
Knowledge
|
English
|
One of the purposes of creating an index is to reduce storage space.
|
False
| null |
2,047 |
Test
|
Operating System
|
File Management
|
Assertion
|
Knowledge
|
English
|
If the physical structure of a file in the file system adopts a contiguous structure, the information related to the physical location of the file in the FCB should include the starting block address and the index table address.
|
True
| null |
2,048 |
Test
|
Operating System
|
File Management
|
Assertion
|
Knowledge
|
English
|
The conversion between a file's symbolic name and its physical address is achieved through the file directory.
|
True
| null |
2,049 |
Test
|
Operating System
|
File Management
|
Assertion
|
Knowledge
|
English
|
Logical files can be divided into stream-oriented files and record-oriented files.
|
True
| null |
2,050 |
Test
|
Operating System
|
File Management
|
Assertion
|
Knowledge
|
English
|
The structure of a file refers to the form of its organization. From an implementation perspective, the way a file is organized and stored on external storage is known as the file's logical structure.
|
True
| null |
2,051 |
Test
|
Operating System
|
File Management
|
Assertion
|
Knowledge
|
English
|
The organization of logical files depends on the management method of the operating system.
|
False
| null |
2,052 |
Test
|
Operating System
|
File Management
|
Assertion
|
Knowledge
|
English
|
In the UNIX operating system, the index structure of a file is located in the directory entry.
|
False
| null |
2,053 |
Test
|
Operating System
|
File Management
|
Assertion
|
Knowledge
|
English
|
Bitmaps can be used for file directory lookup.
|
False
| null |
2,054 |
Test
|
Operating System
|
File Management
|
Assertion
|
Knowledge
|
English
|
The management of file storage space essentially involves the organization and management of file control blocks.
|
False
| null |
2,055 |
Test
|
Operating System
|
File Management
|
Assertion
|
Knowledge
|
English
|
The directory contains information about all the subdirectories, files, and data files within it.
|
True
| null |
2,056 |
Test
|
Operating System
|
File Management
|
Assertion
|
Knowledge
|
English
|
To ensure that no other users can use the file without the authorization of the file owner, the solution provided by the operating system is file confidentiality.
|
False
| null |
2,057 |
Test
|
Operating System
|
File Management
|
Assertion
|
Knowledge
|
English
|
Access to a file is often restricted by both user access permissions and file attributes.
|
True
| null |
2,058 |
Test
|
Operating System
|
File Management
|
Assertion
|
Knowledge
|
English
|
The logical structure of a file is designed for the convenience of the user.
|
True
| null |
2,059 |
Test
|
Operating System
|
File Management
|
Assertion
|
Knowledge
|
English
|
If there are two files with the same name in the file system, a multi-level directory structure should not be used.
|
False
| null |
2,060 |
Test
|
Operating System
|
File Management
|
Assertion
|
Knowledge
|
English
|
From the user's perspective, the purpose of introducing a file system in an operating system is to save user and system documents and data.
|
False
| null |
2,061 |
Test
|
Operating System
|
File Management
|
Assertion
|
Knowledge
|
English
|
Bitmaps can be used for the management of disk space.
|
True
| null |
2,062 |
Test
|
Operating System
|
File Management
|
Assertion
|
Reasoning
|
English
|
The flexibility of encryption protection mechanisms is superior to that of access control mechanisms.
|
False
|
Compared to encryption protection mechanisms, access control mechanisms are less secure. This is because access control has lower levels and weaker protection, thus offering relatively higher flexibility. If access control is not implemented by the system, the security of the system itself cannot be guaranteed. If the encryption mechanism is implemented by the system, the encryption method will not be extendable.
|
2,063 |
Test
|
Operating System
|
File Management
|
Assertion
|
Reasoning
|
English
|
The file system uses a two-level index allocation method, with each disk block size being 1KB and each block number occupying 4B. Therefore, in this system, the maximum length of a single file is 32MB.
|
False
|
Each disk block can contain up to 1KB/4B = 256 index entries, thus under a two-level indexing scheme, the maximum length of a single file is 256x256x1KB = 64MB.
|
2,064 |
Test
|
Operating System
|
File Management
|
Assertion
|
Reasoning
|
English
|
To access the information at the 1569th logical byte of the file, one should access the 80th disk block.
|
True
|
Since 1569 = 512x3 + 33, the byte to be accessed is located in the 4th disk block, and the corresponding physical disk block number is 80.
|
2,065 |
Test
|
Operating System
|
Input/Output Management
|
Assertion
|
Knowledge
|
English
|
The I/O control of disk devices mainly adopts the byte mode.
|
False
| null |
2,066 |
Test
|
Operating System
|
Input/Output Management
|
Assertion
|
Knowledge
|
English
|
A channel, also known as an I/O processor, is used to facilitate the transfer of information between the CPU and peripherals.
|
False
| null |
2,067 |
Test
|
Operating System
|
Input/Output Management
|
Assertion
|
Knowledge
|
English
|
When the CPU executes the "Start I/O" instruction and is rejected by the channel, an interrupt is generated.
|
False
| null |
2,068 |
Test
|
Operating System
|
Input/Output Management
|
Assertion
|
Knowledge
|
English
|
A key issue to consider in buffer management is the synchronization of process access to the buffer.
|
True
| null |
2,069 |
Test
|
Operating System
|
Input/Output Management
|
Assertion
|
Knowledge
|
English
|
Tape drives are considered shared devices.
|
False
| null |
2,070 |
Test
|
Operating System
|
Input/Output Management
|
Assertion
|
Knowledge
|
English
|
Virtual devices are implemented through SPOOLing technology.
|
True
| null |
2,071 |
Test
|
Operating System
|
Input/Output Management
|
Assertion
|
Knowledge
|
English
|
In systems that utilize SPOOLing technology, the user's print results are first sent to a fixed area in memory.
|
False
| null |
2,072 |
Test
|
Operating System
|
Input/Output Management
|
Assertion
|
Knowledge
|
English
|
The SPOOLing system consists of a pre-input program, spool management program, and output program.
|
False
| null |
2,073 |
Test
|
Operating System
|
Input/Output Management
|
Assertion
|
Knowledge
|
English
|
In systems that utilize SPOOLing technology, the user's print data is first sent to a fixed area on the disk.
|
True
| null |
2,074 |
Test
|
Operating System
|
Input/Output Management
|
Assertion
|
Knowledge
|
English
|
Optical discs and magnetic tapes can be accessed both randomly and sequentially.
|
False
| null |
2,075 |
Test
|
Operating System
|
Input/Output Management
|
Assertion
|
Knowledge
|
English
|
Solid State Drives (SSD) are not prone to wear.
|
False
| null |
2,076 |
Test
|
Operating System
|
Input/Output Management
|
Assertion
|
Knowledge
|
English
|
The interface between the device controller and the processor is used to implement device control functions in the device controller.
|
False
| null |
2,077 |
Test
|
Operating System
|
Input/Output Management
|
Assertion
|
Knowledge
|
English
|
The buffer pool in buffering technology is located in the registers.
|
False
| null |
2,078 |
Test
|
Operating System
|
Input/Output Management
|
Assertion
|
Knowledge
|
English
|
The primary purpose of SPOOLing technology is to increase the speed of information exchange between the CPU and devices.
|
False
| null |
2,079 |
Test
|
Operating System
|
Input/Output Management
|
Assertion
|
Knowledge
|
English
|
In the SPOOLing system, the user process is actually allocated to the external storage area, that is, the virtual device.
|
True
| null |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.