OS GGC Final

Quiz

Top of Form

Note: It is recommended that you save your response as you complete each question.

---

Question 1 (2 points)

 

An address generated by a CPU is referred to as a ____. (Full9,Ch8,CG7)

Question 1 options:

	a)  post relocation register address
	b)  Memory-Management Unit (MMU) generated address
	c)  logical address
	d)  physical address

Save

Question 2 (2 points)

 

Non-uniform memory access has little effect on the performance of a virtual memory system. (Full9,Ch9,CG7)

Question 2 options:

	a) True
	b) False

Save

Question 3 (2 points)

 

_____ is the method of binding instructions and data to memory performed by most general-purpose operating systems. (Full9,Ch8,CG7)

Question 3 options:

	a)  Interrupt binding
	b)  Compile time binding
	c)  Load-time binding
	d)  Execution time binding

Save

Question 4 (2 points)

 

A race condition ____. (Full9,Ch5,CG5)

Question 4 options:

	a)  results when several threads try to access and modify the same data concurrently (option 2)
	b)  will result only if the outcome of execution does not depend on the order in which instructions are executed (option 3)
	c)  None of the option 1, the option 2 or the option 3
	d)  results when several threads try to access the same data concurrently (option 1)

Save

Question 5 (2 points)

 

A(n) ____ file is a sequence of functions. (Full9,Ch11,CG6)

Question 5 options:

	a)  text
	b)  executable
	c)  object
	d)  source

Save

Question 6 (2 points)

 

Which of the following is true of the direct-access method? (Full9,Ch11,CG6)

Question 6 options:

	a)  It allows programs to read and write records in no particular order.
	b)  It is the most common mode of access.
	c)  It is not a good method for accessing large amounts of data quickly.
	d)  Files are made up of variable-length records.

Save

Question 7 (2 points)

 

The simplest file access method is ____. (Full9,Ch11,CG6)

Question 7 options:

	a)  sequential access
	b)  direct access
	c)  logical access
	d)  relative access

Save

Question 8 (2 points)

 

Hashed page tables are commonly used when handling addresses larger than 32 bits. (Full9,Ch8,CG7)

Question 8 options:

	a) True
	b) False

Save

Question 9 (2 points)

 

A ___ type presents a set of programmer-defined operations that are provided mutual exclusion within it. (Full9,Ch5,CG5)

Question 9 options:

	a)  binary
	b)  monitor
	c)  transaction
	d)  signal

Save

Question 10 (2 points)

 

_____ is/are not a technique for managing critical sections in operating systems. (Full9,Ch5,CG5)

Question 10 options:

	a)  Nonpreemptive kernel
	b)  Peterson's solution
	c)  Preemptive kernel
	d)  Semaphores

Save

Question 11 (2 points)

 

A shared lock ____. (Full9,Ch11,CG6)

Question 11 options:

	a)  behaves like a reader lock
	b)  behaves like a writer lock
	c)  ensures that a file can have only a single concurrent shared lock
	d)  will prevent all other processes from accessing the locked file

Save

Question 12 (2 points)

 

An instruction that executes atomically ____. (Full9,Ch5,CG5)

Question 12 options:

	a)  executes as a single, uninterruptible unit (option 2)
	b)  cannot be used to solve the critical section problem (option 3)
	c)  must consist of only one machine instruction (option 1)
	d)  All of the options 1, 2 and 3

Save

Question 13 (2 points)

 

A counting semaphore ____. (Full9,Ch5,CG5)

Question 13 options:

	a)  is accessed through only one standard operation
	b)  can be modified simultaneously by multiple threads
	c)  cannot be used to control access to a thread's critical sections
	d)  is essentially an integer variable

Save

Question 14 (2 points)

 

In Peterson's solution, the ____ variable indicates if a process is ready to enter its critical section. (Full9,Ch5,CG5)

Question 14 options:

	a)  turn[i]
	b)  lock
	c)  turn
	d)  flag[i]

Save

Question 15 (2 points)

 

The _____ allocation algorithm allocates available memory to each process according to its size. (Full9,Ch9,CG7)

Question 15 options:

	a)  equal
	b)  global
	c)  proportional
	d)  slab

Save

