OS First Test Review

1. 1Many of the statements in "C" are similar to those in "Java" since

   1. AC is based on the design of Java.
      
   2. BC is a design ancestor of C++ and Java.
      
   3. CAll programming languages use the same
      style of statements.
   4. DBoth C and Java share Eiffel as a common design ancestor.
      
      
   5. ENone of the above
2. 2C has primitive types that are built into the language, but which of the following are not primitive types in C?

   1. Abool
   2. Bstring
   3. Cint
   4. Dchar
   5. ENone of the above
3. 3Whenever a boolean type result is required in C (e.g., in
   an "if" statement),

   1. AAny non-zero value represents false.
      
   2. BOnly the zero value represents false.
   3. COnly one value represents true.
      
   4. DAny non-zero value represents true.
   5. ENone of the above
4. 4In C, "&&" and "||" are short-circuit boolean operators just like in
   Java, while the "&" and "|" operators in C

   1. APerform full boolean evaluation.
      
   2. BAre undefined.
      
   3. CAre synonyms for "&&" and "||".
   4. DPerform the bitwise-and and bitwise-or functions.
   5. ENone of the above
      
5. 5The "!" operator in C is used to perform

   1. ALogical negation (e.g., turn "true" into "false").
   2. BNumeric negation (e.g., turn "-3" into "3").
   3. CNumeric inversion (e.g., turn "5" into "1/5").
   4. DArray reversal (reversing the items within an array).
   5. ENone of the above
      
6. 6The assignment operator (=) in C

   1. Aworks exactly like assignment in Java.
   2. Bcannot be used in boolean expressions.
      
   3. Ccannot be used in arithmetic expressio
   4. Dreturns the value assigned as its value.
      
   5. ENone of the above
      
7. 7Which pairs of operators can be easy to confuse but difficult to notice
   and debug because they can often (though not always) yield the same
   results?

   1. A+ and ++
   2. B= and ==
      
   3. C& and &&
      
   4. D| and ||
      
   5. ENone of the above
      
8. 8This example of a pre-increment operator, "x = 12; array[++x] = 3;",
   assigns

   1. A"array[12]" the value of 3
      
   2. B"array[13]" the value of 3
      
   3. C"array[12]" the value of 4
      
   4. D"array[13]" the value of 4
      
   5. ENone of the above
      
9. 9This example of a compound assignment, "x = 12; array[x += 2] = 5;",
   

   1. Ais not allowed.
      
   2. Bassigns "array[12]" the value of 5
      
   3. Cassigns "array[14]" the value of 5
      
   4. Dassigns "x" the value of 7
      
   5. ENone of the above
      
10. 10Which of the following are not used for
    either input or output in C?

    1. Ascanf
       
    2. Bgetc
    3. Cprintf
    4. Dfprintf
    5. ENone of the above
       

11. 11Which of the following are used for input in C?
    

    1. Ascanf
    2. Bgetc
    3. Cprintf
    4. Dfprintf
    5. ENone of the above
       
12. 12Which of the following are used for output in C?
    

    1. Ascanf
    2. Bgetc
    3. Cprintf
    4. Dfprintf
    5. ENone of the above
       
13. 13All C programs should contain a "main"
    function with a signature matching

    1. Avoid main(char* argv[])
       
    2. Bint main(string argv[])
       
    3. Cvoid main(int argc, string argv[])
       
    4. Dint main(int argc, char* argv[])
       
    5. ENone of the above
       
14. 14The int value returned by the "main" function is used to indicate
    

    1. Awhether or not the program terminated normally.
       
    2. Bnothing, this is a holdover from early Unix that is no longer used.
       
    3. Chow long (in milliseconds) the program took to complete.
       
    4. Dthe error a program experienced if there was a problem.
       
    5. ENone of the above
       
15. 15Function declarations in C must always have
    

    1. Aan implementation given as part of the declaration.
       
    2. Bonly primitive types given as formal parameters.
       
    3. Ca non-empty set of formal parameters.
       
    4. Da non-void return type.
       
    5. ENone of the above
       
16. 16Function declarations (though not necessarily their implementations) in C
    

    1. Amust be given inside of a class definition.
       
    2. Bmust appear within the source code file in
       which they are used.
       
    3. Ccan be nested within another function's implementation/body.
       
    4. Dmust be given in a separate file
       (a ".h" file) from their implementation.
       
    5. ENone of the above
       
17. 17Function implementations in C
    

    1. Acannot be given within another function's implementation/body.
       
    2. Bbegin with the "function" reserved keyword, if given separate from the
       function declaration.
       
    3. Cmust always be given at the same time the
       function is declared.
    4. Dappear within curly braces (i.e., { }) directly after the function
       signature.
       
    5. ENone of the above
       
18. 18A "static" variable declaration within a function
    

    1. Areserves space for the variable apart from the run-time stack.
       
    2. Ballows the variable to be accessed outside of the function implementation.
       
    3. Censures that only one version of the variable exists, so that recursive
       calls to the function share the exact same variable storage.
    4. Dis optional as all variables within function
       implementations are treated as "static" by default.
       
    5. ENone of the above
       
