Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

Question 1. 1. (TCO 1) Applications run on which type of OS usually require the

ID: 3551145 • Letter: Q

Question

Question 1.1. (TCO 1) Applications run on which type of OS usually require the most network bandwidth? (Points : 4)       hand-held
      multimedia
      multiprocessor
      real-time

Question 2.2. (TCO 1) A command line interpreter is often known as a _________? (Points : 4)       C
      Bourne
      Korn
      Shell

Question 3.3. (TCO 1) On which OS would an application developer not use the POSIX API? (Points : 4)       Red Hat Linux
      Mac OS X
      SCO Unix
      Windows XP

Question 4.4. (TCO 2) _________ of process code must be identified and protected to guard against race conditions. (Points : 4)       Critical sections
      Entry sections
      Exit sections
      Remainder sections

Question 5.5. (TCO 2) A sending process sends a message and does not wait for acknowledgement from the receiver. This type of communication is known as ________ or _________. (Points : 4)       asynchronous, blocking
      synchronous, blocking
      asynchronous, non-blocking
      synchronous, non-blocking

Question 6.6. (TCO 4) In _______ scheduling, a process may be moved to a higher priority queue to prevent starvation. (Points : 4)       multilevel queue
      multilevel feedback queue
      multiple processor

Question 7.7. (TCO 3) Deadlock prevention requires the removal of _______ of the four necessary conditions for deadlock (mutual exclusion, hold & wait, no preemption, circular wait) (Points : 4)       all
      one
      two
      three

Question 8.8. (TCO 5) Solutions to the external fragmentation problem include ________. (Points : 4)       compaction only
      compaction and paging
      compaction and segmentation
      compaction, paging, and segmentation

Question 9.9. (TCO 5) If a base register holds 200000 and the limit register holds 300000, the program can legally access addresses between _______ and ________. (Points : 4)       100000 and 300000
      100000 and 400000
      200000 and 300000
      200000 and 500000

Question 10.10. (TCO 6) If a process does not have enough memory for its working set, it will ________. (Points : 4)       exit
      throw an exception
      thrash
      stall

Question 11.11. (TCO 6) The CPU can execute instructions stored in ________. (Points : 4)       logical memory only
      both logical and physical memory
      physical memory only

Question 12.12. (TCO 7) A file-control block (FCB) does not contain file _________. (Points : 4)       data
      dates
      permissions
      sizes

Question 13.13. (TCO 7) Cycles can exist in _________ directory structures. (Points : 4)       general graph
      single-level
      tree
      two-level

Question 14.14. (TCO 7) Suppose an iNode occupies one block, and blocks are of size %%1 bytes. Further, suppose disk addresses occupy %%2 bytes. The iNode has file attributes occupying 256 bytes, and its last disk address is used to link to another iNode, if the file needs more blocks than the number of pointers to file blocks that can appear in one iNode. How large (in bytes) can the file be, if no additional iNode is needed to represent the file? (Points : 4)       %%5
      %%3
      %%6
      %%4

Question 15.15. (TCO 1) Processes may be in one of three states: running, ready, or blocked. However, not all sequences of these three states are possible. In the list below, identify the sequence of states that is possible. (Points : 4)       Ru, B, Ru, Re
      B, Re, Ru, Re
      Ru, B, Ru, B
      Re, Ru, Re, B

Question 16.16. (TCO 1) Order the typical sizes of these types of memory, from smallest to largest.
(Points : 5)
Potential Matches: 1 : Magnetic disk 2 : Main Memory 3 : CPU registers 4 : Cache     Answer      : 1      : 2      : 3      : 4
Question 17.17. (TCO 1) Match the essential properties of each type of operating system.
(Points : 5)
Potential Matches: 1 : Handles short transactions in which the results of the next transaction may be unpredictable. 2 : Provides distributed operating system features. 3 : Enables simple tasks such as calendars, e-mail, and Web browsers.     Answer      : Handheld      : Interactive      : Network


Question 1.1. (TCO 1) Applications run on which type of OS usually require the most network bandwidth? (Points : 4)       hand-held
      multimedia
      multiprocessor
      real-time

Question 2.2. (TCO 1) A command line interpreter is often known as a _________? (Points : 4)       C
      Bourne
      Korn
      Shell

