Answered: a) for (i = 0; i

Engineering

Computer Science

a) for (i = 0; i

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

- Writea C++ code (using a function) to read an integer value time (T) and convert it to equivalent minutes (M) and hours (HE - Write a C++ code using recursive function to find the cube of n number.ﬂ
Code In C++.
2 - Find the maximum number for (m=10, n =5 , k= 62) use suitable library function order.(the max number will stay integer ).Programing of computers By FORTRAN
Q:1 a) Can a predefined function be recursively called by the programmer? Elaborate. b) Write a program in C to take input for an integer.If the given integer is prime then display the product of its digits otherwise check whether it is even or odd.Use minimum three functions including main function.
Question 1 Suppose you have to design a number calculation system. You need to write a recursive function that will take a 2 dimensional array / list(in python) of numbers. You need to find the minimum number of the array / list using a recursive function. Implement the following recursive function. [You can not use any loop in the code) Hint: You will need nested recursive functions. (Note for Implementation: You are not allowed to use any built-in functions except len() and print() in Python and any kind of global/class variable]. def firstFunctionMin (arr, index1, index2, min) : #To Do return OR public int firstFunctionMin (int[] 1 arr, int index1, int index2, int min) { 1/TO Do return Sample Input Sample Output Explanation [[10, 2, 13), [4, 15, 16], [7, 8, 2 9]] Here, in the list the minimum number is 2. [[15, 18). [4, 17]] Here, in the list the minimum number is 4.
(b) Good Programming practices help in improving programs readability and understandability both for a programmer and for a general user. What changes would you make in the following program, written by a beginner, keeping in view the good programming practices. You are also required to write the output of the program if a user wants to find factorial of number 6. Note: The Program finds/calculates factorial of a number using a user defined recursive function. #include<iostream> using namespace std; int f(int n); int main() {int n; cout << "Enter: "; cin >> n; cout << "Answer = " <<factorial(n); return 0; int f(int n) { } if(n > 1)return n * f(n - 1); else return 1; }
Refer to Code Segment 1 and Code Segment 2. Assume variables have been declared accordingly with their appropriate data type; and value for n is user supplied. Line numbers are provided for easy referencing. Line Code Segment 1 (1) (2) (3) (4) (5) (6) for i = 1 to n { for j = 1 to n { val = i*j print val Line Code Segment 2 (1) (2) (3) (4) (5) (6) for i = 1 to n *n { r = (i-1) /n c = (i-1) % n val = (r+1) * (c+1) print val Answer the questions below: 1. Both Code Segments 1 and 2 perform the same task AND the execution time of Code Segment 1 scales slower than the execution time of Code Segment 2 as we increase n. Write TRUE if the statement is true, FALSE otherwise. 2. In Code Segment 1, how many times will line 4 be executed in terms of n? 3. In Code Segment 2, how many times will line 5 be executed in terms of n?
Write a C++ program to do the following: - 1) Define a recursive function that displays the following series without using any type of loops. 45 42 39 36 33 30 27 24 21 18 15 12 9 6 3 2) Define a recursive function that takes one integer parameter value and calculates and returns the sum of integers from 1 to this value. (Hint Sum of 7 = 1+2+3+4+5+6+7=28) 3) In the main () function do the following: - [7 > Call the first function to display the above series. > Display the values from 1 to 5 with their summations using the above second function as follows: - 1 1 3 3 6. 10 5 15
Call by value in programming means that a copy of variable value is pased from function calling part to function definition part. Call by reference means that an address of variables are passed from calling part to function definition. arrow_forward Step 2 Call by reference is used to avoid extra memory usage because in call by reference same variables addresses are passed. Any changes made will reflect back. So it doesn't require extra variable to hold data. Call by value in programming is used where memory storage is not concern. Scenario in which actual value must not be disturbed then in these type of cases, call by value is used. We can't use only one because user requirement changes. Sometimes user tella actual data should be preserved and he/she want any data processing, in such scenario programmers use call by value. Some users only want calculated result. In such cases, programmers use call by reference to preserve memory usage. So it is totally dependent on user…
#4. Euler's totient function, also known as phi-function ϕ(n),counts the number of integers between 1 and n inclusive,which are coprime to n.(Two numbers are coprime if their greatest common divisor (GCD) equals 1)."""def euler_totient(n): """Euler's totient function or Phi function. Time Complexity: O(sqrt(n)).""" result = n for i in range(2, int(n ** 0.5) + 1): if n % i == 0: while n % i == 0: n //= i.
300-500 words per discussion and avoid plagiarism.a. Explain recursive function.b. Using factorial with your own example, explain a c++ factorial function.c. Using factorial with your own example, explain a c++ Fibonacci Series algorithm.
Objective: Practice writing recursive functions in python3 Make the five recursive functions described below in python3 by using the starter code recursive_functions.py. For each function, figure out how to solve it conceptually : write down the base case (when recursion stops) and how each recursive function-call moves towards the base case. The functions should not print anything (except you may add temporary print statements to help debug them). You can test your program by using the provided program test_recursive_functions.py. Don't edit the test program. Put it into the same directory (folder) with your recursive_functions.py and run it. It will import your functions as a module, test your functions, and tell you when each function is returning correct results. 1. Factorial In math, if you have a number n, the factorial function (written n!) computes n x (n-1) x (n-2) x (n-3) x ... x 1. For example: 0! is defined to be 1 1! = 1 2! = 2 x 1=2 3! = 3 x 2 x 1=6 4! = 4 x 3…