19. 19Variables declared as "static"
    

    1. Amay only appear within a function implementation.
       
    2. Bcan be accessed outside the scope of the function in which it is declared.
       
    3. Ccannot change their values (i.e., they're constants).
       
    4. Dhave space for their values reserved outside of the run-time stack.
       
    5. ENone of the above
       
20. 20Large C programs are often broken up into files ending with ".c" and ".h",
    but

    1. A".c" files must contain only function
       implementations.
    2. B".h" files should contain declarations used by multiple ".c" files.
    3. Cthe "#include" directives allow ".c" files to use the declarations in the
       named ".h" file.
    4. Dvariables should never be delcared in a
       ".h" file.
    5. ENone of the above
       
21. 21The "extern" declaration in C is
    

    1. Aused to declare variables without setting
       aside storage space.
    2. Bimplicit for all function declarations.
       
    3. Cused for variables declared within a function so that they can be accessed
       outside of the function.
    4. Dhave space for their values reserved outside of the run-time stack.
       
    5. ENone of the above
       
22. 22Arrays in C are indexed starting with
    

    1. A-1
    2. B0
    3. C1
    4. Dthe value indicated when they are declared.
       
    5. ENone of the above
       
23. 23The index given for an array reference in C
    

    1. Aonly needs to be checked at compile time to ensure
       that it's within range.
    2. Bis always checked at
       run time to ensure that it's within range.
       
    3. Cnever needs to be checked as it is
       always within range.
    4. Dis not checked since it doesn't have to
       be within its range.
    5. ENone of the above
       
24. 24A "string" value in C is really an array of type "char".
    So the

    1. Astring value needs to be null terminated.
       
    2. Barray must be exactly as long as the
       desired string.
       
    3. Carray should be at least one char longer than the desired string.
       
    4. Dprogramer must use another variable to
       keep track of the length of the string.
    5. ENone of the above
       
25. 25If an array index in C is outside the bounds of the array, then
    

    1. Aan error may or may not occur as a result of accessing the array element.
       
    2. Ban error always occurs and the program
       stops execution.
    3. Cthere may or may not be accessible storage associated with that array
       location.
    4. Dthere is always accessible storage
       associated with that array location.
       
    5. ENone of the above
       
26. 26The declaration of an array (e.g., variables, function formal parameters)
    must always include the

    1. Astarting index of the array.
       
    2. Bsize of the array.
       
    3. Ccorresponding "#define" declaration for the array size.
       
    4. Dtype of the array elements.
       
    5. ENone of the above
       
27. 27Arrays in C
    

    1. Agrow dynamically as more items are added (similar to
       ArrayLists in Java).
    2. Balways have an associated length that can
       be queried to determine the number of items in the array.
       
    3. Care polymorphic, meaning that any mix of items can be stored in the same
       array.
    4. Dare really just pointers to their item type
       (e.g., "int x[]" and "int *x" are the same).
       
    5. ENone of the above
       
28. 28A pointer is another name for the
    

    1. Atype of values that can be assigned to a variable.
       
    2. Bforward declaration of a function.
       
    3. Cdeclaration of a "struct"ure.
       
    4. Daddress of the memory location holding a desired value.
       
    5. ENone of the above
       
29. 29In C, pointers are declared
    

    1. Aonly for declarations of arrays.
       
    2. Bby giving an asterisk (*) before the variable name declaration.
       
    3. Cby giving an ampersand (&) before the variable name declaration.
       
    4. Dfor all formal parameters of functions.
       
    5. ENone of the above
       
30. 30In C, if "x" and "y" are declared by "int x, *y;", then "y = &x;"
    

    1. Ais undefined.
       
    2. Bassigns "y" the value of "x".
       
    3. Cmakes "y" an alias for "x" so that any value assigned to one is
       automatically assigned to the other.
       
    4. Dassigns "y" the memory address where the value for "x" is located.
       
    5. ENone of the above
       
31. 31This array declaration in C, "char name[10];",
    

    1. Areserves 10 contiguous bytes (characters) of storage for "name".
       
    2. Bis equivalent to the declaration "string name;".
       
    3. Cdeclares "name" as a pointer to the reserved storage.
       
    4. Ddeclares each element of the array "name" as a pointer to a "char".
       
    5. ENone of the above
       
32. 32Which of the following declarations in C is equivalent to "char *var;"?
    

    1. Achar &var;
       
    2. Bchar var[10];
       
    3. Cchar var[];
       
    4. Dchar &var[];
       
    5. ENone of the above
       
33. 33Strings in C are represented as an array of "char"acters
    

    1. Awith the length kept separately so that the size of the string is known
       (e.g., when printing).
    2. Bthat are terminated by a null value to denote their end.
       
    3. Cand can be referenced via a "char"acter pointer (e.g., "char *").
       
    4. Dwhich are immutable, so that the value cannot be changed (only copied).
       
    5. ENone of the above
       
34. 34The address operator in C, ampersand (&),
    

    1. Aconverts a variable into a pointer, so that "&y" makes "y" a pointer to an
       "int" when "y" was declared via "int y;".
    2. Bis only used when passing parameters.
       
    3. Creturns the memory address of any expression it is applied to
       (e.g., "&(2*x + 3)").
    4. Dreturns the memory address of the variable it is applied to (e.g., "&x").
       
    5. ENone of the above
       
35. 35In C, if the following declaration/initialization is made,
    "int *x = &y;", then "x++"

    1. Amakes "x" point to the next address in memory (following "y") that can hold
       an "int" value.
    2. Bis undefined and causes a compilation error.
    3. Cis defined but causes a run-time error.
       
    4. Dincreases the value of "y" by 1.
       
    5. ENone of the above
       
36. 36A "struct" declaration in C can group together
    

    1. Amultiple data items.
       
    2. Bdata of the same type.
       
    3. Cdata of different types.
       
    4. DNone of the above
       
37. 37A "struct" declaration in C always creates
    

    1. Aa new type name that can be used in declaring variables (e.g.,
       "person bob;").
    2. Ba named structure form that can be referred to by "struct" followed by the
       structure name (e.g., "struct person").
    3. Ca recursive structure so that linked structures (e.g., lists, graphs) can
       be coded.
    4. Da non-recursive structure since recursive structures
       must be declared as types instead
       of "struct"s.
    5. ENone of the above
       
38. 38A self-recursive "struct" requires that at least one of its elements be
    declared as

    1. A"struct NAME", where "NAME" is the name given the "struct" and the pointer
       type is inferred.
    2. B"struct NAME *", where "NAME" is the name given the "struct".
       
    3. C"struct" where the current structure and pointer type are
       inferred.
    4. D"struct *" where the current structure name is inferred.
       
    5. ENone of the above
       
39. 39The "typedef" declaration in C declares the new type NAME
    corresponding to a specified TYPE_DESCRIPTION (either an existing
    type name or other type specification -
    such as a "struct") via

    1. A"typedef NAME = TYPE_DESCRIPTION;"
       
    2. B"typedef TYPE_DESCRIPTION NAME;"
       
    3. C"typedef NAME TYPE_DESCRIPTION;"
       
    4. D"NAME = typedef TYPE_DESCRIPTION;"
       
    5. ENone of the above
       
40. 40Assuming the legal C variable declaration "person bob;" then the following
    declaration must also have been previously
    given ("..." represents other appropriate declarations):

    1. A"struct bob { ... };"
       
    2. B"typedef struct person { ... } bob;"
       
    3. C"typedef struct bob bob;"
       
    4. D"typedef person bob;"
       
    5. ENone of the above
       
41. 41Assuming the legal C variable declaration "person bob;" then the following
    declaration must also have been
    previously given ("..." represents other appropriate declarations):

    1. A"struct person { ... };"
       
    2. B"typedef struct { ... } person;"
       
    3. C"typedef struct person bob;"
       
    4. D"typedef person bob;"
       
    5. ENone of the above
       
42. 42Given the following legal C declarations
    typedef struct node {
    int x;
    struct node *next;
    } *nodeType;

    1. A"nodeType" is a type equivalent to "struct node".
       
    2. B"nodeType" is a type equivalent to the type of the "next"
       field.
    3. C"nodeType" is not a type,
       but really a variable of type "struct node".
       
    4. D"nodeType" is not a type,
       but really a variable of type pointer to a "struct node".
       
    5. ENone of the above
       
43. 43In C, the standard way to request heap storage space while a program is
    running is to use the function

    1. Agetmem
    2. Bnew
    3. Cmalloc
    4. Dheap_request
    5. ENone of the above
       
44. 44The standard way in C to return heap storage that was previously allocated
    is to use the function

    1. Adelete
    2. Breturn
    3. Cfree
    4. Dputmem
    5. ENone of the above
       
45. 45In C, it is possible to determine the size of a type
    (in bytes) by using the function

    1. Agetsize
    2. Bsizeof
    3. CsizeOfType
    4. DtypeSize
    5. ENone of the above
       
46. 46Which of the following C statements is a typical way that dynamic storage
    might be allocated?

    1. Aint x = new int();
       
    2. Bint *x = (int) getmem(int);
       
    3. Cint x = malloc(typeSize(int));
       
    4. Dint *x = (int*) malloc(sizeof(int));
       
    5. ENone of the above
       
47. 47An operating system (OS) provides
    

    1. Aa clean and simple model of the computer.
       
    2. Bmanages the computer's resources.
       
    3. Csupport for the creation and use of user programs.
       
    4. Dan abstract view of the computer, independent of the specific hardware.
       
    5. ENone of the above
       
48. 48Which of the following are program types in an
    operating system (OS)?

    1. ASystem programs
       
    2. BAdventure games.
       
    3. CApplication programs
       
    4. DCAPTCHAs (Completely Automated Public Turing test to tell
       Computers and Humans Apart).
    5. ENone of the above
       
49. 49Which of the following are layers within an
    operating system (OS)?

    1. AMachine language
       
    2. BCommand interpreter (shell)
       
    3. CPhysical devices
       
    4. DMicrocode
       
    5. ENone of the above
       
50. 50The operating system (OS) is that part of the system which
    

    1. Aimplements the editors, compilers, and interpreters used to
       create other programs.
    2. Bprovides the command line interpreter (e.g., shell) for users.
    3. Ccomes pre-loaded on purchased computer hardware.
       
    4. D runs in supervisor (or kernel) mode.
       
    5. ENone of the above
       
51. 51When viewed as an abstract machine, the operating system (OS)

    1. Aenables Windows and Unix to run at the same time.
       
    2. Bhides the details of lower level facilities (e.g., writing data to disk).
       
    3. Coperates exactly the way a Turing machine does.
       
    4. Dprovides the implementations for data abstractions (e.g., stack,
       queue) leveraged by user programs.
    5. ENone of the above
       
52. 52When viewed as a resource manager, the operating system (OS)
    

    1. Acoordinates the sharing of parts of the computer by different programs.
       
    2. Benables different programs to share the computer hardware.
       
    3. Cdetermines when more memory or disk should be purchased.
       
    4. Densures that the computer hardware is utilized with optimal
       efficiency regarding every user's needs.
    5. ENone of the above
       
53. 53The most common small computer architecture is the
    

    1. Apacket switched.
       
    2. Bbus
    3. Ccircuit switched.
       
    4. Dfully connected backplane.
       
    5. ENone of the above
       
54. 54Match the components in the below diagram (indicated by the letters A-G) of a typical small computer system to their names. [Note: No choice is
    used more than once, and some may not be used.]
    
    [blank_start]______[blank_end] A
    ______ B
    ______ C
    ______ D
    ______ E
    ______ F
    ______ G

    1. ACPU
    2. BMemory
    3. CInput and Output
    4. DControl bus (or Data bus)
    5. EAddress bus
    6. FSystem bus
55. 55The system bus on a small computer system is typically composed of the
    

    1. Acontrol bus.
       
    2. Baddress bus
       
    3. Cdata bus.
       
    4. Dmemory bus.
       
    5. ENone of the above
       
56. 56A bus architecture typically allows
    

    1. Aonly a single pair of components to communicate at a time.
       
    2. Bone or two different pairs of components to communicate simultaneously.
       
    3. Cup to three different components (<strong>not</strong> pairs) to
       communicate simultaneously.
    4. Dall components to communicate simultaneously.
       
    5. ENone of the above
       
57. 57The internet is an example of a
    

    1. Apacket switched architecture.
       
    2. Bbus architecture.
       
    3. Ccircuit switched architecture.
       
    4. Dfully connected architecture.
       
    5. ENone of the above
       
58. 58A computer processor is commonly composed of
    

    1. Aan instruction fetch unit.
       
    2. Ban instruction decoder.
       
    3. Can arithmetic logic unit.
       
    4. Da memory interface.
       
    5. ENone of the above
       
59. 59Registers in those processors which utilize them
    

    1. Aare always grouped into sets of
       "register windows".
    2. Bare sometimes dedicated to specific
       purposes (e.g., program counter, stack pointer).
       
    3. Care always general purpose, meaning
       they can be used for any activity needing to use a register.
       
    4. Dusually have the same number of bits as the address bus.
    5. ENone of the above
       
60. 60Processor designs that can speed up computation include:

    1. Apipelining
    2. Bmulti-register
       
    3. Chyperthreaded
    4. Dmulti-core
       
    5. ENone of the above
       
61. 61The memory hierarchy in computer design primarily reflects the
    

    1. Adesire to reduce single points of failure.
       
    2. Btradeoff between speed and cost for a given amount of memory.
       
    3. Cdifference between volatile and non-volatile memory technologies.
       
    4. Dlarge amounts of certain types of memories.
       
    5. ENone of the above
       
62. 62A hard disk drive (HDD) can have access times that are
    

    1. Aup to 10 million times slower than a register.
       
    2. B10-100 times slower than a solid state disk (SSD).
       
    3. Conly 100 times slower than main memory (e.g., RAM).
       
    4. D1 million times slower than main memory (e.g., RAM).
       
    5. ENone of the above
       
63. 63Physical devices are accessed via their
    

    1. Acorresponding user level resource managers.
       
    2. Bassociated (physical) controllers.
       
    3. Cdevice drivers by the operating system (OS).
       
    4. Dassociated command interpreter (e.g., shell) programs.
       
    5. ENone of the above
       
64. 64Which of the following are device communications styles used by
    operating systems?

    1. ANotify and Sleep
       
    2. BBusy waiting
       
    3. CInterrup driven
       
    4. DDirect Memory Access
       
    5. ENone of the above
       
65. 65Approaches currently in common use for "installing" a new device driver
    include

    1. Arelinking the device driver object code with the OS kernel.
       
    2. Badding the device driver file to an OS config and rebooting.
       
    3. Cadding the ".h" file to the OS config, recompiling the kernel,
       and then rebooting the system.
    4. Ddynamically loading the device driver code (no reboot).
       
    5. ENone of the above
       
66. 66Device drivers that start an I/O then sit in a tight loop, checking to
    see when the operation is complete are using the

    1. ADirect Memory Access communication style.
       
    2. BNotify and Sleep communication style.
       
    3. CBusy waiting communication style.
       
    4. DInterrup driven communication style.
       
    5. ENone of the above
       
67. 67Device drivers that start an I/O but then block, returning control so
    that other work can be done until the driver is awakened by an
    interrupt are using the

    1. ANotify and Sleep communication style.
       
    2. BBusy waiting communication style.
       
    3. CInterrup driven communication style.
       
    4. DDirect Memory Access communication style.
       
    5. ENone of the above
       
68. 68Device drivers that utilize special hardware to initiate and complete
    an entire data transfer are using the

    1. ANotify and Sleep communication style.
       
    2. BBusy waiting communication style.
       
    3. CInterrup driven communication style.
       
    4. DDirect Memory Access communication style.
       
    5. ENone of the above
       
69. 69While the operating system (OS) is handling an interrupt
    

    1. Aall other interrupts are disabled to
       ensure it completes.
    2. Bonly higher-priority interrupts are enabled.
       
    3. Call interrupts continue to be enabled,
       since none should be missed.
    4. Donly interrupts of the same kind are enabled.
       
    5. ENone of the above
       
70. 70The boot process for most small computer systems begins with the
    execution of the

    1. Ahard disk drive device driver to allow loading of the OS executable file.
       
    2. BBasic Input/Output System (BIOS).
       
    3. COS executable file directly from the boot device (e.g., HDD, SSD).
       
    4. DGRand Unified Bootloader (GRUB).
       
    5. ENone of the above
       
71. 71The system calls that an OS makes available
    

    1. Acan only be used by the OS.
       
    2. Bmust never be used by the OS
       
    3. Care the OS interface for user programs.
       
    4. Dare provided as a convenience, but aren't really necessary.
       
    5. ENone of the above
       
72. 72The difference(s) between a program and a process are
    

    1. Aprograms are static (non-executing).
       
    2. Bprograms are never part of the
       operating system.
    3. Cprocesses also contain a run-time stack and program counter.
       
    4. Dprocesses make use of system calls, but programs don't.
       
    5. ENone of the above
       
73. 73A process
    

    1. Amust use system calls to accomplish
       anything useful.
    2. Busually only directly communicates with its parent (or child) process(es).
       
    3. Cmay create a child process.
       
    4. Dcannot use system calls unless it is being run by the
       administrator/root user.
    5. ENone of the above
       
74. 74When a problem or unusual condition is encountered, a process can send
    signals to other processes. Processes receiving a signal

    1. Aare required to provide a signal handler.
       
    2. Bcan specify specific functions to be called when a particular
       type of signal is received.
    3. Crun the function named "sighand" to handle the signal.
       
    4. Drun the specified signal handler function, which takes over
       execution when the signal is received.
    5. ENone of the above
       
75. 75Every process is limited by the restrictions placed upon it by the
    OS as determined by the process' associated

    1. Aprogramming language in which the code was written.
       
    2. Bprogram source code file.
       
    3. Cworking directory in the file system.
       
    4. Duser identification (uid).
       
    5. ENone of the above
       
76. 76The address space of a process
    

    1. Ais the size of the program file for the process.
       
    2. Bis the range of addressable bytes starting at 0 up to a maximum, usually
       2^N - 1 (where N is the number of address bits).
    3. Cis the amount of main memory initially
       requested/needed by the process.
    4. Dcan be broken into smaller chunks so that programs larger than
       the amount of main memory can be executed.
    5. ENone of the above
       
77. 77System calls must be used to create new
    

    1. Aprocesses.
       
    2. Buser accounts.
       
    3. Cprograms.
       
    4. Dfiles or directories.
       
    5. ENone of the above
       
78. 78Every process has an associated
    

    1. Asystem call for accessing it.
       
    2. Bworking directory in the file system.
       
    3. Cuser identification (uid).
       
    4. Daddress space.
       
    5. ENone of the above
       
79. 79A file descriptor is a unsigned number that processes use to reference
    (e.g., read, write)

    1. Afiles that the process currently has open.
       
    2. Bany file in the file system that the process is permitted to access/open.
       
    3. Centries in the process' table of active/open files.
       
    4. Dall directories with the same user
       identification (uid) as the process.
       
    5. ENone of the above
       
80. 80In addition to normal user files (e.g., text files) there are
    also special files that enable

    1. Ausers to create new file systems.
       
    2. Bhard disk drives (HDDs) to look like files.
       
    3. Ckeyboards and mice to look like files.
       
    4. Dprocesses to directly communicate with one another.
       
    5. ENone of the above
       
81. 81Every OS has an I/O subsystem that
    

    1. Aimplements the details of all read/write
       operations.
    2. Bperforms all of the cryptographic functions.
       
    3. Cmanages the devices attached to the computer.
       
    4. Denforces all of the OS security measures.
       
    5. ENone of the above
       
82. 82The command interpreter which provides the non-GUI interface to the OS is
    

    1. Aan ordinary program that uses system calls to access the
       capabilities of the OS.
    2. Ba special program that directly implements all
       of the available commands.
    3. Coften called the "shell".
       
    4. Dunique, with each system having only one such program available.
       
    5. ENone of the above
       
83. 83Which system organization is best described
    as having: a set of service procedures that perform system calls;
    utility procedures to assist in service procedure implementation;
    and a main program that calls requested service procedures?

    1. AMonolithic System
       
    2. BLayered System
       
    3. CMicorkernel
       
    4. DClient-Server
       
    5. ENone of the above
       
84. 84Which system organization is best described
    as a sequence of abstractions built one on top of the other?

    1. ALayered System
       
    2. BMicorkernel
    3. CExokernel
       
    4. DClient-Server
       
    5. ENone of the above
       
85. 85Which system organization is best described
    as having the absolute minimal portion of the OS facilities running
    in kernel/supervisor mode, with the remaining portions running in
    user mode?

    1. ALayered System
       
    2. BMicorkernel
       
    3. CExokernel
    4. DClient-Server
       
    5. ENone of the above
       
86. 86Which system organization best enables the
    clean separation of policy and mechanism?

    1. ALayered System
       
    2. BMicorkernel
    3. CExokernel
       
    4. DClient-Server
       
    5. ENone of the above
       
87. 87Which system organization is best suited
    for distributed systems?

    1. AMonolithic System
       
    2. BLayered System
       
    3. CMicorkernel
       
    4. DClient-Server
       
    5. ENone of the above
       
88. 88Which of the following are examples of a layered OS?
    

    1. AMinix v1
       
    2. BTHE
    3. CWindows NT
       
    4. DMULTICS
       
    5. ENone of the above
       
89. 89Which of the following are examples of a microkernel OS?
    

    1. AMinix v1
       
    2. BTHE
    3. CWindows NT
       
    4. DMULTICS
       
    5. ENone of the above
       
90. 90A virtual machine is designed to
    

    1. Amimic any type of hardware so that older software can be run.
       
    2. Bprovide "copies" of the existing hardware so that multiple
       operating systems can be run at the same time.
    3. Callow the remote (aka "virtual") execution of programs on
       non-local hardware.
    4. Denable the use of virtual memory to run processes that require
       a larger address space than is otherwise supported by the hardware.
       
    5. ENone of the above
       
91. 91An OS that runs directly on the hardware with other OSes running on top
    of it, is called a(n)

    1. Atype 1 hypervisor.
       
    2. Btype 2 hypervisor.
       
    3. Cexokernel.
       
    4. Dmicrokernel
    5. ENone of the above
       
92. 92An OS that runs on top of a host OS (that in turn is running on top of
    the physical hardware), and which can host other OSes running on top of
    it, is called a(n)

    1. Atype 1 hypervisor.
       
    2. Btype 2 hypervisor.
       
    3. Cexokernel
    4. Dmicrokernel
    5. ENone of the above
       
93. 93Software that divides up the underlying physical hardware so that each
    running OS has sole access to its assigned hardware is called a(n)

    1. Atype 1 hypervisor.
       
    2. Btype 2 hypervisor.
       
    3. Cexokernel
    4. Dmicrokernel
    5. ENone of the above
       
94. 94A type 1 hypervisor
    

    1. Aruns directly on the hardware and the operating systems run in
       the hypervisor.
    2. Bruns on top of the host OS (which is running directly on the
       hardware). Additional operating systems run in the hypervisor.
    3. Cdivides the hardware up into slices, with each OS running
       directly on the hardware. It ensures that each OS
       only uses the parts of the hardware is was assigned.
    4. Dprovides a microkernel used by each of the operating systems
       running in the hypervisor. Each OS uses the microkernel
       system calls to interact with the hardware.
    5. ENone of the above
       
95. 95A type 2 hypervisor
    

    1. Aruns directly on the hardware and the operating systems run in
       the hypervisor.
    2. Bruns on top of the host OS (which is running directly on the
       hardware). Additional operating systems run in the hypervisor.
       
    3. Cdivides the hardware up into slices, with each OS running
       directly on the hardware. It ensures that each OS
       only uses the parts of the hardware is was assigned.
    4. Dprovides a microkernel used by each of the operating systems
       running in the hypervisor. Each OS uses the microkernel
       system calls to interact with the hardware.
    5. ENone of the above
       
96. 96An exokernel is different from a virtual machine in that it
    

    1. Aruns directly on the hardware and the operating systems run in
       the hypervisor.
    2. Bruns on top of the host OS (which is running directly on the
       hardware). Additional operating systems run in the hypervisor.
       
    3. Cdivides the hardware up into slices, with each OS running
       directly on the hardware. It ensures that each OS
       only uses the parts of the hardware is was assigned.
    4. Dprovides a microkernel used by each of the operating systems
       running in the hypervisor. Each OS uses the microkernel
       system calls to interact with the hardware.
    5. ENone of the above
       
97. 97Which of the following mechanisms for running multiple operating systems
    make the most efficient use of the common underlying physical hardware?

    1. Atype 1 hypervisor
       
    2. Btype 2 hypervisor
       
    3. Cmicrokernel
       
    4. Dexokernel
    5. ENone of the above
       
98. 98The illusion that multiple processes are running at the same time is
    known as

    1. Aparallelism
    2. Bpseudoparallelism
    3. Chyperthreading
    4. Dmultiprocessing
    5. ENone of the above
       
99. 99Pseudoparallelism is commonly achieved on a single processor system by
    

    1. Aletting each process run to completion.
       
    2. Bexecuting each process until it blocks before running the next process.
       
    3. Crunning exactly one instruction from each process in
       round-robin fashion.
    4. Drapidly switching of the CPU between processes (multiprogramming).
       
    5. ENone of the above
       
100. 100A process is
     

     1. Aanother name for a program.
        
     2. Bthe compiled (executable) version of a program.
        
     3. Ca program in execution.
        
     4. Da program that is either running (in the CPU) or ready, but
        not blocked.
     5. ENone of the above
        
101. 101Existing processes in a Unix/Linix/POSIX system can be viewed using
     which command/facility?

     1. Atask manager
        
     2. Bpwd
     3. Cps
     4. DlistAll
     5. ENone of the above
102. 102Existing processes in a (Microsoft) Windows system can be viewed using
     which command/facility?

     1. Atask manager
        
     2. Bpwd
     3. Cps
     4. DlistAll
     5. Enone of the above
103. 103Which of the following are voluntary reasons for
     a process to terminate/exit?

     1. ANormal
     2. BError
     3. CFatal
     4. DKilled
     5. ENone of the above
        
104. 104Which of the following are INvoluntary reasons
     for a process to terminate/exit?

     1. AKilled
     2. BNormal
     3. CError
     4. DFatal
     5. ENone of the above
        
105. 105Processes in a POSIX system exist as a hierarchy because
     

     1. Aeach process corresponds to a program file (and files are hierarchical).
        
     2. Bexcept for the first process, all other
        processes are created by an existing process.
        
     3. Ceach process corresponds to a user identification, and uids are
        arranged hierarchically.
     4. Dof the time frames in which they were created.
        
     5. ENone of the above
        
106. 106Which of the following is not a state
     in which an executing process can exist?

     1. ARunning
     2. BBlocked
     3. CReady
     4. DWaiting
     5. ENone of the above
        
107. 107Which of the following is not a
     transition between process states?

     1. Arunning to blocked
        
     2. Brunning to ready
        
     3. Cready to running
        
     4. Dblocked to running
        
     5. ENone of the above
        
108. 108Which of the following transition(s) are accomplished by the scheduler?
     

     1. Arunning to blocked
        
     2. Brunning to ready
        
     3. Cready to running
        
     4. Dready to blocked
        
     5. ENone of the above
109. 109Which of the following transition(s) occur as the result of receiving
     a signal?

     1. Aready to blocked
        
     2. Bblocked to ready
        
     3. Crunning to ready
        
     4. Dready to running
        
     5. ENone of the above
        
110. 110Which of the following transition(s) are accomplished when an I/O
     operation is completed?

     1. Arunning to blocked
        
     2. Brunning to ready
        
     3. Cblocked to running
        
     4. Dblocked to ready
        
     5. ENone of the above
        
111. 111Which state is a process in when it terminates normally?
     

     1. ARunning
     2. BBlocked
     3. CReady
     4. DWaiting
        
     5. ENone of the above
        
112. 112Which state does a process first start in when it is created?
     

     1. ARunning
     2. BBlocked
     3. CReady
     4. DWaiting
     5. ENone of the above
        
113. 113The process table is an array with each entry containing
     

     1. Athe file of the corresponding program.
        
     2. Bonly the current program counter for that process.
        
     3. Conly the process id number for that process.
        
     4. Dall of the associated information for a
        single process.
     5. ENone of the above
        
114. 114A process that has been started but has not
     yet terminated, is represented by an entry in the process table when
     the process is in which of the following states?

     1. ARunning
     2. BBlocked
     3. CReady
     4. DWaiting
     5. ENone of the above
        
115. 115The POSIX system call that creates a new process is called
     

     1. Anew
     2. Bcreate
     3. Cdup
     4. Dfork
     5. ENone of the above
        
116. 116The family of POSIX system calls that replace the current process with a
     new one is called

     1. Areplace
     2. Bexec
     3. Cdup2
     4. Dgetpid
     5. ENone of the above
        
117. 117The POSIX system call that causes a parent process to wait for a specific
     child process to finish is called

     1. Await
     2. Bwaitpid
     3. Cfini
     4. Ddone
     5. Egetpid
118. 118The POSIX system call, signal is used to
     

     1. Asend a signal to another process.
        
     2. Bdeclare what signals may be sent to a process.
        
     3. Crespond back to a signal sent from another process.
        
     4. Dindicate which function should be called when a particular
        signal is received by the process.
     5. ENone of the above
        
119. 119The POSIX system call that moves a running process to the blocked state
     is called

     1. Await
     2. Bbreak
     3. Cpause
     4. Dblock
     5. ENone of the above
        
120. 120Threads are also commonly referred to as
     

     1. Ahyperthreads
     2. Blightweight processes
        
     3. Cexecution traces
        
     4. Dshared libraries
        
     5. ENone of the above
        
121. 121When compared to processes, threads
     

     1. Aare more limited in the size of their address space.
        
     2. Bcannot be used for multiprogramming.
        
     3. Ctake the same amount of time for a context switch.
        
     4. Dcan be created and destroyed 10-100 times faster.
        
     5. ENone of the above
        
122. 122Each thread must maintain its own
     

     1. Aaddress space.
        
     2. Bprogram counter.
        
     3. Crun-time stack.
        
     4. Dstate (blocked, ready, running).
        
     5. ENone of the above
        
123. 123Every process contains at least
     

     1. Aone thread.
        
     2. Btwo threads, one each for execution and garbage collection.
        
     3. Cthree threads, for execution, signal management, and garbage collection.
        
     4. Done child process.
        
     5. ENone of the above
        
124. 124Which of the following items belong to the process (rather than to
     each of its threads)?

     1. AProgram counter
        
     2. BAddress space
        
     3. CStatic variables
        
     4. DRun-time stack
        
     5. EHeap storage
        
     6. FRegisters
     7. GFile descriptors
        
     8. HSignal handlers
        
     9. IState (blocked, ready, running)
        
     10. JNone of the above
         
125. 125Which of the following items belong to each thread (rather than to
     the process)?

     1. AProgram counter
        
     2. BAddress space
        
     3. CStatic variables
        
     4. DRun-time stack
        
     5. EHeap storage
        
     6. FRegisters
        
     7. GFile descriptors
        
     8. HSignal handlers
        
     9. IState (blocked, ready, running)
        
     10. JNone of the above
         
126. 126Because the address space is shared by the process' threads, care
     must be taken (to avoid race conditions)
     when

     1. Acalling the same function from multiple threads.
        
     2. Breading/setting values for the same static variables and heap
        allocated objects from multiple threads.
     3. Ccreating new threads.
        
     4. Da thread terminates.
        
     5. ENone of the above
        
127. 127The POSIX pthread library call that creates a new thread is called
     

     1. Apthread_new
     2. Bpthread_fork
     3. Cpthread_create
     4. Dpthread_dup
     5. ENone of the above
        
128. 128The POSIX pthread library call that returns the thread's identification is
     called

     1. Apthread_getid
     2. Bpthread_self
     3. Cpthread_pid
     4. Dpthread_thread_id
     5. ENone of the above
        
129. 129The POSIX pthread library call that terminates the calling thread is called
     

     1. Apthread_exit
        
     2. Bpthread_terminate
     3. Cpthread_yield
     4. Dpthread_return
     5. ENone of the above
        
130. 130The POSIX pthread library call that blocks the calling thread, resuming
     when the indicated thread completes, is called

     1. Apthread_wait
     2. Bpthread_block
     3. Cpthread_pause
     4. Dpthread_join
     5. ENone of the above
        
131. 131The POSIX pthread library call that moves a running thread to the blocked
     state is called

     1. Apthread_block
     2. Bpthread_yield
     3. Cpthread_stop
     4. Dpthread_pause
     5. ENone of the above
        
132. 132Threads that are managed in user/process space
     

     1. Arequire the OS to be thread aware.
        
     2. Brequire the process to keep track of the threads via a thread
        table (in addition to the process table that the OS maintains).
        
     3. Cenable context switching that is about 10x faster than kernel space threads.
        
     4. Dcause the entire process to block if any one of its threads blocks
        for a system resource.
     5. ENone of the above
        
133. 133Threads that are managed in kernel space
     

     1. Arequires the OS to be thread aware.
        
     2. Brequires the process to keep track of the threads via a thread
        table (in addition to the process table that the OS maintains).
        
     3. Cenables context switching that is about 10x faster than
        user/process space threads.
        
     4. Dcause the entire process to block if any one of its threads blocks
        for a system resource.
     5. ENone of the above
        
134. 134Thread pools are collections of already allocated/created threads that
     

     1. Aare assigned as requested to reduce the costs of thread creation
        and destruction.
     2. Bare only beneficial for user/process space managed threads.
        
     3. Care only beneficial for kernel space managed threads.
        
     4. Dprevent an over abundance of threads, if the pool is the only
        means for acquiring a thread.
     5. ENone of the above
        
135. 135Hybrid User-Kernel space thread management allocates
     

     1. Aone or more kernel threads to a process, with the process able
        to start multiple user threads within each kernel thread.
     2. Bexactly one user space and one kernel space thread to each process.
        
     3. Cany number of user space and kernel space threads to each process as long as
        they are requested from the corresponding user and kernel thread pools.
     4. Donly user space threads, but enables the kernel to recognize when
        a user thread is blocked.
     5. ENone of the above
        
136. 136Scheduler activations use
     

     1. Akernel space threads, but only the process schedules them.
        
     2. Bkernel space threads, but the process recommends to the OS
        which thread to schedule/run next.
     3. Cuser space threads, but the kernel recognizes when a blocked
        thread doesn't prevent other threads from running.
     4. Dboth user and kernel space threads for a process, with each
        thread type being scheduled as it normally would be.
     5. ENone of the above
        
137. 137The key issues for interprocess communication are
     

     1. Amessage passing.
        
     2. Bsharing information.
        
     3. Csemaphores
     4. Dsequencing process interactions.
        
     5. ENone of the above
        
138. 138A race condition exists when
     

     1. Atwo or more processes share the same variable.
        
     2. Bonly user space threads are used for multiprogramming.
        
     3. Conly kernel space threads are used for multiprogramming.
        
     4. Ddifferent execution orderings of instructions in multiple threads/processes
        can produce different results.
     5. ENone of the above
        
139. 139Race conditions can occur when
     

     1. Atwo or more threads/processes can read (but
        not change) the same variable(s).
     2. Btwo or more threads/processes can read and write the same
        variable(s) via UNinterruptible actions.
     3. Ctwo or more threads/processes can read and write the same
        variable(s) via interruptible actions.
     4. Dwhen there is a mix of user space and kernel space threads
        within the same process, but no shared variable(s).
     5. ENone of the above
        
140. 140A critical section is a portion of executable code
     

     1. Athat makes system calls.
        
     2. Bin which only one thread (or process) should be active at a time.
        
     3. Cthat is protected by one or more semaphores.
        
     4. Dwhich is shared by multiple threads.
        
     5. ENone of the above
        
141. 141Critical sections should be as small as possible because
     

     1. Alarger critical sections run more slowly.
        
     2. Bthis reduces the amount of process blocking.
        
     3. Cthere is a maximum code size for which semaphores will work.
        
     4. Dthey must run completely through
        without blocking.
     5. ENone of the above
        
142. 142Which of the following help to prevent difficulties when simultaneous
     threads/processes share data?

     1. ANo 2 threads/processes are in their critical sections at the same time.
        
     2. BNo assumptions are made about process execution speeds.
        
     3. CNo thread/process should wait arbitrarily long to enter its
        critical section.
     4. DNo thread/process outside its critical section should block other
        threads/processes.
     5. ENone of the above
        
143. 143Allowing processes to disable interrupts to prevent their being
     interrupted while in their critical section(s) is
     not a desirable solution since

     1. Ait requires process threads to run in kernel space.
        
     2. Bit requires process threads to run in user space.
        
     3. Ca user program could use this to hog the CPU.
        
     4. Dit fails to work if there are multiple CPUs.
        
     5. ENone of the above
        
144. 144Strict alternation of processes can be accomplished by setting and
     repeatedly checking a shared variable (i.e., spin locking), but this

     1. Ais only suitable if the expected wait time is very short.
        
     2. Bsolution only works for two processes (or threads).
        
     3. Csolution only works if there is only a single CPU involved.
        
     4. Dis wasteful of the CPU resource.
        
     5. ENone of the above
        
145. 145Peterson's solution uses what mechanism(s) to implement mutual exclusion
     for a critical section?

     1. Adisabling interrupts.
        
     2. Bkernel space threads.
        
     3. Clock variable(s).
        
     4. Dbusy waiting.
        
     5. ENone of the above
        
146. 146A test and set instruction is special because it
     

     1. Aruns with interrupts disabled.
        
     2. Bdoes the value copy and set as a single indivisible action.
        
     3. Cworks by performing the busy wait within a single instruction.
        
     4. Dlocks the memory bus.
        
     5. ENone of the above
        
147. 147The priority inversion problem occurs when a busy waiting solution
     for critical section access is used and

     1. Athe busy waiting process/thread has a higher priority.
        
     2. Bthe busy waiting process/thread has a lower priority.
        
     3. Cthe busy waiting process/thread is a user space thread.
        
     4. Dthe busy waiting process/thread is a kernel space thread.
        
     5. ENone of the above
        
148. 148The key feature(s) of the TSL instruction which allows it to implement
     critical section access is

     1. Aonly being callable by the OS (and not by
        user programs).
     2. Bsaving the current value of a register while the register's
        value is set to a new value.
     3. Cblocks if the value being assigned is different from the current
        value of the register.
     4. Dthat it is atomic (i.e., cannot be interrupted once begun).
        
     5. ENone of the above
        
149. 149Assuming that sleep (causing the calling process to
     block) and wakeup (which unblocks the indicated
     process) are system calls, then they can be used to implement critical
     sections if the following condition(s) are kept:

     1. Awakeup signals are not
        buffered.
     2. Bsleep cannot be called by an already blocked process.
        
     3. Conly strict alternation of critical sections is implemented.
        
     4. Dwakeup is never called
        first.
     5. ENone of the above
        
150. 150The sleep (causing the calling process to block) and
     wakeup (which unblocks the indicated process)
     calls enable

     1. Astrictly alternating critical sections to be protected
        without busy waiting.
     2. B2) strictly alternating critical sections to be protected but only
        when a test and set instruction is available.
     3. Cthe protection of any critical section so long as
        wakeup is never
        called first.
     4. Dthe protection of any critical section so long as
        sleep is never
        called twice in a row.
     5. ENone of the above
        
