




























































































Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community for help and clear up your study doubts
Discover the best universities in your country according to Docsity users
Free resources
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
The graphs have two kinds of nodes a. Processes that are shown as circles b. Resources that are shown as squares c. Resources that are shown as circles d. Processes that are shown as squares - ✔️✔️a b The graphs have two kinds of nodes a. Processes that are shown as circles, and Resources that are shown as squares b. Resources that are shown as circles, and Processes that are shown as diamond c. Resources that are shown as circles, and Processes that are shown as squares d. Processes that are shown as circles, and Resources that are shown as triangles - ✔️✔️a The i-nodes are used in which of the following allocation methods a. Contiguous allocation b. Linked allocation c. Indexed allocation d. Linked allocation using FAT - ✔️✔️c The I/O devices have no way of seeing memory addresses as they go by on the memory bus, so they have no way of responding to them.
Typology: Exams
1 / 224
This page cannot be seen from the preview
Don't miss anything!
The graphs have two kinds of nodes a. Processes that are shown as circles b. Resources that are shown as squares c. Resources that are shown as circles d. Processes that are shown as squares - ✔ ✔ a b The graphs have two kinds of nodes a. Processes that are shown as circles, and Resources that are shown as squares b. Resources that are shown as circles, and Processes that are shown as diamond c. Resources that are shown as circles, and Processes that are shown as squares
d. Processes that are shown as circles, and Resources that are shown as triangles - ✔ ✔ a The i-nodes are used in which of the following allocation methods a. Contiguous allocation b. Linked allocation c. Indexed allocation d. Linked allocation using FAT - ✔ ✔ c The I/O devices have no way of seeing memory addresses as they go by on the memory bus, so they have no way of responding to them. Which the type mapping with memory has above disadvantage? a. Memory-Mapped I/O b. Memory-Mapped I/O Data Buffer c. Memory-Mapped Files d. Memory-Mapped Cache - ✔ ✔ a
c. Directory names with extensions d. All of the others - ✔ ✔ d The Joliet Extensions provide ___________ a. Long file name is supported Unicode character b. Directory nesting deeper than 8 levels c. Directory names with extensions d. All of the others - ✔ ✔ d A/An _______ entry contains one entry for each file in that directory including file name (14 bytes) and the number of i-node (2 bytes) a. UNIX directory b. MS-DOS directory c. CD-ROM directory d. All of the others - ✔ ✔ a All deadlocks involve conflicting needs for resources by ________
a. One or more processes b. Two or more processes c. Three or more processes d. None of the other choices - ✔ ✔ b An example of a block-oriented I/O device is
a. CD ROM b. Printer c. Modem d. All of the other choices - ✔ ✔ a An example of the key differences that can exist across (and even in) classes of I/O devices is: a. Data rate b. Data representation c. Error conditions d. All of the other choices - ✔ ✔ d
An interrupt that does not meet the following requirements is called an ________
b. Memory-mapped I/O c. Memory-mapped device d. All of the others - ✔ ✔ a
d. 1, 4, 5, 3, 2 - ✔ ✔ a
a. pipe b. Pseudo file c. Directory d. All of the others - ✔ ✔ a b A ____ is a portion of a process that can run independently a. thread b. program c. miniprocess d. subprocess - ✔ ✔ a A ________ is provided to make system calls from some programming languages a. procedure library b. operator c. pointer d. None of the others - ✔ ✔ a
average, with an 70% average I/O wait. The CPU utilization is ...... a. 99.53% b. 0.9952% c. 70% d. None of the others - ✔ ✔ a A computer has 2 GB of memory, with OS taking 512 MB and each user program also taking up 200 MB with an 70% average I/O wait. How percentage of CPU utilization does? a. 91.765% b. 97.175% c. 51% d. 30% - ✔ ✔ a A computer has 4GB of memory, with OS taking 635 MB and each user program also taking up 95 MB in
average, with an 65% average I/O wait. How many CPU utilization is? a. 99.999% b. 0.258% c. 65% d. None of the others - ✔ ✔ b A computer has 512MB of memory, with OS taking 512 MB and each user program also taking up 128MB with an 80% average I/O wait? How percentage of CPU utilization does? a. 49% b. 59% c. 69% d. 79% - ✔ ✔ d A computer has four page frames. The time of loading, time of last access, and the R and M bits for
directly and the address of block of pointers that is used with large file a. i-node b. FAT c. PCB d. LFS - ✔ ✔ a A directory entry contains one entry for each file in that directory including file name (14 bytes) and the number of i-node (2 bytes). Which File System is described? a. MS-DOS b. Windows c. Netware d. UNIX V7 - ✔ ✔ d A directory in UNIX/Linux consists of the following a. i-node number and file name b. file name, file size, location of the file on disk
c. file name, file size, location of the file on disk, date created, owner ID d. None of the other choices - ✔ ✔ a A directory in UNIX/Linux consists of the following a. inode number and file name b. file name, file size, location of the file on disk c. file name, file size, location of the file on disk, date created, owner ID d. None of the others - ✔ ✔ a A disk queue with requests for I/O blocks on cylinders in orders: 10 171 47 126 4 124 23 8 76. Assume that the disk head is initially at cylinder 50. How many Averages seek length of cylinder do the head movement using elevator algorithms on DOWNWARD? a. 92. b. 55.