6.A solution to the Dining Philosophers Problem which avoids deadlock is
Options: (A)ensure that all philosophers pick up the left fork before the right fork. (B) ensure that all philosophers pick up the right fork before the left fork. (C) ensure that one particular philosopher picks up the left fork before the right fork, and all other philosophers pick up the right fork before the left fork. (D) none of the above 24
6.You can display a database object in design view by
Options: (A)Opening the database object and clicking the view button on the toolbar (B) Selecting the database object and clicking the design button on the database window (C) Selecting the database object and press Ctrl + V (D) Opening the database object and selecting Tools>Design view 6
Which of the following technique is used for Time-To-Line (TTL)?
Options: a technique used in best-effort delivery system to avoid endlessly looping packets., a technique used by protocols in which a lower level protocol accepts a message from a higher level protocol and places it in the data portion of the low level frame, One of the pieces that results when an IP gateway divides an IP datagram into smaller pieces for transmission across a network that cannot handle the original datagram size., All of the above
8.The space factor when determining the efficiency of algorithm is measured by
Options: (A)Counting the maximum memory needed by the algorithm (B) Counting the minimum memory needed by the algorithm (C) Counting the average memory needed by the algorithm (D) Counting the maximum disk space needed by the algorithm 3
The difference between linear array and a record is
Options: a. An array is suitable for homogeneous data but hte data items in a record may have different data type
b. In a record, there may not be a natural ordering in opposed to linear array.
c. A record form a hierarchical structure but a lienear array does not
d. All of above
Options: (A)is included in the image for each library routine reference (B) is small piece of code that indicates how to locate the appropriate memory resident library routine (C) how to load the library if the routine is not already present (D) all of the above 27