From this explanation I was given for this code segment: Explanation: Iteration 1: i = 200 After entering the loop: i %2 == 0 i.e 200%2 == 0 will be true , So prints 200 Iteration 2: i = i/3 = 200/3 = 66 After entering the loop: i %2 == 0 i.e 66%2 == 0 will be true , So prints 66 Iteration 3: i = i/3 = 66/3 = 22 After entering the loop: i %2 == 0 i.e 22%2 == 0 will be true , So prints 22 Iteration 4: i = i/3 = 22/3 = 7 After entering the loop: i %2 == 0 i.e 7%2 == 0 will be false , So 7 is not printed Iteration 5: i = i/3 = 7/3 = 2 After entering the loop: i %2 == 0 i.e 2%2 == 0 will be true , So 2 is printed Iteration 6: i = i/3 = 2/3 = 0 Does not meet the condition, so exits from the condition. I don’t understand why there are 6 different iterations in this code segment and what i > 0 in the for loop and System.out.print(i + “ “) mean. Can you give me an in depth explanation as to why these things occur?

From this explanation I was given for this code segment: Explanation: Iteration 1: i = 200 After entering the loop: i %2 == 0 i.e 200%2 == 0 will be true , So prints 200 Iteration 2: i = i/3 = 200/3 = 66 After entering the loop: i %2 == 0 i.e 66%2 == 0 will be true , So prints 66 Iteration 3: i = i/3 = 66/3 = 22 After entering the loop: i %2 == 0 i.e 22%2 == 0 will be true , So prints 22 Iteration 4: i = i/3 = 22/3 = 7 After entering the loop: i %2 == 0 i.e 7%2 == 0 will be false , So 7 is not printed Iteration 5: i = i/3 = 7/3 = 2 After entering the loop: i %2 == 0 i.e 2%2 == 0 will be true , So 2 is printed Iteration 6: i = i/3 = 2/3 = 0 Does not meet the condition, so exits from the condition. I don’t understand why there are 6 different iterations in this code segment and what i > 0 in the for loop and System.out.print(i + “ “) mean. Can you give me an in depth explanation as to why these things occur?

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

