Answered: a) Run the algorithm below for the…

a) Run the algorithm below for the input list 4, 5, 11 and complete the table, showing mes of the variables s and k will change until the return statement is reached.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter2: Basic Elements Of C++

Section: Chapter Questions

Problem 15PE: 15. Write a program to implement and test the algorithm that you designed for Exercise 15 of Chapter...

See similar textbooks

Similar questions

6.38 LAB: Convert to binary - methods (JAVA) Write a program in java that takes in a positive integer as input, and outputs a string of 1's and 0's representing the integer in binary. For an integer x, the algorithm is: As long as x is greater than 0 Output x % 2 (remainder is either 0 or 1) x = x / 2 Note: The above algorithm outputs the 0's and 1's in reverse order. You will need to write a second function to reverse the string. Ex: If the input is: 6 the output is: 110 The program must define and call the following two methods. Define a method named intToReverseBinary() that takes an int as a parameter and returns a string of 1's and 0's representing the integer in binary (in reverse). Define a method named stringReverse() that takes a string as a parameter and returns a string representing the input string in reverse. public static String intToReverseBinary(int integerValue)public static String stringReverse(String inputString) Code starts here: import java.util.Scanner; public…
3.34 LAB: Mad Lib - loops in C++Mad Libs are activities that have a person provide various words, which are then used to complete a short story in unexpected (and hopefully funny) ways. Write a program that takes a string and integer as input, and outputs a sentence using those items as below. The program repeats until the input is quit 0. Ex: If the input is:apples 5shoes 2quit 0 the output is:Eating 5 apples a day keeps the doctor away.Eating 2 shoes a day keeps the doctor away. Make sure your answer is in C++.
-check this code then, In python 3 make a code that shows the performance curve of the algorithm using time measurements 1. Approach: Non recursive: //include necessary header files#include <iostream>using namespace std;//main functionint main(){ int days,buy_on_this_day ,sell_on_this_day; //get number of days as input from user cout<<"Enter number of days: "; cin>>days; int stock_price[days]; for(int i=0;i<days;i++) { cout<<"Enter stock_price"; cin>>stock_price[i]; } int i=0; for(int i=0;i<days-1;i++) { //comparing current price with next day price and finding the minima while(i<days-1 && stock_price[i+1]<=stock_price[i]) i++; if(i==days-1) break; buy_on_this_day =i++; while(i<days && stock_price[i]>= stock_price[i-1]) i++; sell_on_this_day =i-1; cout<<buy_on_this_day <<" : index of the change…
2. Python program to choose specified number of colors from three differentcolors and generate all the combinations with repetitionsSample Output:Enter original list : ['Red', 'Green', 'Blue']Enter the value of n : 1Combinations : [('Red',), ('Green',), ('Blue',)]Enter the value of n : 2Combinations : [('Red', 'Red'), ('Red', 'Green'), ('Red', 'Blue'), ('Green', 'Green'),('Green', 'Blue'), ('Blue', 'Blue')]
(Computation) Among other applications, Pascal’s triangle (see Figure 7.22) provides a means of determining the number of possible combinations of n things taken r at a time. For example, the number of possible combinations of five people (n = 5) taken two at a time (r=2)is10. Each row of the triangle begins and ends with 1. Every other element in a row is the sum of the element directly above it with the element to the left of the one above it. That is, element[n][r]=element[n1][r]+element[n1][r1] Using this information, write and test a C++ program to create the first 11 rows of a twodimensional array representing Pascal’s triangle. For any given value of n less than 11 and r less than or equal to n, the program should display the correct element. Use your program to determine in how many ways a committee of 8 can be selected from a group of 10 people
15. Write a program to implement and test the algorithm that you designed for Exercise 15 of Chapter 1. (You may assume that the value of . In your program, declare a named constant PI to store this value.)
(Conversion) a. Write a C++ program to convert meters to feet. The program should request the starting meter value, the number of conversions to be made, and the increment between metric values. The display should have appropriate headings and list the meters and the corresponding feet value. If the number of iterations is greater than 10, have your program substitute a default increment of 10. Use the relationship that 1 meter = 3.281 feet. b. Run the program written in Exercise 6a on a computer. Verify that your program begins at the correct starting meter value and contains the exact number of conversions specified in your input data. c. Modify the program written in Exercise 6a to request the starting meter value, the ending meter value, and the increment. Instead of the condition checking for a fixed count, the condition checks for the ending meter value. If the number of iterations is greater than 20, have your program substitute a default increment of (ending value - starting value) / 19.
C++ Question please help In an ancient land, the beautiful princess Eve had many suitors. She decided on thefollowing procedure to determine which suitor she would marry. First, all of the suitorswould be lined up one after the other and assigned numbers. The first suitor would benumber 1, the second number 2, and so on up to the last suitor, number n. Starting atthe first suitor, she would then count three suitors down the line (because of the threeletters in her name) and the third suitor would be eliminated from winning her hand andremoved from the line. Eve would then continue, counting three more suitors, andeliminating every third suitor. When she reached the end of the line, she would continuecounting from the beginning. For example, if there were six suitors, then the eliminationprocess would proceed as follows:123456 Initial list of suitors, start counting from 112456 Suitor 3 eliminated, continue counting from 41245 Suitor 6 eliminated, continue counting from 1125 Suitor 4…
1.25 LAB: Convert to binary - functions Write a program that takes in a positive integer as input, and outputs a string of 1's and 0's representing the integer in binary. For an integer x, the algorithm is: As long as x is greater than 0 Output x % 2 (remainder is either 0 or 1) x = x // 2 Note: The above algorithm outputs the 0's and 1's in reverse order. You will need to write a second function to reverse the string. Ex: If the input is: 6 the output is: 110 The program must define and call the following two functions. Define a function named int_to_reverse_binary() that takes an integer as a parameter and returns a string of 1's and 0's representing the integer in binary (in reverse). Define a function named string_reverse() that takes an input string as a parameter and returns a string representing the input string in reverse.def int_to_reverse_binary(integer_value)def string_reverse(input_string) MY CODE def string_reverse(input_string): new_str = input_string[::-1]…
(python) 11. Identify and fix the errors in the following code. There are a total of 8 errors. listInt = [ 1, 2, 3, 4, 5 ) listFloat = [} totalDiff == 0 for x in range(5): listFloat.add(listInt[x] * 1.5) print(str(listInt[x]) + " * 1.5 = + str(listFloat[x])) totalDiff += listFloat[x] - listInt[x]; print “Total increase of “ + str(totalDif))
Q11. Construct a truth table for the statements belowa. (p ∧ q) ∧ (~r ∨ q).b. ~[~p ∧ (q ∧ r)]c. [p ∧ (q ∨ ~p)] → ~p then find the truth value of the statement givena. p is a false statement, q is a true statement and r is a true statement.b. p is a false statement, q is a false statement and r is a false statement.c. p is a false statement, q is a false statement and r is a true statement.?
Modified coin-row problem:If we modified the coin-row problem, so that you cannot take the adjacent coin, and youcannot take the coin next to the adjacent coin also (see example below), what would thedynamic programming formula F(n) be?Example: A, B, C, D, E, F, G, H, I, JIf A is taken, then B & C cannot be taken, but D (or above D, like E and so on) can be taken.If B is taken, then A, C, D cannot be taken.And so on.