Question 16 (2 points)

 

Reentrant code cannot be shared. (Full9,Ch8,CG7)

Question 16 options:

	a) True
	b) False

Save

Question 17 (2 points)

 

The _____ binding scheme facilitates swapping. (Full9,Ch8,CG7)

Question 17 options:

	a)  execution time
	b)  assembly time
	c)  interrupt time
	d)  load time

Save

Question 18 (2 points)

 

Absolute code can be generated for ____. (Full9,Ch8,CG7)

Question 18 options:

	a)  execution-time binding
	b)  interrupt binding
	c)  load-time binding
	d)  compile-time binding

Save

Question 19 (2 points)

 

_____ is not a technique for handling critical sections in operating systems. (Full9,Ch5,CG5)

Question 19 options:

	a)  Peterson's solution
	b)  Spinlocks
	c)  Nonpreemptive kernels
	d)  Preemptive kernels

Save

Question 20 (2 points)

 

The _____ is an approximation of a program's locality. (Full9,Ch9,CG7)

Question 20 options:

	a)  page fault frequency
	b)  locality model
	c)  working set
	d)  page replacement algorithm

Save

Question 21 (2 points)

 

Reentrant code cannot be shared. (Full9,Ch8,CG7)

Question 21 options:

	a) True
	b) False

Save

Question 22 (2 points)

 

Windows uses a local page replacement policy _____. (Full9,Ch9,CG7)

Question 22 options:

	a)  under all circumstances
	b)  when a process exceeds its working set minimum
	c)  when the system undergoes automatic working set trimming
	d)  when a process exceeds its working set maximum

Save

Question 23 (2 points)

 

On a system with demand-paging, a process will experience a high page fault rate when the process begins execution. (Full9,Ch9,CG7)

Question 23 options:

	a) True
	b) False

Save

Question 24 (2 points)

 

There is a 1:1 correspondence between the number of entries in the TLB and the number of entries in the page table. (Full9,Ch8,CG7)

Question 24 options:

	a) True
	b) False

Save

Question 25 (2 points)

 

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? (Full9,Ch8,CG7)

Question 25 options:

	a)  300
	b)  201
	c)  200
	d)  199

Save

Question 26 (2 points)

 

_____ is the dynamic storage-allocation algorithm which results in the largest leftover hole in memory. (Full9,Ch8,CG7)

Question 26 options:

	a)  First fit
	b)  Worst fit
	c)  Ten fit
	d)  Best fit

Save

Question 27 (2 points)

 

The first readers-writers problem ____. (Full9,Ch5,CG5)

Question 27 options:

	a)  requires that no reader will be kept waiting unless a writer has already obtained permission to use the shared database.
	b)  requires that no reader will be kept waiting unless a reader has already obtained permission to use the shared database.
	c)  requires that, once a writer is ready, that writer performs its write as soon as possible.
	d)  is not used to test synchronization primitives.

Save

Question 28 (2 points)

 

A(n) ____ page table has one page entry for each real page (or frame) of memory. (Full9,Ch8,CG7)

Question 28 options:

	a)  clustered
	b)  inverted
	c)  virtual
	d)  forward-mapped

Save

Question 29 (2 points)

 

A mount point is _____. (Full9,Ch11,CG6)

Question 29 options:

	a)  the location within the file structure where the file system is to be attached.
	b)  only appropriate for shared file systems
	c)  a root of the file system
	d)  a location of a shared file system

Save

Question 30 (2 points)

 

Absolute code can be generated for ____. (Full9,Ch8,CG7)

Question 30 options:

	a)  execution-time binding
	b)  compile-time binding
	c)  interrupt binding
	d)  load-time binding

Save

Question 31 (2 points)

 

A solution to the critical section problem does not have to satisfy which of the following requirements? (Full9,Ch5,CG5)

Question 31 options:

	a)  bounded waiting
	b)  mutual exclusion
	c)  progress
	d)  atomicity

Save

Question 32 (2 points)

 

_____ is the dynamic storage-allocation algorithm which results in the smallest leftover hole in memory. (Full9,Ch8,CG7)

Question 32 options:

	a)  Second fit
	b)  Worst fit
	c)  Best fit
	d)  First fit

