(Solved) : 13 Complete Following Method 12 Points Public Void Printoceanbymaxdepth Stringtl Oceanname Q29452825
![13) Complete the following method (12 points): public void printoceanByMaxDepth(stringtl oceanNames, int [ ] maxDepthsMe ters) { … } Assume names and maximum depths of all oceans are unique, and maxDepthsMeters [ contains the maximum depth of oceanNames[i for any i. Your method should first use an assertion to make sure the two input arrays have the same length. Then print one line for each ocean in oceanNames, like the following: Maximum depth of Indian Ocean is 8047 meters. The output should be in ascending order by depth. ZERO POINTS FOR ANY SOLUTION THAT RUNS IN O(n2) TIME OR WORSE.](https://d2vlcm61l7u1fs.cloudfront.net/media%2Fd95%2Fd95bb081-3391-4aa1-91d4-c5f21439931e%2FphpAp2E9d.png)
13) Complete the following method (12 points): public void printoceanByMaxDepth(stringtl oceanNames, int [ ] maxDepthsMe ters) { … } Assume names and maximum depths of all oceans are unique, and maxDepthsMeters [ contains the maximum depth of oceanNames[i for any i. Your method should first use an assertion to make sure the two input arrays have the same length. Then print one line for each ocean in oceanNames, like the following: Maximum depth of Indian Ocean is 8047 meters. The output should be in ascending order by depth. ZERO POINTS FOR ANY SOLUTION THAT RUNS IN O(n2) TIME OR WORSE. Show transcribed image text
Expert Answer
Attached . . .
READ MORE
13. What is the 6-bit two’s complement bit pattern representing the number -17? What is the 8-bit two’s complement representation of the same mumber? The 16-bit representation? Show transcribed image text 
13. (4 points) Devise a command line sequence to display the extensions of all files in the current directory along with a count of each extension. You may not use temporary files, you may not use variables, and you may not use the>operation. Show transcribed image text 13. (4 points) Devise a command line sequence to display the extensions of all files in the current directory along with a count of each extension. You may not use temporary files, you may not use variables, and you may not use the>operation. ![13. [9-3 *3 points] (From Problem 8.15, p.46) First, read the problem description; it discusses a possible framework for determining structural equality when you include records, pointers, and recursive types. Now consider the following algorithm for determining structural equality relationships within a set of types. . Define two types to be equivalent at level 0 if (a) Theyre the same primitive type (int, double, etc.), (b) Or theyre both record types with the same sequences of field names (regardless of the types of the fields), or (c) Or theyre both pointer types (regardless of the types of things they point to). Define two types to be equivalent at level k+1 if they are equivalent at level k and (a) If theyre both pointer types, the types they point to must be equivalent at level k or (b) If theyre both record types, then each corresponding pair of fields must be equivalent at level k. Lets allow the abbreviation for equivalent at level 0, for equivalent at level 1, etc. Then some examples: int?double; int *-o double *, and int * double * (because int-o double). The two types discussed in the problem (rewritten into C-like syntax) are type A struct { struct B *x; double y; }; type Bstruct f struct A *double y; ; (a) Using the algorithm described above, are types A and B? Are they 1? (b) Given a set of types, how many levels do you have to use to determine equivalence of an arbitrary pair of types from the set? Do you think this algorithm meets the criteria given in the problem? Briefly explain. (c)](https://d2vlcm61l7u1fs.cloudfront.net/media%2Fddb%2Fddb2bad8-b592-4050-a1be-0008ff57dcf7%2FphpqF47Zy.png)
![(13) (5 marks) What is the output of the following MATLAB code fragment: A= [23, 9, 17); for i 1:1:3 ト[23 9-7] for = 1:1:3 j if else 1) II (j=-3) (j disp (A (i)) - disp (A (j)) end end end](https://media.cheggcdn.com/media%2F3a3%2F3a3d6254-cde4-4fd1-9ad9-f401bf8fba67%2Fimage)
(13) (5 marks) What is the output of the following MATLAB code fragment: A= [23, 9, 17); for i ” 1:1:3 ト”[23 9-7] for = 1:1:3 j if else 1) II (j=-3) (j disp (A (i)) – disp (A (j)) end end end Show transcribed image text ![13. [4] Now show the result of three successive deleteMin operations from the prior heap: 14. [4] What are the average complexities and the stability of these sorting algorithms: Algorithrm Average complexit)y Stable (yes/no)? Bubble Sort Insertion Sort Heap sort Merge Sort Radix sort Quicksort 15. [2] What are the key differences between Mergesort and Quicksort? How does this influence why languages choose one over the other?](https://d2vlcm61l7u1fs.cloudfront.net/media%2Fc7e%2Fc7e1cbcf-18ab-4d67-9d11-ee71c81e23d9%2FphpfDYpzX.png)
13. In arc welding the electric energy is converted into sound ener solar energy dheat energy Show transcribed image text ![1.3 [2 marks] Describe in no more than five English sentences the procedure of determining whether a given integer x is in a sorted array A of n integers using the divide and conquer strategy.](https://media.cheggcdn.com/media%2F6cb%2F6cb34c3f-e2c5-46b0-8edf-40ba7ebdd41d%2Fphp1wwW52.png)