10) Write a recursive algorithm to find the k-th even natural number (note: the first natural even number is zero). k=1 -> output: 0, k=2-> output: 2, k=3-> output: 4, [Just complete the following code fragment.] Algorithm Even (k) { Input: k, a positive integer number Output: k-th even natural number [complete this part ...] }

10) Write a recursive algorithm to find the k-th even natural number (note: the first natural even number is zero). k=1 -> output: 0, k=2-> output: 2, k=3-> output: 4, [Just complete the following code fragment.] Algorithm Even (k) { Input: k, a positive integer number Output: k-th even natural number [complete this part ...] }

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

Write a recursive function that adds all the elements in an array. The function will take two arguments, 1) An integer value that is greater than 0 and indicates the size of the array, and 2) An integer array of that size. The function should return an integer value that is the sum of the elements in the array. The function should add elements of the input array using recursion and should not use a loop.ii) Read both a string and the key (integer) is entered through the keyboard. Define a function to encrypt each and every character in a string with the given key. As a programmer, implement the same by writing the C code using pointers. If the given Key is positive, then traverse towards left of the character in the Alphabet sequence. Otherwise, move traverse towards the right of the character in the Alphabet sequence. Example : if the given string is "PRADEEP" and Key = 3 then the encrypted string is "SUDGHHS" iii) An ISBN (International Standard Book Number) is a 10 digit number…
Chapter 8 Irvine book, When I compiled this code I get the following errors ;Greatest Common Divisor Comment !Write a recursive implementation of Euclid’s algorithm for finding the greatest common divisor (GCD) of two integers. Descriptions of this algorithm are available in algebra books and on the Web. Write a test program that calls your GCD procedure five times, using the following pairs of integers: (5,20), (24,18), (11,7), (432,226), (26,13). After each procedure call, display the GCD.! INCLUDE Irvine32.incCalcGcd PROTO,int1:DWORD, int2:DWORD .dataarray SDWORD 5,20,24,18,11,7,438,226,26,13str1 BYTE "Greatest common divisor is: ",0 .codemain PROC mov ecx,LENGTHOF array / 2 mov esi,OFFSET array L1: INVOKE CalcGcd,[esi],[esi+4] mov edx,OFFSET str1 call WriteString call WriteDec call Crlf add esi,TYPE array * 2 loop L1 exitmain ENDP ;---------------------------------------------CalcGcd PROC, int1:DWORD, int2:DWORD;; Calculate the greatest common…
Write a recursive function to sort an array of integers into ascending order using the following idea: the function must place the smallest element in the first position, then sort the rest of the array by a recursive call. This is a recursive version of the selection sort. (Note: You will probably want to call an auxiliary function that finds the index of the smallest item in the array. Make sure that the sorting function itself is recursive. Any auxiliary function that you use may be either recursive or iterative.) Embed your sort function in a driver program to test it. Turn in the entire program and the output.
Midterm Practice Problems 1. Use recursion to write a function count_ones that returns how many Is there are in a number n when represented in decimal (base 10). For example, 1231 has two 1s. You can assume that n is nonnegative and at most 9 digits long. Do not use global (or static) variables. In main perform at least three tests of count_ones and use assert to check that the returned value is correct. Your function should have the following prototype: // count_ones (n) returns the number of is in the decimal representation of n // requires: 0 <= n < 10^9 int count_ones (int n);
1. Given, nCr= n! (n-r)!r!" Write a function to compute nCr without recursion.
A 5-digit positive integer is entered through the keyboard, write a function to find reverse of the 5-digit number:(1) Without using recursion(2) Using recursion
T/F 9. As loop variables and recursive solutions are also not used for iterative solutions, the recursive solution generally makes memorization more effective (use fewer stored) than the corresponding iterative solution.
use java
One-friend recursion vs iteration. 1. Your objective is to receive the tuple a1, a2,..., a and return the tuple an, an1,..., a1 that has been inverted. You will only take an element off of one end or put an element back on one end because you are being lazy. But you have friends in recursion who can assist you.Please provide the recursive code as well as a paragraph with the friend's description of the algorithm.2. Now imagine that you lack friends but have a stack. Quickly design an iterative programme to address this issue. Include loop invariants and other crucial stages that are necessary to describe an iterative method.3. Trace both of these scripts separately. On a computer, step by step compare and contrast their calculations.
1.)I have to recursive with python language and was asked to do a buy 2 get 1 free where you have some amount of money(x) each item costs a given amount(y), for each 2 item you get 1 free, builda recursive solution to find out how many items you can buy for x amount of money. 2.) Buy M, get N free Then alter your first answer to allow for the user to enter any M and N for how many you need to buy to get free items