151. 151The sleep (causing the calling process to block) and
     wakeup (which unblocks the indicated process)
     calls, can only support strictly alternating critical sections because

     1. Asleep only blocks a process for a maximum period of
        time.
     2. Bsleep cannot be called by an already blocked process.
        
     3. Cwakeup cannot unblock a process that called
        sleep twice in a row.
     4. Dwakeup calls are not
        buffered.
     5. ENone of the above
152. 152Semaphores were introduced in 1965 by
     

     1. AGary Peterson
        
     2. BAndrew Tannenbaum
        
     3. CEdgar Dijkstra
        
     4. DAlan Turing
        
153. 153The P (DOWN) semaphore operation is best
     described by

     1. Acount--; if (count <= 0) { sleep(); }
        
     2. Bsleep(); if (count <= 0) { count--; }
        
     3. Cif (count <= 0) { count--; } sleep();
        
     4. Dif (count <= 0) { sleep(); } count--;
        
154. 154The V (UP) semaphore operation is best
     described by

     1. Aif (count == 1) { wakeup(sleeping_process); } count++;
        
     2. Bif (count == 1) { count++; } wakeup(sleeping_process);
        
     3. Cwakeup(sleeping_process); if (count == 1) { count++; }
        
     4. Dcount++; if (count == 1) { wakeup(sleeping_process); }
        
