A) Starting with a dynamic array of length = 32 and numElements = 30, the length after we execute 90 insert at end operations is [answer] Group of answer choices 120 122 128 none of the above B) In each of the following cases, we start with a dynamic array of length = 128 and numElements = 64. After we execute 30 delete last operations, the number of elements is and the length is After we execute 32 delete last operations, the number of elements is and the length is After we execute 60 delete last operations, the number of elements is and the length is no hand written

A) Starting with a dynamic array of length = 32 and numElements = 30, the length after we execute 90 insert at end operations is [answer] Group of answer choices 120 122 128 none of the above B) In each of the following cases, we start with a dynamic array of length = 128 and numElements = 64. After we execute 30 delete last operations, the number of elements is and the length is After we execute 32 delete last operations, the number of elements is and the length is After we execute 60 delete last operations, the number of elements is and the length is no hand written

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter6: Arrays

Section: Chapter Questions

Problem 17RQ

See similar textbooks

Similar questions

Suppose an array sorted in ascending order is rotated at some pivot unknownto you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).Find the minimum element. The complexity must be O(logN)You may assume no duplicate exists in the array."""def find_min_rotate(array): """ Finds the minimum element in a sorted array that has been rotated. """ low = 0 high = len(array) - 1 while low < high: mid = (low + high) // 2 if array[mid] > array[high]: low = mid + 1 else: high = mid return array[low] def find_min_rotate_recur(array, low, high): """ Finds the minimum element in a sorted array that has been rotated. """ mid = (low + high) // 2 if mid == low:.
Every time it has to identify two arrays to combine, perform the following to create a bottom-up mergesort that benefits from array order: Locate the first entry in a sorted subarray, then the second, and finally merge them (by increasing a pointer until it finds an element in the array that is smaller than its predecessor). Consider the array size and the number of maximal ascending sequences in the array when calculating the algorithm's execution time.
Develop an implementation of insertion sortthat moves larger elements to the right one position with one array access per entry,rather than using exch(). Use SortCompare to evaluate the effectiveness of doing so.Develop an implementation of insertion sortthat moves larger elements to the right one position with one array access per entry,rather than using exch(). Use SortCompare to evaluate the effectiveness of doing so.
ALGO1(A)// A is an integer array, an index that starts at 11): for i=1 to n-1 do2): minIndex = findSmallest(A,i)3): exchange A[i] with A[minIndex] The sub-routine find the smallest(A, i) in Line 2, and returns the index of the smallest element in thesub-array A[i:n]Suppose the array below is provided as input to ALGO1 2 5 6 7 3 8 1 4 Fill in the Blanks At the end of the first iteration of the for loop (i.e. with i=1)1) a) the element at index 1 is : b) the element at index 4 is : c) the element at index 7 is :
Every time it has to find two arrays to join, do the following to generate a bottom-up mergesort that takes use of array order: Find the first item in a sorted subarray, then the second, and eventually merge them (by raising a pointer until it finds a smaller element in the array than its predecessor). When estimating the algorithm's execution time, take into account the array size and the number of maximal ascending sequences in the array.
ALGO2(A)// A is an integer array, index starting at 11:for i=1 to n-1 do2: for j=n to i+1 do3: if (A[j] < A[j-1]) then4: exchange A[j] with A[j-1] Which function best describes the worst-case running time behaviour of ALGO2 on an array of size n? Option 1) a*(n^2) + b*n +c, where a,b,c are constantsOption 2) a*n + b , where a and b are constantsOption 3) a * n * log(n) + b, where a,b are constantsOption 4) a*(n^3) + b*(n^2) + c*n + d, where a,b,c,d are constants
0 restore the array A by replacing each unknown element by a positive integer not exceeding K- as M restrictions that must hold for the restored array. There are fwo types of restrictions: that for each | such that L < | = R, the condition Ai 1 should be safisfied. g that for each j such that L < | = R, the condition Ai 1 should be satisfied. 1o know the number of ways to restore the array while satisfying all restrictions, modulo 10/9+7.
Select true or false for the statements below. Explain your answers if you like to receive partial credit 9) Which of the following is true about the Mergesort algorithm applied to an array ofnumbers that are all different?a. Memory usage is efficient because all swaps take place within the same arrayb. Performance is consistently at O(n log n) for all array scenariosc. When the partition function completes on the array, the pivot element willalways be in the exact center of the array
(1) The following code transposes the elements of an M × M array, where M is a con- stant defined by # define: void transpose(long A[M][M]) { long i, j; for (i = 0; i < M; i++)for (j = 0; j < i; j++) { long t = A[i][j]; A[i][j] = A[j][i]; A[j][i] = t; } } When compiled, with optimization level −O1, GCC generates the following code for the inner loop of the function. 1 .L1: 234 5 6 7 8 9 movq movq movq movq addq addq cmpq jne .L1 (%rdx), %rcx (%rax), %rsi (%rdx) (%rax) $8, %rdx $120, %rax %rdi, %rax %rsi, %rcx, We can see that GCC has converted the array indexing to pointer code. (a) Which register holds a pointer to array element A[i][j]? (b) Which register holds a pointer to array element A[j][i]? (c) What is the value of M?
Following is the partition function for quicksort, where we have used the leftmost number as a pivot. Assume that our array, ARR = {14, 8, 7, 38, 22, 15, 9}, which is 7 in size. What will be the array ARR after we apply "partition(A, 0, 6)"* 9, 15, 22, 38, 7, 8, 14 7, 8, 9, 14, 15, 22, 38 9, 8, 14, 7, 22, 15, 38 9, 8, 7, 14, 22, 15, 38 7, 9, 15, 22, 38, 14, 6 38, 22, 15, 14, 9, 8, 7
In a non-empty array of integers, the priority of a number is determined by thefrequency of its occurrence. Elements are added as they come but the most frequentelement is deleted first. If two elements have the same priority, then the elementwhich came first will be deleted first. For example: nums = [1,2,3,1,3,1,3,2,3]. Afterthe first deletion now the array will be num={1,2,1,1,2}. Implement a priority queuefor the aforementioned scenario.
Question- Need solution in JavaSomething related to IPO offeringmain gist is we had shares - lets say N which we want to divide among biddersBidders are represented in 2d arrays as[bidder_id, no of shares_bid, price, timestamp]Now build a function returns the bidder_id's in sorted array that did not receive any shares. Shares are allocated following rules- if the price is highest among all the bidders. Allocate shares If the price is same among 2 bidders. Allocate share in iterative fashion, first one get share had earlier timestamp.Like 2 bidders with bidder id 1&2, have same price, timestamp 4 and 1, bids for 5 shares each and N=1.So, in this case only bidder id 1 get share, bidder id 2 will not recieve any shares