What is the output of the following C++ code? explain each step. int alpha[8]; for (int i = 0; i < 4; i++) { alpha[i] = i * ( i + 1); if (i % 2 == 0) alpha[4 + i] = alpha[i] + i; else if (i % 3 == 0) alpha[4 + i] = alpha[i] - i; else if (i > 0) alpha[4 + i] = alpha[i] - alpha[i - 1]; } for (int i = 0; i < 8; i++) cout << alpha[i] << " "; cout << endl;

What is the output of the following C++ code? explain each step. int alpha[8]; for (int i = 0; i < 4; i++) { alpha[i] = i * ( i + 1); if (i % 2 == 0) alpha[4 + i] = alpha[i] + i; else if (i % 3 == 0) alpha[4 + i] = alpha[i] - i; else if (i > 0) alpha[4 + i] = alpha[i] - alpha[i - 1]; } for (int i = 0; i < 8; i++) cout << alpha[i] << " "; cout << endl;

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 8SA

See similar textbooks

Similar questions

Consider the following function: public void bSearch(int[] A, int value, int start, int end) { if (end value) { return bSearch(A, value, start, mid); } else if (value > A[mid]) { return bSearch(A, value, mid+1, end); } else { return mid; } } The mutation program P' changes the part as shown below. } else if (value > A[mid]) { return bSearch(A, value, mid+2, end); } else { return mid; } A test input is given t1: {A = [2, 3, 5, 7, 10, 11], value = 6, start=0, end=5}. Which statement below best describes the mutant with regards to the test input? O a. t1 resolves mutant P O b. The mutant P' with regards to test input t1 is live.
Write in C++ Alice is trying to monitor how much time she spends studying per week. She going through her logs, and wants to figure out which week she studied the least, her total time spent studying, and her average time spent studying per week. To help Alice work towards this goal, write three functions: min(), total(), and average(). All three functions take two parameters: an array of doubles and the number of elements in the array. Then, they make the following computations: min() - returns the minimum value in the array sum() - returns the sum of all the values in the array average() - returns the average of all the values in the array You may assume that the array will be non-empty. Function specifications: Function 1: Finding the minimum hours studied Name: min() Parameters (Your function should accept these parameters IN THIS ORDER): arr double: The input array containing Alice's study hours per week arr_size int: The number of elements stored in the array Return Value:…
C++ PROGRAMMING PART C Please help me i am stressing so much on this. I would really appreciate it. THIS was the code provided to me to help me solve the question. const int N =31; // N parking spaces bool parking[N]; // the garage void EmptyTheLot(bool parking[], int N) { for(int i=0; i<N; i++) p[i]=false; // empty space } // returns -1 if no space found, //otherwise it returns 0<=i<N for a valid space. int FindSpace(int PlateNumber, bool parking[], int N) { // ????? } main() { EmptyTheLot(parking, N); // start with an empty parking garage. // get plate numbers and fill lot. }
int p =5 , q =6; void foo ( int b , int c ) { b = 2 * c ; p = p + c ; c = 1 + p ; q = q * 2; print ( b + c ); } main () { foo (p , q ); print p , q ; } Explain and print the output of the above code when the parameters to the foo function are passed by value. Explain and print the output of the above code when the parameters to the foo function are passed by reference. Explain and print the output of the above code when the parameters to the foo function are passed by value result. Explain and print the output of the above code when the parameters to the foo function are passed by name.
Given the following C code: int a[10] = {0,1,2,3,4,5,6,7,8,9};int *m = &a[0];int *p = &a[5];int *q = &a[1]; p = (int) m + (int) p - (int) q; What is the value of *p?
You’re working on some more stock-prediction software. The function in C++ you’re writing accepts an array of predicted prices for a particular stock over the course of time. For example, this array of seven prices: [10, 7, 5, 8, 11, 2, 6] predicts that a given stock will have these prices over the next seven days. (On Day 1, the stock will close at $10; on Day 2, the stock will close at $7; and so on.) Your function should calculate the greatest profit that could be made from a single “buy” transaction followed by a single “sell” transaction. In the previous example, the most money could be made if we bought the stock when it was worth $5 and sold it when it was worth $11. This yields a profit of $6 per share. Note that we could make even more money if we buy and sell multiple times, but for now, this function focuses on the most profit that could be made from just one purchase followed by one sale. Now, we could use nested loops to find the profit of every possible buy and sell…
Consider the following function: void fun_with_recursion(int x) { printf("%i\n", x); fun_with_recursion(x + 1); } What will happen when this function is called by passing it the value 0?
Trace through (show all the steps as we did in class) for the following java code for the factorial function. Show all the steps (illustrate, do not code) that lead to the final answer when myFactorial(6) is called: int myFactorial( int integer) { if( integer == 1) return 1; else { return(integer*(myFactorial(integer-1); } }
Explain this C code line per line please #include <stdio.h> #include <malloc.h> void printArray(int**, int); int main() { int i = 0, j = 0, n = 5; int **arr = (int**)malloc(n * sizeof(int*)); for(int i=0;i<n;i++){ *(arr+i) = (int*)malloc(n*sizeof(int)); } for(i=0;i<n;i++){ for(int j=0;j<n;j++){ *(*(arr+i) + j) = 0; } } printArray(arr, n); for(i=0;i<n;i++){ *( *(arr + i) + i) = i+1; } printArray(arr,n); return 0; } void printArray(int ** array, int size) { int i,j; for(i = 0;i<size;i++){ for(j=0;j<size;j++){ printf("%d ", *( *(array + i) + j)); } printf("\n"); } printf("\n"); }
1- What is the ouput of the following C code segment? void * T( void* me) { int s=03; for (int k=1; k<=me; k++) S = s +k; printf("%d",s); main() { pthread_t tids[4]; for ( int i=1; i<=4;i++) pthread_create(&tids[i],NULL,T,void* i ); a) 11 11 b) 23 4 5 in any order 13 6 10 in any order d) O 1 2 3 4 in any order Boş bırak
sum = 0; for (int i = 1; i< n; i = sum++ || 2*i)
Explain this c code in details. #include <stdio.h> int main() { int max_weight_truck, n; scanf("%d", &max_weight_truck); scanf("%d", &n); int weight_item[n]; int priority[n]; int p_sort[n]; int w_sort[n]; int a[n]; for(int i=0; i<n; i++) scanf("%d", &weight_item[i]); for(int i=0; i<n; i++) scanf("%d", &priority[i]); //sorting priority array for(int i=0; i<n; i++) p_sort[i]= priority[i]; int temp=0; for (int i = 0; i < n; i++) { for (int j = i+1; j < n; j++) { if(p_sort[i] < p_sort[j]) { temp = p_sort[i]; p_sort[i] = p_sort[j]; p_sort[j] = temp; } } } for(int i=0; i<n; i++) a[i]= 0; for(int i=0; i<n; i++) { int index; for(int j=0; i<n; j++) { if(p_sort[i]== priority[j] && a[j]==0) { index= j; break; } } w_sort[i]= weight_item[index]; a[index]=1; } int s=0, i=0,j=0,truck=5, l=0; int o_item[truck], unused_space[truck]; // initializing arrays for(i=0; i<truck; i++) { o_item[i]= 0; unused_space[i]= 0; } i=0; while(truck>0)…