please send answer for part b i Q2please send proper answer 2.(a) Write an algorithm in pseudo-code that• takes as input an array A[1...n], and an item M which occurs at least oncein A.• returns the index (position) of the last occurrence of the item M in array A.The following table shows some examples with the expected output of thealgorithm (the last occurrences of M is underlined):input: Aoutput[1,8, 1, 7, 1, 9[4, 3, 2, 2, 2, 3] 2[9, 9][3, 3, 3, 3][4, 3, 3, 3]19.44Your algorithm should perform as few comparisons as possible.(b) Consider using the following algorithm on an array A = [5,:Input: Array A[1...n]Output: ??1 for i + 2 to n doK+ A[i]j+i-1while j > 0 and A[j] > K doA[j + 1] + A[j]j+j-1A[j] +3478 return Ai. Write the array A after each iteration of the outer For-loop, and state whatyou think the algorithm does. Show all your working.ii. How many times will line 5 be executed for the array A? How many timesfor an array of length n?ii. How many times will line 4 be executed in the worst case for the array A?How many times for an array of length n?

for i <- 2 to n do // loop from 2 to n k <- A[i] // copy value of ith index…

Answered: i. Write the array A after each…

i. Write the array A after each iteration of the outer For-loop, and state what you think the algorithm does. Show all your working.

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

please send answer for part b iii please send proper answer
01... ""Implementation of the Misra-Gries algorithm.Given a list of items and a value k, it returns the every item in the listthat appears at least n/k times, where n is the length of the array By default, k is set to 2, solving the majority problem. For the majority problem, this algorithm only guarantees that if there isan element that appears more than n/2 times, it will be outputed. If thereis no such element, any arbitrary element is returned by the algorithm.Therefore, we need to iterate through again at the end. But since we have filtredout the suspects, the memory complexity is significantly lower thanit would be to create counter for every element in the list. For example:Input misras_gries([1,4,4,4,5,4,4])Output {'4':5}Input misras_gries([0,0,0,1,1,1,1])Output {'1':4}Input misras_gries([0,0,0,0,1,1,1,2,2],3)Output {'0':4,'1':3}Input misras_gries([0,0,0,1,1,1]Output None"""..
1.Given an array arr[] and an integer K where K is smaller than size of array, the task is to find the Kth smallest element in the given array. It is given that all array elements are distinct. Note :- l and r denotes the starting and ending index of the array. Example 1: Input: N = 6 arr[] = 7 10 4 3 20 15 K = 3 Output : 7.
II. Read each problem carefully and present an algorithm with the required running-time to solve each problem. 2. Let A be a sorted array of integers. You want to implement two functions: update (i, x) - which takes as input an index i in A and sets A[i] = x. For example, calling update (3,10) will set A[3] = 10. Note that array A might not be completely sorted after an update. is Sorted (i) - returns true if the subarray A[0... i] is sorted, otherwise it returns false. A straightforward implementation of the two operations using only the given array can be done as follows: update operation can directly change the value of A[i] to x. is Sorted will scan A[0] up to A[i] while checking if elements are non-decreasing. With the above implementations, update takes 0(1) time but is Sorted takes O(n) time. a. Give another implementation where update takes O(n) time while isSorted takes O(1) time. b. Describe how to use a balanced BST to implement both operations in O(log n) time. Discuss why…
15. Consider the problem of finding the first position in which an array b occurs as a subsequence of an array a. Write two nested loops: let result undefined for (let i = 0; i < a.length - b.length; i++) { for (let j = 0; j < b.length; j++) { if (a[i+j] = b[j]) . . . } } Complete with labeled break and continue statements.
Let A and B be two integers valued arrays of sizes n1 & n2 respectively. The elements of the two arrays are sorted in increasing order and may contain duplicate elements.It is required to form a list, C, of distinct elements, in increasing order, that are in A but not in B and in B but not in A. (There shall be no duplicate elements in list C.)The two arrays, A & B, can only be traversed once.Example:A: -2, 2, 4, 4, 4, 7, 9, 9, 9, 12, 15,B: 1, 2, 5, 9, 15, 15, 15, 17, 17, 17C: -2, 1, 4, 5, 7, 12, 17
5. Splitting an Array Use Python Suppose the elements of an array A containing positive integers, denote the weights in kilograms. And we have a beam balance. We want to put the weights on both pans of the balance in such a way that for some index 0 < i < A.length - 1, all values starting from A[0], A[1], upto A[ i - 1], should be on the left pan. And all values starting from A[i] upto A[ A.length - 1] should be on the right pan and the left and right pan should be balanced. If such an i exists, return true. Else, return false. Input: [1, 1, 1, 2, 1] Output : true Explanation: (summation of [1, 1, 1] = summation of [2,1]) Input: [2, 1, 1, 2, 1] Output: false Input: [10, 3, 10, 2, 1] Output: true Explanation: (summation of [10, 3] = summation of [10,2,1])) %3D
7.Code for----- an array of meeting time intervals consisting ofstart and end times [[s1,e1],[s2,e2],...] (si < ei),determine if a person could attend all meetings. For example,Given [[0, 30],[5, 10],[15, 20]],return false.""".
Write an algorithm to calculate the average of a list of numbers. The algorithm should be understandable by a person who does not know a computer programming language (not written in code). Do not use pre-defined functions. The algorithm should be able to be converted into a computer program on a line by line basis (or at least close to it). Example of an algorithm for a binary search: Find the midpoint of the sorted array / list by dividing its length by 2. Compare the midpoint to the value of interest. If the midpoint is larger than the value, perform binary search on right half of the array. If the midpoint is smaller than the value, perform binary search on left half of the array. Repeat these steps until the midpoint value is equal to the value of interest or we know the value is not in the array. Python
9).An array of integers nums sorted in ascending order, find the startingand ending position of a given target value. If the target is not found in thearray, return [-1, -1]. For example:Input: nums = [5,7,7,8,8,8,10], target = 8Output: [3,5]Input: nums = [5,7,7,8,8,8,10], target = 11Output: [-1,-1]. Please weite your Code.
“A” array has a members and “B” array has b members which are sorted. I need an algorithm to find the k-th member in a new array which is a mix of “A” and “B”. The runtime must be O(log(a+b))
The following procedure sums up all the prefix of an array a into a vector p. The loop body has some unnecessary pointer dereference that affects the performance negatively. Remove those pointer dereference from the loop body and write down the resulting code. void pum(float a[], float p[], long n) { long i; p[0] = a[0]; for (i = 1; i