A and B 9. Consider the following function:int rec (int array[], int n) {int p;if (n < 0)return 0;if (array[n] <0)else {return 10;System.out.println(array[n]);array[n] + rec (array,n-2);System.out.Rrintln(p);returnp;}}A. What is printed? Show your box trace.int[] arr ={60, 40, 20, 50, 90, 80, 30, 10};System.outprintln(rec (arr,7));B. What is printed? Show your box trace.int[] arr =System.outRrintln(rec (arr,8));{60, 40, -20, 50, 90, 80, 30, 10, 70};

Output: 108050404090170180180 Recursive function call tree:

9. Consider the following function: int rec(int array[], int n) { int p; if (n < 0) if (array[n] < return 0; 0) return 10; else { System.out.println(array[n]); array[n] + rec (array,n-2); System.out.println(p); p = return p; } } A. What is printed? Show your box trace. int[] arx {60, 40, 20, 50, 90, 80, 30, 10}; System.outprintln(rec (arr,7)); B. What is printed? Show your box trace. { 60, 40, -20, 50, 90, 80, 30, 10, 70}; int[] arr = System.outprintln(rec(arr,8));

9. Consider the following function: int rec(int array[], int n) { int p; if (n < 0) if (array[n] < return 0; 0) return 10; else { System.out.println(array[n]); array[n] + rec (array,n-2); System.out.println(p); p = return p; } } A. What is printed? Show your box trace. int[] arx {60, 40, 20, 50, 90, 80, 30, 10}; System.outprintln(rec (arr,7)); B. What is printed? Show your box trace. { 60, 40, -20, 50, 90, 80, 30, 10, 70}; int[] arr = System.outprintln(rec(arr,8));

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

Java Program. Write a function that returns the index of the smallest element in an array of doubles. If there are more such elements than one, return the last index is fine. Using the following header: int IndexOfSmallestArray(double array[], int size) Finish the function implement only.
2. Implement a function called findMinGap that will return the smallest gap betweenadjacent entries of an integer array. A gap between two numbers is the absolutevalue of their difference. For example, if an array contains the elements {10, 14,-5, -3, 0, 5, 7}, the minimum gap is 2 (between -5 and -3).Title line: int findMinGap(int array[], int length)
Implement the function below. void swap(int pos1, int pos2){} Initial code to be completed: class ArrayList : public List { int* array; int index; int capacity; void dyn_all_add(){ int cap = ceil(capacity * 1.5); array = (int*)realloc(array,cap * sizeof(int)); capacity = cap; } void dyn_all_rem(){ int cap = capacity - (capacity/3); array = (int*)realloc(array,cap * sizeof(int)); capacity = cap; } public: // CONSTRUCTOR ArrayList() { capacity = 4; array = (int*)malloc(capacity); index = 0; } int add(int num) { if (index == capacity){ dyn_all_add(); } *(array + index) = num; index++; return index; } int get(int pos){ if (pos-1 < index){ return *(array + pos-1); } return -1; } int size(){ return index; }…
Read in two integers n and m (n, m < 50). Read n integers in an array A. Read m integers in anarray B. Then do the following (write separate programs for each, only the reading part iscommon).a) Find if there are any two elements x, y in A and an element z in B, such that x + y = z.b) Copy in another array C all elements that are in both A and B (intersection).c) Copy in another array C all elements that are in either A and B (union).d) Copy in another array C all elements that are in A but not in B (difference).c programm please tell all the answer
Write a function that returns an integer that appears most often with respect to an array of integers In the array. for example. [1 2 3 2 3 4 2 5] For an array your function must return 2.
Debug Program3: int element(int arr[], int num) { in i, ele; ele = arr[0]; for (i = 1; i < num; i++) if (arr[i] > ele) ele = arr[i]; return ele; } main() { arr[] = {1, 24, 145, 20, 8, -101, 300}; int n = sizeof(arr)/sizeof(arr[0]); printf("element of array is %d", element(arr[], n)); } 24 145 -101 300 Program4: main() { int m,n; for(i 0; i << 5; i++) { printf("\t\t\t\t"); for(j 0; j << 5; j+++) printf("*"); printf("/n"); } Program 5: int func(int) main() { int num = 7, c; int f= func(num); printf("\n\n%d of %d\n\n", num, f); } int func(aj); { if(aj=1 aj=0) return 1; else return (aj*fun(aj-1); } 49 5040 7117 none of…
FOR C++, PLEASE WRITE THE CODE IN 15 MINUTES ! Write a function that finds different elements in the given two array. PLEASE WRITE YOUR CODE IN THIS METHOD. void printDifferentElements(int a[], int b[], int size) { }
6. Read in two integers n and m (n, m < 50). Read n integers in an array A. Read m integers in anarray B. Then do the following (write separate programs for each, only the reading part iscommon).a) Find if there are any two elements x, y in A and an element z in B, such that x + y = z.b) Copy in another array C all elements that are in both A and B (intersection).c) Copy in another array C all elements that are in either A and B (union).d) Copy in another array C all elements that are in A but not in B (difference).Do In c Program
Write a Program for insertion and deletion from an array without replacement of element from the arrays. Also, write a program to search the array for the presence of a given element from an array. Write the sub-functions in the provided test case in text form and upload the same. #include<stdio.h> #include<stdlib.h> int cmpfunc (const void * a, const void * b) { return ( *(int*)a - *(int*)b ); } int insert_function(int *data, int n, int p, int x) { /* input data: array, n: size of array, p: position of insertion, x: element to insert*/ /*output:-1 indication error or 0 if successful /* write the function for inserting element into a position*/ } int delete_function(int *data, int n, int p, int x) { /* input data: array, n: size of array, p: position of deletion, x: element to deletion*/ /*output:-1 indication error or 0 if successful /* write the function for delete element into a position*/ } int linear_search_function(int *data, int n, int x) { /*write the function to…
Given an integer array of positive single digit values such as:int a[] = {8,4,2,6,9};1) Write a recursive arrayToN function which returns the concatenation of all array values as an integer value.This function should accept all required data as parameters and return a long integer value.ExamplesIf the array is 8 4 2 6 9 the arrayToN function returns the integer 84269.If the array is 0 2 6 8 9 3 5 1 the arrayToN function returns the integer 2689351.
Program in C Write a program that does the following: Asks user for a positive integer, N. Creates a 1-dimensional integer array of length N. Stores the squares of all integers from 1 to N in the array. Prints out all N values of the array.
C PROGRAM Implement the sortAscending Function #include<stdio.h> void swap(int*, int*);void scanElements(int*, int);void printElements(int*, int);void sortAscending(int*, int); void sortDescending(int*, int); int main() { int n; printf("Enter n (size of array): "); scanf("%d", &n); int arr[n]; scanElements(arr, n); sortAscending(arr, n); return 0;} void swap(int *a, int *b) { int temp = *a; *a = *b; *b = temp;} void scanElements(int *arr, int n) { for(int i = 0; i < n; i++) { printf("Enter element #%d: ", i + 1); scanf("%d", &arr[i]); }} void printElements(int *arr, int n) { for(int i = 0; i < n; i++) { printf("%d ", arr[i]); } printf("\n");} void sortAscending(int *arr, int n) { int indexOfMin; for(int i = 0; i < n-1; i++) { indexOfMin = i; for(int j = i+1; j < n; j++) { if(arr[j] < arr[indexOfMin]) { indexOfMin = j; }…