1.The following is the C code that you need to implement for this lab: uint8_ t f(uint8_tn) return(n<2)?(n):(f(n-1)+f(n-2)); The main function can be assumed as follows: int main() uint8_ t x; x=f(???); return 0; Obviously, " ? ? ? " is representing a value used to test the algorithm! Is "f"recursive? a.No answer text provided. b.Yes c.no d.depends on whether it is in for main 2.First, make the code in the previous question an actual C program so that it can be compiled and it runs. Play with it so that you feel comfortable with the logic of the code. Then implement the code in TTPASM. Note that you need to preserve the actual C code structure, this means you cannot it into a non-recursive subroutine. Furthermoreall conventions discussed in class regarding subroutines must be followed. The idea is that I should be able to substitute f with my own code, and main should work. Or, I can substitute main with my own, and f should work. Attach the source code of your assembly…
12. Consider the recursive function int gcd( int a, int b) int gcd( int a, int b){ if (b > a) return gcd(b,a); if ( b == 0 ) return a; return gcd( b, a% b); } How many invocation (calls) of the gcd() function will be made by the call gcd(72, 30)?
Question 40. Consider the following code chunk: import random x=0while(x < 4): x = random.choice([1, 2, 3]) print(x) It is not a good idea to run these lines because...a) x is an invalid argument to print().b) the condition x < 4 is never violated.c) the function random.choice() does not exist. d) x is initialised with the wrong type.
Consider the below code: What would the output if dynamic scoping is used. Consider that execution of the code starts from main() function. #include <stdio.h> void main() { int x =3; A(x); B(x); C(x); } void A(int x) { printf("%d",x); } void B(int x) { int x =1; A(x); } void C(int x) { int x =2; B(x); }
IN JAVA intends to auto generate test cases for a function foo that has k integers as input arguments, i.e., foo(int n1, int n2, …, int nk). Each argument belongs to a different equivalence class, which are stored in a downloadable Eq.txt file. The content is shown below and may be modified to handle more inputs and equivalence classes. 1, 15; 16, 30 1, 10; 11, 20; 21, 30 1, 5; 6, 10; 11, 15 1, 3; 4, 6; 7, 9; 10, 12 1, 12; 13, 24 For this file, the nth row describes the nth input. Take the second row for example. There are five input arguments. The data 1, 10; 11, 20; 21, 30 indicates that argument n2 has three equivalence classes separated by the semi-colons. Develop an internal method “private int check(int val)” that returns the equivalence class the val is in. The result of check(val = 3) for n2 will be 1 and check(val = 25) for n2 will be 3. Regarding the function foo, it computes the sum of the returned values by the check function for all input arguments. Follow the contents…
Answer in java code a) Given this: int [][] tda = new int [12][25];Write a loop to print the fourth row of this two-dimensional array tda {assume the array is filled with data..}b) Write Java code (only the loop) to find the maximum value in the array Ab of type integer (use enhancedfor-loop): c) Write the output of this code:int [][] tda = {{5,99,88,2},{22,76,12,87,77,66},{34,88,13,4},{9,76,77,11}};tda[1][4] = -22;for(int q=0; q<tda[3].length; q++) System.out.print(tda[2][q] + " ");
This lab will exercise your understanding of some of the concepts covered in Chapter 18: stacks 1. Create a test program that uses the attached code in myStack.h to do the following: a. Write a program that takes as input an arithmetic expression that uses{}, () and [] as grouping symbols b. Output a message indicating whether the expression contains matching grouping symbols. For example, {25 + (3-6) * 8} and 7 + 8 * 2 have matching grouping symbols (no symbols indicate matching) 5 + {(13 + 7)/ 8 - 2 * 9 does not have matching grouping symbols Use only {}, () and [] as grouping symbols c. Print out (console) a proper message indicating whether the expression has matching or non-matchinggrouping symbols. The program may be named any name of our choice, must have a .cpp extention; variables may be any nameof your choice.
iv) Write a JAVA program to merge two sorted arrays into a single sorted array. Take the sample arrays given below and print the result in the output. The time complexity of the program should be O(N+M) where N and M are the sizes of both the arrays. int []arr1 = {1, 6, 10, 14} int []arr2 = {2, 4, 5, 11, 16, 19} Print the merged array in the output.
Problem 1 A. Consider the following recursive method. def foo1(n):  if n == 2: return 1 else: return 3 * foo1(n – 1) What value is returned as a result of the call foo1(5)? Show the recursive calls generated. B. Consider the following recursive method. def foo2(n):  if n > 0: print(n, end=’ ‘) foo2(n-1) What is the output of the call foo2(5) Problem 2 Make sure your code is readable and well-documented. Each function must also begin with a title block that describes the task of the function, input parameters and return value. Write a recursive function that takes a string as an input and returns the reverse of the string. 2. Write a recursive function rec_string that produces the output shown below for the corresponding function calls. Write a main function to test the function. Method call rec_string(‘abcde’), will produce the following output: * e de cde bcde abcde Method call rec_string(‘abc’), will…
Please define and initialize and array X of length 8. You need implement following and write outcomes with reasons; int X[ ] = { 1,2,3,4,5,6,7,8 }; 1.cout<< X+1; 2.cout<<&X+1; 3.cout<<2[X]; 4.cout<<&X[0]+1; 5.cout<<*(X+1); 6.cout<<*X+1; Also, practice and play with pointers using multiplication, division, subtraction and addition. You may also play with it your ways and find out reasoning. Write down those reasoning.
I have been trying to solve this C++ problem for a while now and even though the code gives the correct output, MindTap still tells me the code is wrong. it is looking for largeInteger class correctly performs .add operations and .subtract actions. If anyone can help, it would be much appreciated! Programming Exercise 11 in Chapter 8 explains how to add large integers using arrays. However, in that exercise, the program could add only integers of, at most, 20 digits. This chapter explains how to work with dynamic integers. Design a class named largeIntegers such that an object of this class can store an integer of any number of digits. Add operations to add, subtract, multiply, and compare integers stored in two objects. Also add constructors to properly initialize objects and functions to set, retrieve, and print the values of objects. Write a program to test your class. \\largeIntegers.cpp #include <iostream> using namespace std;…
. You are given the following information. A function with prototype int mystery(int a, int b, int c, int d); is compiled into assembly code. The body of the code is as follows: leal (%rdi,%rsi,2), %eax leal (%rdx,%rdx,2), %edx addl %edx, %eax leal (%rax,%rcx,4), %eax ret Assume a at rdi, b at rsi, c at rdx, d at rcx, and the return value at eax. Write the C code for mystery function that will have an effect equivalent to the assembly code above. Please dont copy and paste.