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.
Answer:
The answer is D because u have the uppercase letter bold
Answer:
Everything.It doesn't matter the information because there's always a way to plagiarize.No matter what the information, always, ALWAYS, cite the source.
Explanation:
I would say 3-D model!!!! not 100% sure but this sounds most correct!
Answer:
Block all incoming ICMP requests.
Explanation:
Since the web server is hosts a lot of internet facing websites .On investigation it was find out that the web server is getting flooded with a lot of ping requests hence it becomes unavailable occasionally. So to tackle this problem we should block all of the incoming ICMP requests.