155. 155The starting value (count) of a semaphore indicates the number of
     

     1. Atotal times that the semaphore can be used (e.g., P/DOWN operations).
        
     2. Bavailable items of that resource.
        
     3. Cdifferent types of resources.
        
     4. Dconcurrent processes (but not threads)
        that can share the resource(s).
156. 156If semaphores are compared to having copies of a book in the library, then
     

     1. AP/DOWN is the equivalent of checking out a book.
        
     2. BP/DOWN is the equivalent of returning a book.
        
     3. CV/UP is the equivalent of checking out a book.
        
     4. DV/UP is the equivalent of returning a book.
        
157. 157The semaphore operations of P/DOWN and V/UP
     must

     1. Abe system calls.
        
     2. Bbehave atomically (i.e., uninterruptible).
        
     3. Cbe implemented in the OS kernel.
        
     4. Dbe implemented by the computer hardware.
        
158. 158A mutex is a binary semaphore that
     

     1. Ais implemented using lock variables.
        
     2. Buses sleep and wakeup calls
        for its implementation.
     3. Cis implemented using monitors.
        
     4. Dis optimized for having only two values/states.
        
159. 159Monitors, unlike semaphores, must be
     implemented as

     1. Aa (system) library so that different languages can share the
        same implementation.
     2. Bpart of the programming language design.
        
     3. Cpart of the OS design.
        
     4. Da feature within the computer hardware.
        
