java

Consider the undirected graph shown below. What are the BFS layers for a breadth first traversal starting at node 10 ? You are building a system that will access a collection of data for some scientific application and you need to select an appropriate data structure. Here are the details. The data entries are always long strings of characters, and they always have different lengths (you will never be given two strings of the same length). You need to be able to insert new entries efficiently, and also you need to be able to retrieve (and delete from the data structure) the entry (string) that is the shortest among all in the data structure currently. Explain briefly what data structure you would use, how you would use it for each required operation and what is the worst case running time of each operation. Describe in detail (in plain English) the implementation of a priority queue based on a sorted array. Show that your implementation achieves O(1) for operations min and removeMin, and O(n) for insertions. Explain in a high-level way (in plain English) as well as in pseudo code how the removeMin operation works in a min-heap. Explain in a high-level way (in plain English) and also using pseudo-code, how to insert a key into a hash table that uses linear probing for collisions. Assume the hash table is implemented using an array