Question 3.3. (TCO 1) On which OS would an application developer not use the POSIX API? (Points : 4)       Red Hat Linux
      Mac OS X
      SCO Unix
      Windows XP

Question 4.4. (TCO 2) _________ of process code must be identified and protected to guard against race conditions. (Points : 4)       Critical sections
      Entry sections
      Exit sections
      Remainder sections

Question 5.5. (TCO 2) A sending process sends a message and does not wait for acknowledgement from the receiver. This type of communication is known as ________ or _________. (Points : 4)       asynchronous, blocking
      synchronous, blocking
      asynchronous, non-blocking
      synchronous, non-blocking

Question 6.6. (TCO 4) In _______ scheduling, a process may be moved to a higher priority queue to prevent starvation. (Points : 4)       multilevel queue
      multilevel feedback queue
      multiple processor

Question 7.7. (TCO 3) Deadlock prevention requires the removal of _______ of the four necessary conditions for deadlock (mutual exclusion, hold & wait, no preemption, circular wait) (Points : 4)       all
      one
      two
      three

Question 8.8. (TCO 5) Solutions to the external fragmentation problem include ________. (Points : 4)       compaction only
      compaction and paging
      compaction and segmentation
      compaction, paging, and segmentation

Question 9.9. (TCO 5) If a base register holds 200000 and the limit register holds 300000, the program can legally access addresses between _______ and ________. (Points : 4)       100000 and 300000
      100000 and 400000
      200000 and 300000
      200000 and 500000

Question 10.10. (TCO 6) If a process does not have enough memory for its working set, it will ________. (Points : 4)       exit
      throw an exception
      thrash
      stall

Question 11.11. (TCO 6) The CPU can execute instructions stored in ________. (Points : 4)       logical memory only
      both logical and physical memory
      physical memory only

Question 12.12. (TCO 7) A file-control block (FCB) does not contain file _________. (Points : 4)       data
      dates
      permissions
      sizes

Question 13.13. (TCO 7) Cycles can exist in _________ directory structures. (Points : 4)       general graph
      single-level
      tree
      two-level

Question 14.14. (TCO 7) Suppose an iNode occupies one block, and blocks are of size %%1 bytes. Further, suppose disk addresses occupy %%2 bytes. The iNode has file attributes occupying 256 bytes, and its last disk address is used to link to another iNode, if the file needs more blocks than the number of pointers to file blocks that can appear in one iNode. How large (in bytes) can the file be, if no additional iNode is needed to represent the file? (Points : 4)       %%5
      %%3
      %%6
      %%4

Question 15.15. (TCO 1) Processes may be in one of three states: running, ready, or blocked. However, not all sequences of these three states are possible. In the list below, identify the sequence of states that is possible. (Points : 4)       Ru, B, Ru, Re
      B, Re, Ru, Re
      Ru, B, Ru, B
      Re, Ru, Re, B

Question 16.16. (TCO 1) Order the typical sizes of these types of memory, from smallest to largest.
(Points : 5)
Potential Matches: 1 : Magnetic disk 2 : Main Memory 3 : CPU registers 4 : Cache     Answer      : 1      : 2      : 3      : 4
Question 17.17. (TCO 1) Match the essential properties of each type of operating system.
(Points : 5)
Potential Matches: 1 : Handles short transactions in which the results of the next transaction may be unpredictable. 2 : Provides distributed operating system features. 3 : Enables simple tasks such as calendars, e-mail, and Web browsers.     Answer      : Handheld      : Interactive      : Network

Explanation / Answer

1) Realtime


2) Shell


3) Red Hat Linux


4) Critical sections


5) asynchronous, non-blocking


6) multilevel queue


7) all


8) compaction, paging, and segmentation


9) 200000 and 500000


10 ) thrash


11) physical memory only


12 ) data


13) general graph


15) Re, Ru, Re, B


16) 3,4,2,1


17) 1-2 Interactive, 2-3 network, 3-1 handleld

Hire Me For All Your Tutoring Needs
Integrity-first tutoring: clear explanations, guidance, and feedback.
Drop an Email at
drjack9650@gmail.com
Chat Now And Get Quote