160. 160Monitors are most easily adapted to programming languages that support
     

     1. Aclasses (e.g., Java).
        
     2. Brecords/structures (e.g., C).
        
     3. Cfunctions (e.g., C, Cobol, Fortran).
        
     4. Dconditional looping constructs, like "while" (e.g., C, Java).
        
161. 161What feature in Java can be used to implement a monitor?
     

     1. Avirtualized
     2. Btry-catch
        
     3. Cfinalized
     4. Dsynchronized
162. 162A different semaphore associated with each object instance can be used
     to implement a monitor by having each

     1. Aobject do P/DOWN when it is created and a V/UP when it is destroyed.
        
     2. Bobject do V/UP when it is created and a P/DOWN when it is destroyed.
        
     3. Cobject method do P/DOWN when begun, and V/UP just before returning.
        
     4. Dobject method do V/UP when begun, and P/DOWN just before returning.
        
163. 163Which of the following interprocess communication mechanisms is well
     suited for distributed sharing (i.e., across multiple computer systems)?

     1. Alock variables
        
     2. Bsemaphores
     3. Cmonitors
     4. Dmessage passing
        
164. 164Message passing, like semaphores (and unlike monitors),
     

     1. Acan easily be implemented as a (system) library so that different
        languages can share the same implementation.
     2. Bmust be part of the programming language
        design.
     3. Cmust be part of the OS design.
        
     4. Dmust be a feature within the computer hardware.
        
