X274: Recursion Programming Exercise: Cannonballs Spherical objects, such as cannonballs, can be stacked to form a pyramid with one cannonball at the top, sitting on top of a square composed of four cannonballs, sitting on top of a square composed of nine cannonballs, and so forth. Given the following recursive function signature, write a recursive function that takes as its argument the height of a pyramid of cannonballs and returns the number of cannonballs it contains. Examples: cannonball(2) -> 5 Your Answer: 1 public int cannonball(int height) { 4} 5. Check my answer! Reset Next exercise

X274: Recursion Programming Exercise: Cannonballs Spherical objects, such as cannonballs, can be stacked to form a pyramid with one cannonball at the top, sitting on top of a square composed of four cannonballs, sitting on top of a square composed of nine cannonballs, and so forth. Given the following recursive function signature, write a recursive function that takes as its argument the height of a pyramid of cannonballs and returns the number of cannonballs it contains. Examples: cannonball(2) -> 5 Your Answer: 1 public int cannonball(int height) { 4} 5. Check my answer! Reset Next exercise

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

Please solve quickly, object-oriented programming in c++
C CodeApproved Libraries:<string.h> *not allowed in some questions<math.h><stdlib.h><time.h> (for srand(time(0)) only)
Fill in the c code for the question below: Define the function: void deleteAtV1(int num[], int *count , int pos); //The function deletes the item at pos For example: Test Result int num[10]={4,5,1,2,8}; int coun=5; deleteAtV1(num,&count,2); display(num,count); 4528 code: void display(int num[], int size){ int i; for(i=0;i<size; i++) printf("%d", num[i]);} // Fill up this missing code to delete [2} in the array
In C++,
Write a recursive function that finds and returns the sum of the elements of an int array. Also, write a program to test your function.
Write a RECURSIVE function, without using any loops, that prints the contents of a matrix with 3 columns. The function should take the matrix and the number of rows as arguments. void print_matrix(int arr[][3], int num_rows);
Problem Statement: The mathematician Conway imagined a game, called game of life, which considered cells that are susceptible to reproduce, disappear, or survive when they obey certain rules. These cells are represented by elements on a grid of squares, where a grid has an arbitrary size. Thus, each cell (except those on the boundaries of the grid) is surrounded by eight squares that contain other cells. The rules are stated as follows: 1. Survival: Each cell that has two or three adjacent cells survives until the next generation.2. Death: Each cell that has at least four adjacent cells disappears (or dies) by overpopulation. Also, each cell that has at most one adjacent cell dies by isolation.3. Birth: Each empty square (i.e., dead cell) that is adjacent to exactly three cells gives birthto a new cell for the next generation.It is worth noting that all births and deaths occur at the same time during a generation. Write a program that simulates this game and displays all successive…
Design and write a program in C that will a) Prompt user to enter a vector with no more than 10 digits. b) Read and store the vector, ensure The vector can contain spaces. c) Transpose the vector from a row vector to a column vector using a recursive function. Eg. When prompted the user enters in the command line A vector of no more than 10 digits from 0 to 9 : 1 2 3 4 5 Output 1 2 3 4 5
In OCaml programming language:
Language: C Write a program to reverse an array using recursion. a) Declare an array of N integers. Use the preprocessor #define directive for the size of the array. Fill it with pseudorandom numbers. b) Define the recursive procedure, that reverses the array by swapping the last with the first element, and then recursively swapping the remaining subarray. To this end, define the function void reverseArray(int *inputArray, int leftIndex, int rightIndex). The function should stop the recursion, whenever leftIndex >= rightIndex. c) Print your original, and the reversed array. Test your results for both even, and for odd N.
Consider the following function main:Int main(){int inStock[10][4];int alpha [20];int beta[20];int gamma[4]= {11,13,15,17};int delta [10] = {3,5,2,6,10,9,7,11,1,8};} a) Write the definition of the function setZero that initializes any one-dimentional array of type int to 0.b) Write the definition of the function inputArray that prompts the user to input 20 numbers and stores the numbers into alpha.c) Write the definition of the function doubleArray that initializes the elements of beta to two times the corresponding elements of alpha. Make sure that you prevent the function from modifying the elements of alpha.d) Write the definition of the function copyGamma that sets the elements of the first row of inStock to gamma and the remaining rows of inStock to three times the previous row of inStock. Make sure that you prevent the function from modifying the elements of gamma.e) Write the definitions of the function copyAlphaBeta that stores alpha into the first five rows of inStock and beta…
Use only Arrays and Structures, Pointers and Functions or Object Oriented Programming