Save

Question 33 (2 points)

 

Systems in which memory access times vary significantly are known as __________. (Full9,Ch9,CG7)

Question 33 options:

	a)  non-uniform memory access
	b)  copy-on-write memory
	c)  memory-mapped I/O
	d)  demand-paged memory

Save

Question 34 (2 points)

 

______ allows a portion of a virtual address space to be logically associated with a file. (Full9,Ch9,CG7)

Question 34 options:

	a)  Shared memory
	b)  Slab allocation
	c)  Memory-mapping
	d)  Locality of reference

Save

Question 35 (2 points)

 

Which of the following is true of the tree-structured directory structure? (Full9,Ch11,CG6)

Question 35 options:

	a)  It is the most common directory structure.
	b)  Users cannot create their own subdirectories.
	c)  Users cannot acquire permission to access the files of other users.
	d)  Directories can share subdirectories and files.

Save

Question 36 (2 points)

 

The mapping of a logical address to a physical address is done in hardware by the ________. (Full9,Ch8,CG7)

Question 36 options:

	a)  memory address register
	b)  relocation register
	c)  memory-management-unit (MMU)
	d)  dynamic loading register

Save

Question 37 (2 points)

 

A(n) ____ page table has one page entry for each real page (or frame) of memory. (Full9,Ch8,CG7)

Question 37 options:

	a)  clustered
	b)  forward-mapped
	c)  inverted
	d)  virtual

Save

Question 38 (2 points)

 

Which of the following statements is true? (Full9,Ch5,CG5)

Question 38 options:

	a)  Operations on atomic integers do not require locking.
	b)  Linux only provides the atomic_inc() and atomic_sub() operations.
	c)  Operations on atomic integers do require additional locking.
	d)  Operations on atomic integers can be interrupted.

Save

Question 39 (2 points)

 

With segmentation, a logical address consists of _____. (Full9,Ch8,CG7)

Question 39 options:

	a)  segment number and offset
	b)  segment name and offset
	c)  segment number and page number
	d)  segment table and segment number

Save

Question 40 (2 points)

 

_____ is the dynamic storage-allocation algorithm which results in the largest leftover hole in memory. (Full9,Ch8,CG7)

Question 40 options:

	a)  Best fit
	b)  Worst fit
	c)  Ten fit
	d)  First fit

Save

Question 41 (2 points)

 

The buddy system for allocating kernel memory is very likely to cause fragmentation within the allocated segments. (Full9,Ch9,CG7)

Question 41 options:

	a) True
	b) False

Save

Question 42 (2 points)

 

Which of the following is not considered a classification of users in connection with each file? (Full9,Ch11,CG6)

Question 42 options:

	a)  universe
	b)  owner
	c)  current user
	d)  group

Save

Question 43 (2 points)

 

A(n) ____ file is a series of code sections that the loader can bring into memory and execute. (Full9,Ch11,CG6)

Question 43 options:

	a)  source
	b)  object
	c)  text
	d)  executable

Save

Question 44 (2 points)

 

All files in a single-level directory must have unique names. (Full9,Ch11,CG6)

Question 44 options:

	a) True
	b) False

Save

Question 45 (2 points)

 

There is a 1:1 correspondence between the number of entries in the TLB and the number of entries in the page table. (Full9,Ch8,CG7)

Question 45 options:

	a) True
	b) False

Save

Question 46 (2 points)

 

_____ can be used to prevent busy waiting when implementing a semaphore. (Full9,Ch5,CG5)

Question 46 options:

	a)  Waiting queues
	b)  Mutex lock
	c)  Spinlocks
	d)  Allowing the wait() operation to succeed

Save

Question 47 (2 points)

 

The path name /home/people/os-student/chap11.txt is an example of (Full9,Ch11,CG6)

Question 47 options:

	a)  an absolute path name
	b)  a relative path name
	c)  an invalid path name
	d)  a relative path name to the current directory of /home

Save

Question 48 (2 points)

 

Which of the following is not considered a file attribute? (Full9,Ch11,CG6)

Question 48 options:

	a)  Name
	b)  Resolution
	c)  Size
	d)  Protection

Save

Question 49 (2 points)

 