165. 165The "send" and "receive" system calls for message passing generally
     

     1. Amust be used in conjunction with semaphores
        to perform the coordination (e.g., to ensure the "receive"r is ready
        and waiting when the "send" is done).
     2. Bcan only be used when the communicating processes are on different systems.
        
     3. Care considered impractically for efficiency reasons, and thus are
        seldom used.
     4. Dmust indicate the message contents and
        destination (for "send") and a place to store the message and the
        source (for "received").
166. 166Which of the following are typical design issues associated with messages?
     

     1. AHandling lost (or missing) messages.
        
     2. BMinimum message size.
        
     3. CMaximum time between messages.
        
     4. DMessages are received in the order they were sent.
        
167. 167A popular system that implements message passing, developed in the
     early 1990s, and available for a variety of different languages
     (e.g., Java, Python, C) is called

     1. AThe Messaging Library (TML)
        
     2. BMessage Passing Interface (MPI)
        
     3. CDistributed Messaging Library (DML)
        
     4. DDistributed Process Communication (DPC)
        
168. 168When a message passing system causes the sender to block until the
     receiver is ready (and vice versa), these semantics are called a

     1. Arendezvous
     2. Bdate
     3. Ccoupling
     4. Dsynch-up.
        
169. 169The mechanism in POSIX systems that provides a maximum size "mailbox"
     that causes the writing/sending process to block once the "mailbox"
     becomes full (allowing the writer/sender to proceed only when there
     is room in the "mailbox" - perhaps due to the receiver reading/removing
     items), is called

     1. Amail
     2. Bspooling
     3. Cpipes
     4. Dconduits
