1. /15 points] Consider the following function:Func1(A, n)* A is an array of integers1 80;2 for m 1 to 10 dok Random(n);for i1 to doj1while (jn) dossA[A[j];j2*j;345678endend1011 end12 return (s);(a) What is the asymptotic worst case running time of Func1?(b) What is the asymptotic expected running time of Func1? Justify your solution

a)Worst case running time of Func1:The random number between 1 to “n” is assigned to “k” in the…

Answered: 1. /15 points] Consider the following…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

1. Consider a problem of computing the prefix average of a sequence of numbers stored in an array P consisting of P integers. We want to compute an array P such that P is the average of P for P . Consider the two algorithms related to the above problem. Answer the questions given below
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:.
Multiplying Factors For a pair of integers (x,y) and an integer k, the multiplying factor is defined as minimum positive integer m such that LCM(x,y) * m is divisible by k. Here LCM(x,y) represents the smallest positive integer divisible by both x and y, their least common multiple. Given an array arr of n integers and an integer k, find the sum of multiplying factors over all pairs of integers (arr[i], arr[j]) and k0 <= i,j < n. Example Suppose n=3, arr =[4,5,6] and k=12. Pair Multiplying Factor Remarks (4, 3 LCM(4,4)**3=4**3 =12 4 ) LCM(5,5)**12=5** 12=60 (5, 12 LCM(6,6)**2=6**2 5) (6, 2 12 6 )
Write a nToArray function which does the following:1. Accepts an empty partially filled array, the size of the array and an integer n as input parameters.2. Recursively extracts each digit of n and stores the digit into the array in forward order.3. Assumes the partially filled array has an infinite capacity.ExampleIf n is 2534 the array will contain the values 2,5,3,4. in c++
1) Consider an integer array a of length n with indexing starting at 0, where n is a positive integer.If the elements of array a are to be written out in reverse order, which of the following C++ code fragment does NOT do the job? Question options: a. int i=n-1; while (i>=1){cout << a[i] << endl; i = i-1;} cout << a[i] << endl; b. int i=n-1; while (i>=1){cout << a[i] << endl; i = i-1;} c. int i=n-1; while (i>=0){cout << a[i] << endl; i = i-1;} d. int i=n; while (i>0){cout << a[i-1] << endl; i = i-1;} 2) Assume we use 8-bit cell to store floating point numbers, 1 bit for sign, 3 bits for excessed exponent, and 4 bits for significand. What is the decimal value for a cell with bit pattern 0 111 1101 Question options: a. 125 b. 224…
Find the complexity of the function used to find the k th the smallest integer in an unordered array of integer
Plot the result of (given) selectionsort(A) when A is a perfectly sorted and contains randoms integers ,0 to 100 inclusive, for array sizes n = 2,4,8,16,..1024. please provide code for A and generating the plot for each doubling array, as well as the resulting plot. def selectionsort(A): for i in range(len(A)): min_idx = i for j in range(i + 1, len(A)): if A[min_idx] > A[j]: min_idx = j A[i], A[min_idx] = A[min_idx], A[i] return A
H3. Let S = [x1, x2, x3, ...xn], where n ≥ 5. How many ways can you choose five of the values in the array S, given that x1 = x2 = x3 and all other xi are distinct? The order of the chosen elements does not matter
) Consider the following C code snippet. void swap(int *xp, int *yp) { int temp = *xp; *xp = *yp; *yp = temp; } int findMinimum(int arr[], int N) { // variable to store the index of minimum element int min_idx = 0; int min_E = arr[min_idx]; // Traverse the given array for (int i = 1; i < N; i++) { // If current element is smaller than min_idx then update it if (arr[i] < min_E) { min_idx = i; min_E = arr[min_idx]; } } return min_idx; } /* Function to sort an array using selection sort*/ void selectionSort(int arr[], int n) { int i, min_idx; // One by one move boundary of unsorted subarray for (i = 0; i < n-1; i++) { // Find the minimum element in unsorted array min_idx = findMinimum(&arr[i], n-i); // Swap the found minimum element with the first element if(min_idx != 0) swap(&arr[min_idx+i], &arr[i]); } }…
Please Help me with This Problem Language = C++ Take an array of name A of size 4 X 4. Take input and then take B with size 4 X 4. Add them.And show result after taking transpose.Formally, the i th row, j th column element of C T is the j th row, i th columnelement of C:1. write the rows of C as the columns of C T2. write the columns of C as the rows of C TC is an m × n matrix then C T is an n × m matrix.Then save the result in a file named “result.txt”, according the matrix spaces and newline. Note:Understand the Question Properly and Kindly Answer
9.). integer array nums and an integer k, return the length of the shortest non-empty subarray of nums with a sum of at least k. If there is no such subarray, return -1. A subarray is a contiguous part of an array. Example 1: Input: nums = [1], k = 1 Output: 1 Example 2: Input: nums = [1,2], k = 4 Output: -1 Example 3: Input: nums = [2,-1,2], k = 3 Output: 3.
(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?

SEE MORE QUESTIONS

Recommended textbooks for you

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

C How to Program (8th Edition)

Computer Science

ISBN:

9780133976892

Author:

Paul J. Deitel, Harvey Deitel

Publisher:

PEARSON

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781337627900

Author:

Carlos Coronel, Steven Morris

Publisher:

Cengage Learning

Programmable Logic Controllers

Computer Science

ISBN:

9780073373843

Author:

Frank D. Petruzella

Publisher:

McGraw-Hill Education

SEE MORE TEXTBOOKS