s the below function iterative or recursive? Int calculate(char x[), int n, char input) int count e return e; 1f (x(n) Input) count- return (count + calculate(x, n- 1, irput)): recursive O cannot tell from the code O iterative Question 8 Consider an algorithm that requires the following number of operations (time units) for these input sizes (n). The algorithm is www . Input size Operations 500 20,000 1000 40,000 2000 80,000 O Oln) O 011) O Oln

s the below function iterative or recursive? Int calculate(char x[), int n, char input) int count e return e; 1f (x(n) Input) count- return (count + calculate(x, n- 1, irput)): recursive O cannot tell from the code O iterative Question 8 Consider an algorithm that requires the following number of operations (time units) for these input sizes (n). The algorithm is www . Input size Operations 500 20,000 1000 40,000 2000 80,000 O Oln) O 011) O Oln

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

The following code implements Newton's algorithm for finding the square root of a number using repetition: n = 17 # we want the square root of 17 for exampleg = 4 # our guess is 4 initiallyerror = 0.0000000001 # we want to stop when we are this closewhile abs(n - (g**2)) > error: g = g - ((g**2 - n)/(2 * g))# g holds the square root of n at this point Implement this algorithm in a function sqRoot(n), that returns the square root using recursion. Assume that the function will be called with positive numbers only. Note: Your initial guess cannot be zero!
python code. instructions are given below. Run function is already done. 1) def binary_search_rec(x, t, start, end): """ Return the left most index of x if x is in t indexed between [start, end] inclusive Otherwise return -1 You may assume that both start and end are valid index for t. Use Recursion, Do Not Use loops Your algorithm should be logarithmic to number of elements between [start, end] regardless of how many duplicates of x is. """ return 0 2) def binary_search_loop(x, t, start, end): """ Return the left most index of x if x is in t indexed between [start, end] inclusive Otherwise return -1 You may assume that both start and end are valid index for t. Use loop, Do Not Use Recursion Your algorithm should be logarithmic to number of elements between [start, end] regardless of how many duplicates of x is. """ return 0
The Lucas numbers are a series of numbers where the first two Lucas numbers (i.e., at indices 0 and 1) are 2 and 1 (respectively) and the kth Lucas number L_k (where k>1) is L_(k-1) + L_(k-2). Consider the following recursive definition for a function that is supposed to find the nth element of the Lucas numbers. Select the best option that identifies the line of code that prevents this function from running recursively and provides the correct code. Question options: line 5 should be return recursive_function(n-1) + recursive_function(n-2) line 3 should be return [2,1][n-1][n-2] line 3 should be return [2,1][n-1] line 2 should be if n <= 2: line 5 should be return recursive_function(n-1 + n-2) None of these options
Please answer fast Question 1 Answer following questions and write corresponding algorithms. Algorithm: sqrt(n) [main] 1. return sqrtHelper(Arg 1, Arg 2) Algorithm: sqrtHelper(n,m) 1. if m*m <= n 2. return m 3. else 4. return sqrtHelper(Arg 3, Arg 4) 5. endif (a) Write an recursive algorithm called isPrime(n) that takes a positive integer and returns True if it is prime and False otherwise. You must call the function sqrt(n) as a sub- algorithm. Trace your algorithm for isPrime(41). You only need to show the detail in the main algorithm and its helper function (if there is any).
1. (a) Write a recursive o function for performing binary search on an array of integer. Show how to use this function with sample call from main(). For an input array A={2,6,8,14, 18, 19,37,46, 77}, show each step of algorithm when searching for the value (i) 46 (ii) 17 in the array. (b) Give a structure for storing a active COVID cases in a state. It should consist of the state name (20 characters)and number of active COVID 19 cases (integers) in each state. Each of the 250 students of Btech 1st year (all sections). Inside main () create and array of structure type for holding this information. Write a function that sorts this array in ascending order of active COVID 19 cases, so that we can rank the states in order of the number of cases in each state of the country. (c) Write a function called input() that reads the content of 2-D array( A matrix) row by row. Write a second C function called mult() that takes two matrices and their dimensions as argument and computes. Their…
Q1. Write the code necessary to find the largest element in an unsorted array of integers. What is the time complexity of this algorithm? Q2. Determine the growth function and order of the following code fragment: for (int count=0; count < n; count++) { for (int count2=0; count2 < n; count2=count2+2) { System.out.println(count, count2); } } Q3. Determine the growth function and order of the following code fragment: for (int count=0; count < n; count++) { for (int count2=0; count2 < n; count2=count2*2) { System.out.println(count, count2); } } Q4. What is the order of the following growth functions? 10n2 + 100n + 1000 10n3 – 7 2n + 100n3 n2 log n Q5. Arrange the growth functions of Q4 in ascending order of efficiency for n=10 and again for n = 1,000,000.
Write a pseudocode for the following problem statement and clearly mention the time complexity in big O notation. Given an array of N integers, determine whether the sequence is in strictly increasing order (i.e. each number is greaterthan the last). Return True if condition is satisfied, False otherwise.
(In python) Create a recursive function, rec_list(n), that takes in the user input n and returns an array of integers from 2 through n (i.e. [2, 3, 4, …, n]). Input:The input is an integer from the range 2,200 (inclusive). Assume that the input is always valid. Sample Output:rec_list(20)[2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20]
In this lab, we will - Use recursion functions to form a string from tally marks. Practice recursion with terminating conditions Apply string concatenation to create a string using different substrings Apply recursion in the return statement of a function Instructions Tally marks are an example of a numeral system with unary encodings. A number n is represented with n tally marks. For example, 4 is represented as the string "| | | |", where each vertical line "|" is a tally. A recursive version of this definition of this encoding is as follows: Base Case 1: 0 is represented with zero tally marks which returns an empty string Base Case 2: 1 is just one tally without any spaces, so return a "|" directly Recursive Case: A positive number n is represented with (1 + the number of tally marks in the representation of n-1) tally marks. Here, we would string append a tally with a space and call the function recursively on the remainder n-1 number. Write a recursive function to calculate the…
Need some help with this c++ recursive function: Write the function int countEights(int n). Inside the function, compute recursively (no loops) the count of the occurrences of 8 as a digit inside the parameter n. Except that an 8 with another 8 immediately to its left counts double, so 8818 yields 4. Note that mod (%) by 10 yields the rightmost digit (126 % 10 is 6), while divide (/) by 10 removes the rightmost digit (126 / 10 is 12). Here are some examples: countEights(8) returns 1 countEights(818 returns 2 countEights(8818) returns 4
Note: Solve using c++ Write a recursive function to get count of a specific character in given string or array ofcharacters.Prototype of Function: int getCharCount(const char* ptr, char c)Input: const char* ptr=” wavelength”, char c=’e’Output: 2 (as ‘e’ occurs two times in the “wavelength”)
Q#2 Write a recursive function zeroCount ( int a[ ], int s, int e) that receives an array of integers a [], a start index s, and an end index e. The function should return the number of zeros in that array between s and e. int zeroCount ( int a[ ], int s, int e); Trace your function given the following array and function call. Draw your steps. int a[ ] = {1, 0, 0, 5}; int zeros = zeroCount(a, 0, 3); language c++