Provide me correct solution thanks1 Consider the following pseudocode for an algorithm called “Algorithm1", whichreadsprocedure Algorithml(a1, a2, ..., an:: integers)**..I:= a1for i = 2 to nI:= x + a,return aSuppose a list a1, a2, ...,a, of integers is given as an input.a) Describe what Algorithml(a1, a2, ., an) returns as output.b) How many times would the expression r := r+a; be executed?c) Give a O estimate for the time complexity of this algorithm (worst case).

a) To understand what the algorithm does, it starts by setting . After the first iteration, it sets…

Consider the following pseudocode for an algorithm called “Algorithm1", which reads procedure Algorithml(a, a2, ., an:: integers) I:= a1 for i = 2 to n I:=I+a, return r Suppose a list a,, az, ., a, of integers is given as an input. a) Describe what Algorithml(a, a2, ., am) returns as output. b) How many times would the expression z :=1+a, be executed? c) Give a e estimate for the time complexity of this algorithm (worst case).

Consider the following pseudocode for an algorithm called “Algorithm1", which reads procedure Algorithml(a, a2, ., an:: integers) I:= a1 for i = 2 to n I:=I+a, return r Suppose a list a,, az, ., a, of integers is given as an input. a) Describe what Algorithml(a, a2, ., am) returns as output. b) How many times would the expression z :=1+a, be executed? c) Give a e estimate for the time complexity of this algorithm (worst case).

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

Design and implement an algorithm that gets as input a list of k integer values N1, N2,..., Nk as well as a special value SUM. Your algorithm must locate a pair of values in the list N that sum to the value SUM. For example, if your list of values is 3, 8, 13, 2, 17, 18, 10, and the value of SUM is 20, then your algorithm would output either of the two values (2, 18) or (3, 17). If your algorithm cannot find any pair of values that sum to the value SUM, then it should print the message ‘Sorry, there is no such pair of values’
a. Write a version of the sequential search algorithm that can be used to search a sorted list. (1, 2) b. Consider the following list: 2, 20, 38, 41, 49, 56, 62, 70, 88, 95, 100, 135, 145 Using a sequential search on ordered lists, that you designed in (a), how many comparisons are required to determine whether the following items are in the list? (Recall that comparisons mean item comparisons, not index comparisons.) (1, 2) 2 57 88 70 135 Write a program to test the function you designed. Note: Have the function,seqOrdSearch, return -1 if the item is not found in the list. (return the index of the item if found).
Assume that you were given N cents (N is an integer) and you were asked to break up the N cents into coins consisting of 1 cent, 2 cents and 5 cents. Write a dynamicprogramming based recursive algorithm, which returns the smallest (optimal) number of coins needed to solve this problem. For example, if your algorithm is called A, and N = 13, then A(N) = A(13) returns 4, since 5+5+2+1 = 13 used the smallest (optimal) number of coins. In contrast, 5+5+1+1+1 is not an optimal answer.
Construct a memoized algorithm for this algorithm and and derive its time complexity: Assume that you were given N cents (N is an integer) and you were asked to break up the N cents into coins consisting of 1 cent, 2 cents and 5 cents. Write a dynamicprogramming based recursive algorithm, which returns the smallest (optimal) number of coins needed to solve this problem. For example, if your algorithm is called A, and N = 13, then A(N) = A(13) returns 4, since 5+5+2+1 = 13 used the smallest (optimal) number of coins. In contrast, 5+5+1+1+1 is not an optimal answer. You do not need to prove the complexity bound formally, just derive it by analyzing each component in your algorithm.
The algorithm SkipListSort is a sorting algorithm that begins by inserting a sequence of keys into a skip list. Once you had done that, what would the remaining steps in the algorithm be? Give an asymptotic notation that best describes how long it would take to sort n keys this way (i.e., the entire SkipListSort algorithm) and briefly explain (in a sentence or two) why. The algorithm HashSort is a sorting algorithm that begins by inserting a sequence of keys into a hash table. Once you had done that, what would the remaining steps in the algorithm be? Give an asymptotic notation that best describes how long it would take to sort n keys this way (i.e., the entire HashSort algorithm) and briefly explain (in a sentence or two) why.
Describe using pseudocode as described in class an algorithm that takes a list of n integers al, a2,.., an, and returns the sum of the largest and smallest. Be sure to initialize the variables
Suppose that your implementation of a particular algorithm appears in C++ as for (int pass = 1; pass <= n; pass++) { for (int index = 0; index < n; index++) { for (int count = 1; count < 10; count++) { ... } // end for } // end for } // end for The previous code shows only the repetition in the algorithm, not the computations that occur within the loops. These computations, however, are independent of n. What is the Big O of the algorithm?
Consider the following recursive algorithmAlgorithm Power(n)//Computes 2?? recursively by the formula 2?? = 2??-1+ 2??-1//Input: A nonnegative integer n//Output: Returns 2??if n = 0 return 1else return Power (n - 1) + Power (n - 1) b) Draw a tree of recursive calls for this algorithm and count the number of calls made bythe algorithm.
design an algorithm to find all the common elements in two sorted lists of numbers. For example, for the lists 2, 5, 5, 5 and 2, 2, 3, 5, 5, 7, the output should be 2, 5, 5.What is the maximum number of comparisons your algorithm makes if the lengths of the two given lists are m and n, respectively?
For this exercise, a list of non-negative numbers will be given, for which the following operation can be done: subtract 1 from two contiguous elements from the list. It must say whether after any number of operations the list can be converted to a list of zeros. EntryThe input will be a list of non-negative integers x_i such that 0 <= x_i <= 2000000000. ". DepartureIf the given list can be converted to a list of zeros with the operation defined above, print "YES", otherwise, print "NO". Examples Input Example 1 1 2Output Example 1 NOT Input Example 2 2 4 2Output Example 2 YES
Consider the following recursive function to compute factorialint fact (int n) {if (n <= 1)return 1;elsereturn n * fact(n-1);}int main() {cout << fact(5) << endl;return 0;} Show the stack of activation records each time the function fact is called (either directly or recursively). Each activation record needs to be identified by the name of the function and the parameter value, but there is no need to elaborate the specific content of each activation record.
Develop a brute-force algorithm that finds the longest common sequential elements of two given lists with the Java programming language. For example, the following two lists are given: S1 = [B,C,D,A,A,C,D] S2 = [A,C,D,B,A,C] Common lists are: [B,C], [C,D,A,C], [D,A,C], [A,A,C], [A,C], [C,D], … Note that although both lists have a common [C,D,A,C] (sub)list, both list items are skipped and the left-to-right order is intact. Apply the brute force algorithm. Explain Time Complexity?