COP4610 Final Exam
Quiz yourself by thinking what should be in
each of the black spaces below before clicking
on it to display the answer.
Help!
|
|
||||
|---|---|---|---|---|---|
| Suppose we have the following page accesses: 1 2 3 4 2 3 4 1 2 1 1 3 1 4 and that there are three frames within our system. Using the FIFO replacement algorithm, what is the number of page faults for the given reference string? | show 🗑
|
||||
| show | (0,0)
🗑
|
||||
| show | The speed at which pages are examined (the scanrate) is constant.
🗑
|
||||
| show | TLB reach
🗑
|
||||
| In systems that support virtual memory, ____ | show 🗑
|
||||
| _____ occurs when a process spends more time paging than executing. | show 🗑
|
||||
| _____ is the algorithm implemented on most systems. | show 🗑
|
||||
| Belady's anomaly states that ____. | show 🗑
|
||||
| Suppose we have the following page accesses: 1 2 3 4 2 3 4 1 2 1 1 3 1 4 and that there are three frames within our system. what will be the final configuration of the three frames following the execution of the given reference string | show 🗑
|
||||
| show | allows the child process to use the address space of the parent
🗑
|
||||
| Optimal page replacement ____. | show 🗑
|
||||
| show | Because the kernel requests memory of varying sizes, some of which may be quite small, the system does not have to be concerned about wasting memory.
🗑
|
||||
| show | 64 KB
🗑
|
||||
| The _____ is an approximation of a program's locality. | show 🗑
|
||||
| Given the reference string of page accesses: 1 2 3 4 2 3 4 1 2 1 1 3 1 4 and a system with three page frames, what is the final configuration of the three frames after the true LRU algorithm is applied? | show 🗑
|
||||
| show | All of these answers are correct
🗑
|
||||
| ______ allows a portion of a virtual address space to be logically associated with a file. | show 🗑
|
||||
| The _____ allocation algorithm allocates available memory to each process according to its size. | show 🗑
|
||||
| show | copy-on-write
🗑
|
||||
| A character-stream device ____. | show 🗑
|
||||
| Which of the following is a principle that can improve the efficiency of I/O? | show 🗑
|
||||
| show | All answers are correct
🗑
|
||||
| DMA controllers ____. | show 🗑
|
||||
| A(n) ____ is a front-end processor that multiplexes the traffic from hundreds of remote terminals into one port on a large computer. | show 🗑
|
||||
| DMA controllers ____. | show 🗑
|
||||
| An interrupt priority scheme can be used to ____. | show 🗑
|
||||
| Which of the following is a principle that can improve the efficiency of I/O? | show 🗑
|
||||
| A character-stream device ____. | show 🗑
|
||||
| Consider a system crash on a log-structured file system. Which one of the following events must occur? | show 🗑
|
||||
| A RAID structure ____. | show 🗑
|
||||
| show | Sector sparing
🗑
|
||||
| show | 100 - 116 - 185 - 87 - 75 - 22 - 11 – 3
🗑
|
||||
| show | 87 - 75 - 100 - 116 - 185 - 22 - 11 – 3
🗑
|
||||
| show | 116 - 22 - 3 - 11 - 75 - 185 - 100 – 87
🗑
|
||||
| Consider a disk queue holding requests to the following cylinders in the listed order: 116, 22, 3, 11, 75, 185, 100, 87. Using the C-SCAN scheduling algorithm, assuming the disk head is at cylinder 88 and moving upward through the cylinders? | show 🗑
|
||||
| show | tries to provide the best throughput for the virtual memory system
🗑
|
||||
| show | density of bits per track is uniform
🗑
|
||||
| Which of the following statements is false? | show 🗑
|
||||
| show | phase-change
🗑
|
||||
| Which of the following disk head scheduling algorithms does not take into account the current position of the disk head? | show 🗑
|
||||
| show | 5
🗑
|
||||
| Which RAID level is best for storing large volumes of data? | show 🗑
|
||||
| On media that uses constant linear velocity, the ____. | show 🗑
|
||||
| The surface of a magnetic disk platter is divided into ____. | show 🗑
|
||||
| show | seek time + rotational latency
🗑
|
||||
| show | services the request with the minimum seek time
🗑
|
||||
| show | divides a disk into sections that the disk controller can read and write
🗑
|
||||
| show | accessed via local I/O ports
🗑
|
||||
| show | 5,1,3,4,2
🗑
|
||||
| ______ includes all of the file system structure, minus the actual contents of files. | show 🗑
|
||||
| show | Inode
🗑
|
||||
| show | least-recently-used (LRU)
🗑
|
||||
| A contiguous chunk of disk blocks is known as a(n) _____. | show 🗑
|
||||
| Which of the following is the simplest method for implementing a directory? | show 🗑
|
||||
| show | establishes the initial logical connection between a server and a client
🗑
|
||||
| show | independent machines with independent file systems
🗑
|
||||
| Which of the following allocation methods ensures that only one access is needed to get a disk block using direct access? | show 🗑
|
||||
| Which of the following statements regarding the WAFL file system is incorrect? | show 🗑
|
||||
| Transfers between memory and disk are performed a ____. | show 🗑
|
||||
| show | 5
🗑
|
||||
| In the Linux VFS architecture, a(n) ____ object represents an individual file. | show 🗑
|
||||
| show | uses virtual memory techniques to cache file data as pages as opposed to system-oriented blocks.
🗑
|
||||
| show | It is not feasible to keep the entire list in main memory for large disks.
🗑
|
||||
| show | 1100010001000001
🗑
|
||||
| The file-allocation table (FAT) used in MS-DOS is an example of _____. | show 🗑
|
||||
| A _____ is a view of a file system before the last update took place. | show 🗑
|
||||
| show | contains information such as the number of blocks in a partition, size of the blocks, and free-block and FCB count and pointers
🗑
|
||||
| show | All transactions in the log must be completed.
🗑
|
||||
| show | magic number
🗑
|
||||
| Which of the following is a key property of an file? | show 🗑
|
||||
| An acyclic-graph directory structure ____. | show 🗑
|
||||
| show | 2, 3, 3
🗑
|
||||
| show | Lightweight directory-access protocol (LDAP)
🗑
|
||||
| ________ is/are not considered a difficulty when considering file sharing. | show 🗑
|
||||
| A(n) ____ file is a sequence of subroutines and functions | show 🗑
|
||||
| An exclusive lock ____. | show 🗑
|
||||
| show | behaves like a reader lock
🗑
|
||||
| The path name /home/people/os-student/chap10.txt is an example of | show 🗑
|
||||
| Which of the following is true of the direct-access method? | show 🗑
|
||||
| The simplest file access method is ____. | show 🗑
|
||||
| app.exe is an example of a(n) _____. | show 🗑
|
||||
| show | executable
🗑
|
||||
| A(n) ____ file is a sequence of bytes organized into blocks understandable by the system's linker. | show 🗑
|
||||
| A mount point is _____. | show 🗑
|
||||
| Which of the following is not considered a classification of users in connection with each file? | show 🗑
|
||||
| In an environment where several processes may open the same file at the same time, ____. | show 🗑
|
||||
| The UNIX file system uses which of the following consistency semantics? | show 🗑
|
||||
| Which of the following is true of the tree-structured directory structure? | show 🗑
|
||||
| show | logical address
🗑
|
||||
| With segmentation, a logical address consists of _____. | show 🗑
|
||||
| A(n) ______ matches the process with each entry in the TLB. | show 🗑
|
||||
| In a dynamically linked library, ____. | show 🗑
|
||||
| Absolute code can be generated for ____. | show 🗑
|
||||
| Given the logical address 0xAEF9 (in hexadecimal) with a page size of 256 bytes, what is the page number? | show 🗑
|
||||
| show | 0xF9
🗑
|
||||
| show | execution time
🗑
|
||||
| Which of the following data structures is appropriate for placing into its own segment? | show 🗑
|
||||
| _____ is the dynamic storage-allocation algorithm which results in the smallest leftover hole in memory. | show 🗑
|
||||
| show | Worst fit
🗑
|
||||
| Suppose a program is operating with execution-time binding and the physical address generated is 300. The relocation register is set to 100. What is the corresponding logical address? | show 🗑
|
||||
| A(n) ____ page table has one page entry for each real page (or frame) of memory. | show 🗑
|
||||
| show | 1200
🗑
|
||||
| show | 13
🗑
|
||||
| show | for priority-based scheduling algorithms
🗑
|
||||
| show | 262144
🗑
|
||||
| show | It is possible only if relocation is dynamic and done at execution time.
🗑
|
||||
| show | 108.5
🗑
|
||||
| show | Execution time binding
🗑
|
Review the information in the table. When you are ready to quiz yourself you can hide individual columns or the entire table. Then you can click on the empty cells to reveal the answer. Try to recall what will be displayed before clicking the empty cell.
To hide a column, click on the column name.
To hide the entire table, click on the "Hide All" button.
You may also shuffle the rows of the table by clicking on the "Shuffle" button.
Or sort by any of the columns using the down arrow next to any column heading.
If you know all the data on any row, you can temporarily remove it by tapping the trash can to the right of the row.
To hide a column, click on the column name.
To hide the entire table, click on the "Hide All" button.
You may also shuffle the rows of the table by clicking on the "Shuffle" button.
Or sort by any of the columns using the down arrow next to any column heading.
If you know all the data on any row, you can temporarily remove it by tapping the trash can to the right of the row.
Embed Code - If you would like this activity on your web page, copy the script below and paste it into your web page.
Normal Size Small Size show me how
Normal Size Small Size show me how
Created by:
ohmsy