What does the ff. algorithm return? algorithm foo(a1, a2, ... , an : integers) k+ 0 for i +1 to n: if a; < O then kk + 1 return k O the sum of positive integers O None of the choices O the number of positive integers O the sum of negative integers O the number of negative integers

What does the ff. algorithm return? algorithm foo(a1, a2, ... , an : integers) k+ 0 for i +1 to n: if a; < O then kk + 1 return k O the sum of positive integers O None of the choices O the number of positive integers O the sum of negative integers O the number of negative integers

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

Related questions

Q: What is the output of the following algorithm if called as AlgorithmX(30,12) AlgorithmX(m,n) 1…

A: Ans: The output of the following algorithm if called as AlgorithmX(30,12) AlgorithmX(m,n) 1…

Q: What is the time complexity of the algorithm below? int sum = 0; for (int n = N; n > e; n /= 2) for…

A: Time comlexity

Q: 4- Name: FindMinInArray, Input: T (a sequence of n numbers T[1], T[2], ., T[n]), Output: min (the…

A: #include <iostream>using namespace std; void FindMinInArray(){ int n; cout<<"Enter…

Q: What does the ff. algorithm return? algorithm foo(a1, a2, .. , an : integers) ke0 for i+1 to n: if…

A: Ans : The given ff.. algorithm return : algorithm foo(a1,a2,a3,.....,an: integers) k <- 0 for…

Q: Algorithm Analysis: estimate the time complexity of the following methods using Big O notation.…

A: Time complexity in BIG O. (a) question a timed complexity: Ans: in question a i=0; i<n; i++ loop…

Q: void X(int n) { for(int i=0; i<n; i++) for(int j=0; j<n; j++) for(int k=0; k<n; k++)…

A: summary: - hence we discussed all the points

Q: What is the Big(O) of the following algorithm? k = 1 loop( k <= n ) j = 0 loop( j < n ) s = s +…

A: Given:

Q: Please explain What is the big-O complexity of the following algorithm? void mystery(int* a, int…

A: C. O(n)

Q: What is the running time of the following running time complexity. T(n) = Vn T(n – 1), base case:…

A: Here in this question we have given a recurrance relation and we have asked to find out the running…

Q: Consider the following recursive algorithm fib, which takes as input an integer n > 0: fib(n): if n…

A: Answer: Correct answer is 8. Because here call of Fib(99) then 99 is greater than 0 or 1 then run…

Q: The following code is supposed to return n!, for positive n. int factorial(int n){ if (n == 0)…

A: We are given a code which is suppose to be the logic for finding the factorial of positive number n.…

Q: Question 1 Consider the following segment of an algorithm: i = 1 Loop while (i < n) print("Hello…

A: As per Bartleby Experts guidelines, the first three questions are answered for you. To get the…

Q: *n = A.length; int x; for (int i = 0; i = 0) { System.out.println (A [0]); x--; }…

A: The correct answer along with the explanation is given below:

Q: What does the ff. algorithm return? (Note: indentation is importar algorithm foo(f : function, a1,…

A: According to the information given:- We have to find out the given information.

Q: QUESTION9 What is the time complexity of the following code? for (int i=1;i<=10;i++)…

A: Hey there, I am writing the required solution for the above mentioned questions. Solution for the…

Q: What is the time complexity of the algorithm below? int sum = 0; For (int i = 1; i < N; i*= 2) for…

A: Time compexity

Q: Let T(n) be the number of operations an algorithm needs to solve a problem of size n. We say that an…

A: We need to find the correct option regarding time complexity.

Q: Create an algorithm which takes a positive integer n as an input then draws a cross on the screen…

A: Algorithm : 1. Enter value of n. 2. Create a loop for row from 0 to n*3. Such as i=0 to i<n*3 3.…

Q: The following method of computing a is due to Archimedes: 1. Let A = 1 and N =6 2. Repeat 10 times,…

A: code : % Draw the unit circle clf; t=linespace90,2*pi,200); plot(cos(t),sin(t),'b--); axis equal…

Q: Consider the following recursive algorithm: Int relog(int num) if (num < 1) return 10%3; else return…

A: NOTE - As per our guideline we are supposed to solve one question from multiple questions, so please…

Q: What is the running time of the following algorithm. f(n){ for(int j = 1; j<=7; j++) f(n/7): for(int…

A: I'm providing the answer of the above question. I hope this will be helpful for you...

Q: Consider the following recursive algorithm. 1]) ALGORITHM Riddle(A[0..n â^' 7/Input: An array A[0..n…

A: Answer: I have done code and also I have attached code and code screenshot as well as output

Q: What does the ff. algorithm return? (Note: indentation is important) algorithm foo(a1, a2, ..., an :…

A: We are given an algorithm and we are going to find out what is the logic of the code and we are…

Q: Algorithm mysterious(A[0..n − 1]) //Input: Array A[0..n − 1] of numbers //Output:…

A: Answer: 1.) This algorithm is clearly used to find the maximum absolute difference between 2…

Q: What is the running time of the following algorithm. f(n){ for(int j = 1; j<=7;j++) f(n/7): for(int…

A: Below is the answer to above question. I hope this will be helpful for you...

Q: Suppose that you have five different algorithms (A, B. C. Dand E) for solving a problem. To solve a…

A: The Answer is

Q: When a and b are natural numbers we usually say that "b fits q times in a and subtract r". This…

A: 1)Read a,b numbers 2)Assign r=a , q=0 3)use while loop until r>=b and increase count q to count…

Q: Given a non-negative int n, return the count of the occurrences of 7 as a digit, so for example 717…

A: the program is given below:-

Q: 2. What value is returned by the following algorithm? What is its basic operation? How many times is…

A: Given : The algorithm that inputs n and outputs the value r is based on some computation. To find…

Q: What is the complexity of the following algorithm in terms of Big-0? Algorithm func(x) sum =0 for i…

A: 1. Option (2). O(n) is the correct answer.

Q: What is the growth rate of the following algorithm? Is the worst case different than the average…

A: y = 1;//runs for 1 timefor (i=1; i<=n; i++)//runs for i=1 to n : means n+1 times, last time…

Q: 1. By inspecting the pseudocode, answer the following questions: Algorithm partialSum( partialSum,…

A: a. The basic operation for each line is explained below: //declare and initialize the integer…

Q: For the given Cexamples write the simplified algorithm complexity O(?) for each of the following…

A: As per our guidelines we are supposed to answer only one question in case of multiple questions.…

Q: The BF algorithm worst time complexity of the large integers multiplication is O a. O(logn) O b.…

A: Answer: Option C On2

Q: Do the following algorithms contain recursion and/or iteration? int algorithm1(int x) { int…

A: A finite series of well-defined, instructions implementable by a computer used to resolve a series…

Q: What is the time complexity of the algorithm below? int sum = 0; for (int i = 1; i < N; i*= 2) for…

Q: Suppose that you have five different algorithms (A, B, C, D and E) for solving a problem. To solve a…

A: An algorithm (pronounced AL-go-rith-um) is a procedure or formula for solving a problem, based on…

Q: for ( i = 0; i < n; i++ ) msis[i] = A[i];

A: Time complexity is the computational multifaceted nature that depicts the measure of PC time it…

Q: Write an algorithm to get the second largest number in a given set of numbers? use java program.

A: Coded using Java.

Q: What is the time complexity of the following pseudo code given below? int m = n; while (m > 0) { Do…

A: Let, the while loop will run k times. It will start from m = n, and last iterate when m = 1. In each…

Q: (1) i = N; (2) while (i >= 1) { (3) (4) System.out.print("Enter a number: "); keyboard.nextInt();…

A: Here Line 1 will be executed only once. Then while loop will run from i=N to I=1 i.e it will run N…

Q: Exercise: Which of the following statements is/are valid? 1. Time Complexity of QuickSort is O(n^2)…

A: According to the asked question, the solution is given below with a proper explanation.

Q: What is the approximate execution time of a program corresponding to an O(n^2) algorithm if n is…

A: O(n^2) :- means the number of time the program execute is n*n if n is 10000 then For O(n^2 ) it…

Q: What is the time complexity of the algorithm? Consider the following array values and apply quick…

A: The time taken would be (n+1) + ((n+1) * (n)) + (n+1) + (n+1) So, time complexity ~ O(n^2)

Q: What is the growth rate of the following algorithm? y = 1; for (i=1;…

A: O(n 2) - Time complexity is considered as O(n2) when there are two loop in which one is nested loop…

Q: can you please fix the AssertionError in this: (please don't use try and except or break/continue or…

A: The correct Python code along with the screenshot of code and output is given below:

Q: What is the time complexity of the following code: for( int i = n; i> 0; i-- ) { for( int j = 1:j =…

Q: What is the Big(O) of the following algorithm? i = 1 loop (i <= 5) j = 1 loop (j <= n) k = 1 %3D…

A: The solution to the given problem is below.

Q: ndicate the run time complexity: For (int i = 1; i < n; i*=2) k++; O Ollg n) O O(2") O O(n²) O O(n)…

A: We are given a code and we are going to find out it time complexity. I have solved it step wise to…

Q: 2. What value is returned by the following algorithm? What is its basic operation? How many times is…

A: The explanation is given in next step As per Bartleby rules we are answering the first 3 questions.

Question

What does the ff. algorithm return?
algorithm foo(a1, a2, ... , an : integers)
ke0
for i +1 to n:
if a; < 0 then kk+1
return k
O the sum of positive integers
O None of the choices
O the number of positive integers
O the sum of negative integers
O the number of negative integers

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Let two words be given. At least how many steps must be taken to make one of these two words like the other? Each step can be one of the following 3 steps: 1- Drop a letter 2- Changing a letter 3- Add a letter (anywhere) Solve the question using only a brute force algorithm. Explain your solution and question write program in java language and calculate time complexity?
calculate number of operations in this algorithm void my_dgemv(int n, double* A, double* x, double* y) { double alpha=1.0, beta=1.0; int lda=n, incx=1, incy=1; cblas_dgemv(CblasRowMajor, CblasNoTrans, n, n, alpha, A, lda, x, incx, beta, y, incy); }
What is the output of the following algorithm if called as AlgorithmX(30,12) AlgorithmX(m,n) 1 while n ≠ 0 do 2 r ← m mod n 3 m← n 4 n ← r 5 return m
Write an algorithm to count how many integers from 1 to n (where n is inputted by the user) are not perfect squares, perfect cubes, or perfect fifth powers.
Please send me the answer within 10 min!! i will rate you good for sure!! Please solve all 3 parts in Java with explanation!! Algorithm A: long sum = 0; for (long i = 1; i <= n; i++) sum = sum + i; Algorithm B: sum = 0; for (long i = 1; i <= n; i++) { for (long j = 1; j <= i; j++) sum = sum + 1; } // end for Algorithm C: sum = n * (n + 1) / 2; implement the above three algorithms: There you have the algorithm A, B and C. You will run the three implementations of the algorithms with inputs and do the computation but it does not need to print to the screen the actual sum (for the last value it could exceed the maximum value stored into a long); it should print on the screen the time taken for the running of the algorithm : 1,000,000 1,000,000,000 1,000,000,000,000,000,000 To print the time you should use something like long startTime = System.currentTimeMillis(); methodA(1000000); long endTime = System.currentTimeMillis(); System.out.println("That method…
Your goal is to guess a secret integer between 1 and N. You repeatedly guess integers between 1 and N. After each guess you learn if your guess equals thesecret integer (and the game stops). Otherwise, you learn if the guess is hotter (closer to)or colder (farther from) the secret number than your previous guess. Design an algorithm that finds the secret number in at most ~2 lg N guesses. Then design an algorithmthat finds the secret number in at most ~ 1 lg N guesses.
What is the time complexity of the following algorithm? Select one: a. O(n3) b. O(n4) c. O(n5) d. O(n2)
Given two variables A and B, with integer values, write an algorithm that changes the values of the variables, without creating a new variable.ex: A = 3, B = 5 -> A = 5, b = 3)
Write an algorithm without loops that reads 5 distinct integers and displays the largest value. Assume the input values are distinct integers.
Question #1. Product in the Range [N...M]Write a Program that reads a starting number (N) and ending number (M) and prints all the numbers product betweenthe rangesFor instanceN= 2 M= 6 X=7202*3=6 6*4=24 24*5=120 120*6 =720 Solve with C#
An n x n square is divided into 1 x 1 squares, each of which must be colored black or white. The number of desired black squares in each horizontal and vertical row is given by arrays H[1..n] and V [1..n]. Give an algorithm that colors the squares, or reports that this is impossible.
Simplistic Algorithms with a Fixed Number of Integers Write a program that takes three integers and outputs them in reverse order of how they were entered. For example, if the user enters 39, 51, 16 then the program should output 16, 51, 39.