170. 170Barriers are useful when a number of different threads/processes need to
     

     1. Atake turns working on a common task.
        
     2. B<strong>must all meet at a common place before
        proceeding to the next phase of a computation.
     3. Cshare a set of common variables/objects.
        
     4. Dnone of the threads/processes are allowed to go past
        a certain point in the computation.
171. 171If all the threads/processes take very
     close to the same amount of time to reach the barrier, then a good
     way of implementing the barrier is

     1. Aspin locks.
        
     2. Bsemaphores
     3. Cmonitors
     4. Dmessage passing.
        
172. 172The Dining Philosophers Problem is a synchronization problem developed
     by Edgar Dijkstra to

     1. Ashow how monitors can handle situations that semaphores cannot.
        
     2. Bshow how semaphores can handle situations that message passing cannot.
        
     3. Cdemonstrate the use of semaphores.
        
     4. Ddemonstrate the use of message passing.
        
173. 173The Dining Philosophers Problem is comprised of
     

     1. A5 philosophers each with a plate of slippery pasta.
        
     2. Bphilosophers needing to take turns eating, going around the
        table in a clockwise fashion.
     3. C5 forks, one between each philosopher.
        
     4. Dphilosophers needing 2 forks to eat.
        
174. 174If no process within a group of processes is able to run because they
     are all in the blocked state, and each
     is waiting for the other to do something before it can continue, this
     situation is called

     1. Astarvation
     2. Bdeadlock
     3. Clivelock
     4. Dmutual stall.
        
175. 175If all the processes within a group of
     processes is able to run (i.e., none are in the blocked state), but
     none is able to accomplish any useful work for lack of a resource,
     this situation is called

     1. Astarvation
     2. Bdeadlock
     3. Clivelock
     4. Dresource hogging.
        
176. 176In the Dining Philosophers Problem, if each philosopher grabs a fork and
     holds it until they are able to grab a second fork, this

     1. Aleads to starvation.
        
     2. Bleads to deadlock.
        
     3. Cleads to livelock.
        
     4. Dprovides a correct solution.
        
177. 177In the Dining Philosophers Problem, if each philosopher grabs the fork
     to their right, then seeing that the left fork is unavailable (having
     been grabbed by the philosopher to their left) puts down the fork they
     are holding, counts to 10, then tries again. This algorithm

     1. Aleads to livelock.
        
     2. Bleads to deadlock.
        
     3. Cleads to resource hogging.
        
     4. Dprovides a correct solution.
        