A(n) _______ refers to where a process is accessing/updating shared data. (Full9,Ch5,CG5)

Question 49 options:

	a)  critical section
	b)  entry section
	c)  test-and-set
	d)  mutex

Save

Question 50 (2 points)

 

app.exe is an example of a(n) _____. (Full9,Ch11,CG6)

Question 50 options:

	a)  batch file
	b)  object file
	c)  text file
	d)  executable file

Bottom of Form

---------------------------------------------------------------------------------------------------------
Quiz

Top of Form

Note: It is recommended that you save your response as you complete each question.

---

Question 1 (6.66 points)

 

Transfers between memory and disk are performed a ____. (Full9,Ch12,CG6)

Question 1 options:

	a)  file at a time
	b)  block at a time
	c)  byte at a time
	d)  sector at a time

Save

Question 2 (6.66 points)

 

A _____ is a view of a file system before the last update took place. (Full9,Ch12,CG6)

Question 2 options:

	a)  transaction
	b)  consistency checker
	c)  backup
	d)  snapshot

Save

Question 3 (6.66 points)

 

Linked allocation suffers from external fragmentation. (Full9,Ch12,CG6)

Question 3 options:

	a) True
	b) False

Save

Question 4 (6.66 points)

 

Which algorithm is considered reasonable for managing a buffer cache? (Full9,Ch12,CG6)

Question 4 options:

	a)  least-frequently-used (LFU)
	b)  least-recently-used (LRU)
	c)  first-in-first-out (FIFO)
	d)  most-recently-used

Save

Question 5 (6.66 points)

 

In the Linux VFS architecture, a(n) ____ object represents an individual file. (Full9,Ch12,CG6)

Question 5 options:

	a)  file
	b)  inode
	c)  dentry
	d)  superblock

Save

Question 6 (6.66 points)

 

The file-allocation table (FAT) used in MS-DOS is an example of _____. (Full9,Ch12,CG6)

Question 6 options:

	a)  linked allocation
	b)  contiguous allocation
	c)  indexed allocation
	d)  multilevel index

Save

Question 7 (6.66 points)

 

Indexed allocation may require substantial overhead for its index block. (Full9,Ch12,CG6)

Question 7 options:

	a) True
	b) False

Save

Question 8 (6.66 points)

 

______ includes all of the file system structure, minus the actual contents of files. (Full9,Ch12,CG6)

Question 8 options:

	a)  Basic file system
	b)  Metadata
	c)  File-organization module
	d)  Logical file system

Save

Question 9 (6.66 points)

 

On UNIX systems, the data structure for maintaining information about a file is a(n) _____. (Full9,Ch12,CG6)

Question 9 options:

	a)  inode
	b)  master file table
	c)  file-control block (FCB)
	d)  superblock

Save

Question 10 (6.66 points)

 

Which of the following allocation methods ensures that only one access is needed to get a disk block using direct access? (Full9,Ch12,CG6)

Question 10 options:

	a)  hashed allocation
	b)  indexed allocation
	c)  contiguous allocation
	d)  linked allocation

Save

Question 11 (6.66 points)

 

A contiguous chunk of disk blocks is known as a(n) _____. (Full9,Ch12,CG6)

Question 11 options:

	a)  inode
	b)  extent
	c)  disk block group
	d)  file-allocation table (FAT)

Save

Question 12 (6.66 points)

 

NFS views a set of interconnected workstations as a set of ____. (Full9,Ch12,CG6)

Question 12 options:

	a)  independent machines with dependent file systems
	b)  independent machines with independent file systems
	c)  dependent machines with independent file systems
	d)  dependent machines with dependent file systems

Save

Question 13 (6.66 points)

 

A unified buffer cache uses the same cache for ordinary disk I/O as well as memory-mapped I/O. (Full9,Ch12,CG6)

Question 13 options:

	a) True
	b) False

Save

Question 14 (6.66 points)

 

Which of the following is the simplest method for implementing a directory? (Full9,Ch12,CG6)

Question 14 options:

	a)  hash table
	b)  nonlinear list
	c)  tree data structure
	d)  linear list

Save

Question 15 (6.66 points)

 

