Answer:
scope of pet name is limited to pet class and color is accessible to the whole program
Explanation:
The printer is setup as a local printer therefore it does not need access to internet to access the local network printer. Once the new workstation is given access to the terminal server used for the printer, it will not need to connect on the internet to print. Now, if the workstation is not able to access the internet it could be potentially due to incorrect configuration of DNS to the workstation or actual issue is within the ISP.
Answer:
The flashdrive can hold 35389 400-pages-books
Explanation:
If 
of a page occupies 1 kB of memory, we can calculate how much memory a book will take
Now that we know that a book average file size is about 266,67 kB, we calculate how many of them can a 9 GB flash drive hold.
To do the calculation, we have to know how many kilobytes are in 9 gigabytes.
There is 1024 kilobytes in a megabyte, and 1024 megabytes in a gigabyte, so:
Finally, knowing the average file size of a book and how much memory in kilobytes the 9 GB flash drive holds, we calculate how many books can it hold.
The flashdrive can hold 35389 400-pages-books, or 14155776 pages of typical text.
Answer:
D. 256
Explanation:
Given
Required
Determine the maximum number of output
To get the required value, we make use of the following:
Where n is the bits of the opcode.
i.e.
Substitute 8 for n in
<em>Hence, option D answers the question</em>
Answer:
Question was incomplete and continued the question
For each of the following scenarios, which of these choices would be best? Explain your answer.
BST
Sorted Array
Un-sorted Array
a) The records are guaranteed to arrive already sorted from lowest to highest (i.e., whenever a record is inserted, its key value will always be greater than that of the last record inserted). A total of 1000 inserts will be interspersed with 1000 searches.
b) The records arrive with values having a uniform random distribution (so the BST is likely to be well balanced). 1,000,000 insertions are performed, followed by 10 searches.
Explanation:
Answer for a: Un-sorted array or Un-sorted linked list : as mentioned in the question itself that the records are arriving in the sorted order and search will not be O(log n) and insert will be not be O(n).
Answer for b : Un-sorted array or Un-sorted linkedlist : Number of the items to be inserted is already known which is 1,000,000 but it is very high and at the same time search is low. Unsorted array or Unsorted linked list will be best option here.