178. 178The key to one working solution of the Dining Philosophers Problem is to
     have philosophers exist in one of three states (THINING, HUNGRY, EATING)
     and that when a philosopher is

     1. Afinished EATING, she ensures that any HUNGRY philosopher sitting
        next to her gets an opportunity to eat.
     2. BHUNGRY, she waits until each of her neighbors is THINKING before
        trying to pick up forks.
     3. CTHINKING, she waits until a neighbor is also THINKING before becoming HUNGRY.
        
     4. Dfinished THINKING, she waits until one of her neighbors is EATING
        before becoming HUNGRY.
179. 179The Readers and Writers Problem involves multiple processes trying to
     read or write to the same shared variable, in which

     1. Aonly one reader or writer can access the variable at a time.
        
     2. Bonly one reader or multiple writers can access the variable at a time.
        
     3. Cmultiple readers or a single writer can access the variable at a time.
        
     4. Dmultiple readers or multiple writers can access the variable at a time.
        
180. 180The primary types of solutions to the Readers and Writers Problem are when
     

     1. Awriters are given preference over readers.
        
     2. Breaders are given preference over writers.
        
     3. Creaders and writers have simultaneous access so that no
        preference is given to either one.
     4. Dreaders and writers strictly alternate, with every read followed
        by a write and every write followed by a read.
181. 181The scheduler is that part of the OS that
     

     1. Astarts a new process.
        
     2. Bmanages the CPU.
        
     3. Cdetermines when a blocked process becomes ready.
        
     4. Ddetermines when a running process blocks.
        
182. 182The ability of the OS to switch from running one process to another
     process VERY quickly is important because it

     1. Areduces the chance of an OS bug causing a problem.
        
     2. Bincreases the efficient use of the CPU.
        
     3. Chelps reduce the response time for interactive users.
        
     4. Densures peripheral resource availability.
        
183. 183Regarding the set of concerns that a process scheduling algorithm
     should address,

     1. Aall of them can be effectively address by a
        single algorithm.
     2. Ban OS should use two or more scheduling algorithms alternately
        so as to address all of the concerns.
     3. Conly a couple of the concerns are truly important, and the
        remainder can be safely ignored.
     4. Dsome of the concerns are contradictory, so invariably
        not all concerns can be addressed by
        the OS.
184. 184With respect to process scheduling, it is helpful to view a process as
     

     1. Abeing primarily CPU bound.
        
     2. Bbeing primarily I/O bound.
        
     3. Can intense period of CPU usage.
        
     4. Dalternating sequences of CPU usage and waiting for I/O.
        
185. 185A CPU bound process is one in which
     

     1. Ait spends most of its time in the ready or running state.
        
     2. Bit spends most of its time in the blocked state.
        
     3. Conce it obtains the CPU, it runs to completion.
        
     4. Dmost of the time it's waiting for the memory to be available.
        
186. 186An I/O bound process is one in which
     

     1. Ait spends most of its time in the ready or running state.
        
     2. Bit spends most of its time in the blocked state.
        
     3. Conce it obtains the CPU, it runs to completion.
        
     4. Dmost of the time it's waiting for the memory to be available.
        
187. 187Preemptive scheduling is when a process
     

     1. Aspends most of its time in the ready or running state.
        
     2. Bspends most of its time in the blocked state.
        
     3. Ccan be booted out of the CPU by the scheduler, before the
        process is finished.
     4. Dcan be booted out of the CPU by another user process, before the
        process is finished.
188. 188Non-preemptive scheduling is when a process
     

     1. Aspends most of its time in the ready or running state.
        
     2. Bspends most of its time in the blocked state.
        
     3. Cnever becomes blocked.
        
     4. Dalways runs to termination
        once it's in the CPU.
     5. ENone of the above
        
189. 189Which type of process scheduling is
     best
     suited for interactive processing?

     1. Anon-preemptive.
        
     2. Bdedicated
     3. Cbusy wait.
        
     4. Dpreemptive
190. 190Which of the following are batch process scheduling algorithms?
     

     1. APriority Scheduling.
        
     2. BFirst Come, First Serverd.
        
     3. CGuaranteed Scheduling.
        
     4. DShortest Remaining Time.
        
191. 191The following steps describe which process scheduling algorithm?
     
     Processes are added to a single queue in the order they are started.
     The process at the front of the queue is run until it either completes, or blocks.
     Once a process becomes ready again (after being blocked), it joins the end of the queue.

     1. ARound Robin Scheduling.
        
     2. BFirst Come, First Served.
        
     3. CGuaranteed Scheduling.
        
     4. DFair-Share Scheduling.
        
192. 192Which of the following process scheduling algorithms needs to know the
     typical amount of time that a process often takes to complete?

     1. AGuaranteed Scheduling.
        
     2. BShortest Job First.
        
     3. CPriority Scheduling.
        
     4. DFair-Share Scheduling.
        
     5. EShortest Remaining Time.
        
193. 193Which of the following process scheduling algorithms favors CPU bound
     over I/O bound processes?

     1. AFirst Come, First Served
        
     2. BShortest Job First
        
     3. CShortest Remaining Time
        
     4. DGuaranteed Scheduling.
        
194. 194Which of the following process scheduling algorithms improves the average
     turnaround time on a batch system?

     1. AFirst Come, First Served
        
     2. BShortest Job First
        
     3. CShortest Remaining Time
        
     4. DGuaranteed Scheduling.
        
195. 195Which of the following process scheduling algorithms improves the average
     throughput on a batch system?

     1. AFirst Come, First Served
        
     2. BShortest Job First
        
     3. CShortest Remaining Time
        
     4. DGuaranteed Scheduling.
        
196. 196The following steps describe which process scheduling algorithm?
     
     Processes are chosen to run from the front of a single ready queue.
     Each process can run a max time called a quantum.
     Processes may block before all of their time quantum is used.
     As processes become ready, they go to the end of the ready queue.

     1. AFirst Come, First Served.
        
     2. BRound Robin Scheduling.
        
     3. CPriority Scheduling.
        
     4. DFair-Share Scheduling.
        
197. 197The following steps describe which process scheduling algorithm?
     
     Each process has a priority.
     The ready process with the highest priority runs next.
     Priorities can be set statically and/or dynamically.

     1. ARound Robin Scheduling.
        
     2. BGuaranteed Scheduling.
        
     3. CPriority Scheduling.
        
     4. DFair-Share Scheduling.
        
198. 198The following steps describe which process scheduling algorithm?
     
     Each queue corresponds to a different max time quantum to run.
     If a process uses all of its time quantum, it's added to the end of the next highest quantum queue when it's moved to the ready state.
     If a process blocks before exhausting its time quantum, it's added to the end of the next lowest quantum queue when it's moved to the ready state.
     The processes in queues with larger quantum are run less frequently.

     1. ARound Robin Scheduling.
        
     2. BMultiple Queues.
        
     3. CPriority Scheduling.
        
     4. DFair-Share Scheduling.
        
199. 199Which process scheduling algorithm(s) are particularly well suited to
     very slow context switching?

     1. AGuaranteed Scheduling.
        
     2. BMultiple Queues.
        
     3. CLottery Scheduling.
        
     4. DFirst Come, First Served.
        
200. 200Which process scheduling algorithm(s) are particularly well suited to
     enforcing an advertised policy?

     1. AMultiple Queues.
        
     2. BGuaranteed Scheduling.
        
     3. CLottery Scheduling.
        
     4. DFair-Share Scheduling.
        

Description

Midterm review

Author

sosa_savannah

Language

English

Views

50

Tags

operatingsystemsreview

Rating

No ratings yet

Rate this quiz

Rate this quiz

More on C Programming Basics