Metadata includes all of the file-system structure, including the actual data (or contents of the file). (Full9,Ch12,CG6)

Question 15 options:

	a) True
	b) False

---

Quiz

Top of Form

Note: It is recommended that you save your response as you complete each question.

---

Question 1 (6.66 points)

 

A dedicated device cannot be used concurrently by several processes or threads. (Full9,Ch13,CG4)

Question 1 options:

	a) True
	b) False

Save

Question 2 (6.66 points)

 

A sense key reports on the failure of a SCSI device by ____. (Full9,Ch13,CG4)

Question 2 options:

	a)  maintaining internal pages of error-log information
	b)  stating the general nature of the failure
	c)  stating the general category of failure
	d)  giving detailed information about the exact cause of failure

Save

Question 3 (6.66 points)

 

STREAMS I/O is asynchronous except when the user process communicates with the stream head. (Full9,Ch13,CG4)

Question 3 options:

	a) True
	b) False

Save

Question 4 (6.66 points)

 

An interrupt priority scheme can be used to ____. (Full9,Ch13,CG4)

Question 4 options:

	a)  All of the options (option 1 or option 2 or option 3)
	b)  allow the most urgent work to be finished first (option 1)
	c)  defer the handling of low-priority interrupt without masking off all interrupts (option 3)
	d)  make it possible for high-priority interrupts to preempt the execution of a low priority interrupt (option 2)

Save

Question 5 (6.66 points)

 

An expansion bus is used to connect relatively high speed devices to the main bus. (Full9,Ch13,CG4)

Question 5 options:

	a) True
	b) False

Save

Question 6 (6.66 points)

 

The ____ register of an I/O port can be written by the host to start a command or to change the mode of a device. (Full9,Ch13,CG4)

Question 6 options:

	a)  data-in
	b)  status
	c)  control
	d)  transfer

Save

Question 7 (6.66 points)

 

Which of the following is true of a blocking system call? (Full9,Ch13,CG4)

Question 7 options:

	a)  The execution of the application is suspended when the call is issued.
	b)  The application continues to execute its code when the call is issued.
	c)  The call returns immediately without waiting for the I/O to complete.
	d)  Blocking application code is harder to understand than nonblocking application code

Save

Question 8 (6.66 points)

 

A(n) ____ is a front-end processor that multiplexes the traffic from hundreds of remote terminals into one port on a large computer. (Full9,Ch13,CG4)

Question 8 options:

	a)  terminal concentrator
	b)  I/O channel
	c)  network daemon
	d)  context switch coordinator

Save

Question 9 (6.66 points)

 

A(n) ____ is a buffer that holds output for a device that cannot accept interleaved data streams. (Full9,Ch13,CG4)

Question 9 options:

	a)  block device
	b)  cache
	c)  spool
	d)  escape

Save

Question 10 (6.66 points)

 

Although caching and buffering are distinct functions, sometimes a region of memory can be used for both purposes. (Full9,Ch13,CG4)

Question 10 options:

	a) True
	b) False

Save

Question 11 (6.66 points)

 

____ I/O accesses a block device as a simple array of blocks. (Full9,Ch13,CG4)

Question 11 options:

	a)  Stream
	b)  Cooked
	c)  Raw
	d)  Indirect

Save

Question 12 (6.66 points)

 

A character-stream device ____. (Full9,Ch13,CG4)

Question 12 options:

	a)  transfers data a byte at a time
	b)  is a device such as a disk drive
	c)  is similar to a random access device
	d)  transfers data in blocks of bytes

Save

Question 13 (6.66 points)

 

A maskable interrupt can never be disabled. (Full9,Ch13,CG4)

Question 13 options:

	a) True
	b) False

Save

Question 14 (6.66 points)

 

Vectored I/O allows one system call to perform multiple I/O operations involving a single location. (Full9,Ch13,CG4)

Question 14 options:

	a) True
	b) False

Save

Question 15 (6.66 points)

 

DMA controllers ____. (Full9,Ch13,CG4)

Question 15 options:

	a)  can steal memory access cycles from the main CPU
	b)  do not utilize an additional, special purpose, processor
	c)  are a nonstandard component in PCs of today
	d)  can access main memory at the same time as the main CPU

---