Question

IN C++ AS SIMPLE AS POSSIBLE ______

** Re-write** the given function,

• The function takes a single integer **n** as a
parameter

• The function **prints** a series between 1 and
that parameter, and also **prints** its result

• The result is calculated by summing the numbers between 1 and
**n** (inclusive). If a number is divisible by 5, its
square gets added to the result instead.

• The function **does not return** a value.

The series is: 1 + 2 + 3 + 4 + 5*5 +6 + 7 + 8 + 9 + 10*10 + 11 + 12 + 13 + 14 + 15*15 + 16 + ....

Example 1:

Calling the function with the integer 6 should print the
following:

1 + 2 + 3 + 4 + 25 + 6

Result of the series is 41

Example 2:

Calling the function with the integer 15 should print the
following:

1 + 2 + 3 + 4 + 25 + 6 + 7 + 8 + 9 + 100 + 11 + 12 + 13 + 14 +
225

Result of the series is 440

void printSeriesSquareFifth(int n) { int sum = 0; for (int i = 1;i <= n;i++) { if (i%5 == 0) { //If the number is divisible by 5, print its square and add the square to the sum cout << i*i; sum = sum + i*i; } else { //If the number is not divisible by 5, print the number and add the number to the sum cout << i ; sum = sum + i; } if(i != n){ //This check is added to not print the last '+' cout<<" + "; } } cout << endl << "Result of the series is " << sum << endl; }

Answer #1

C++ please
Write code to implement the Karatsuba multiplication algorithm
in the file linked in Assignment 2 (karatsuba.cpp) in Canvas
(please do not rename file or use cout/cin statements in your
solution). As a reminder, the algorithm uses recursion to produce
the results, so make sure you implement it as a recursive function.
Please develop your code in small The test program
(karatsuba_test.cpp) is also given. PLEASE DO NOT MODIFY THE TEST
FILE.
KARATSUBA.CPP
/* Karatsuba multiplication */
#include <iostream>...

Write a while loop that prints userNum divided by 2 (integer
division) until reaching 1. Follow each number by a space. Example
output for userNum = 40:
20 10 5 2 1
.....
my code:
#include <iostream>
using namespace std;
int main() {
int userNum;
userNum = 40;
/* Your solution goes here */
while (userNum != 1){
userNum = userNum/2;
cout << userNum << " ";
}
cout << endl;
return 0;
}
........
but as a result i...

Write a program containing a function,
reverseDigit, that takes an integer as a parameter
and returns the number with its digits reversed, then printout the
return result. For example, the value of
reverseDigit(12345) is 54321; the value of
reverseDigit(5600) is 65; the value of
reverseDigit(7008) is 8007; and the value of
reverseDigit(-532) is -235.
Modify the following program to make a correct output.
/*
// Name: Your Name
// ID: Your ID
// Purpose Statement: ~~~
*/
#include <iostream>...

Write in C++ a function int sumofdigits( int n ) which computes
and returns the sum of the digits of
n.
Use the following main function to test your code:
int main()
{
int n, sn;
cout << "Enter q to quit or an integer: ";
while ( cin >> n )
{
sn = sumofdigits(n);
cout << "sumofdigits( " << n << " ) = " <<
sn;
cout << "\nEnter q to quit or an integer: ";
}...

Strings
The example program below, with a few notes following, shows how
strings work in C++.
Example 1:
#include <iostream> using namespace std; int main()
{
string s="eggplant";
string t="okra";
cout<<s[2]<<endl;
cout<< s.length()<<endl; //prints 8
cout<<s.substr(1,4)<<endl; //prints ggpl...kind of
like a slice, but the second num is the length of the
piece
cout<<s+t<<endl; //concatenates: prints eggplantokra
cout<<s+"a"<<endl;
cout<<s.append("a")<<endl; //prints eggplanta: see
Note 1 below
//cout<<s.append(t[1])<<endl; //an error; see
Note 1
cout<<s.append(t.substr(1,1))<<endl; //prints
eggplantak; see Note 1
cout<<s.find("gg")<<endl;
if (s.find("gg")!=-1)
cout<<"found...

Write a program that accepts as input the mass, in grams, and
density, in grams per cubic centimeters, and outputs the volume of
the object using the formula: volume = mass / density.
Format your output to two decimal places.
** Add Comments
** Print Name and Assignment on screen
** Date
** Submit .cpp file.
Demo
// This program uses a type cast to avoid an integer
division.
#include <iostream> // input - output stream
#include <fstream> //working file...

C++
Write a recursive function that reverses the given input string. No
loops allowed, only use recursive functions.
Do not add more or change the parameters to the original function.
Do not change the main program.
I had asked this before but the solution I was given did not
work.
#include
#include
using namespace std;
void reverse(string &str)
{
/*Code needed*/
}
int main()
{
string name = "sammy";
reverse(name);
cout << name << endl; //should display...

For C++:
a) Write a function is_prime that takes a positive integer X and
returns 1 if X is a prime number, or 1 if X is not a prime
number.
b) write a program that takes a positive integer N and prints
all prime numbers from 2 to N by calling your function is_prime
from part a.

c++
Write a program that calls a function
calculateSum to calculate the sum from -1 to N.
The function calculateSum has one parameter N of type integer and
returns an integer which represents the sum from -1 to N,
inclusive.
Write another function calculateAverage that
calculates an average. This function will have two parameters: the
sum and the number of items. It returns the average (of type
float).
The main function should be responsible for all inputs and
outputs. Your...

For some reason I followed the steps in my project and I am getting the incorrect output and when I am submitting it, it gives me compilation error.
Printing empty array -- next line should be blank
Testing append: Shouldn't crash!
Should print 100 through 110 below, with 110 on a new
line:
100
101 102 103 104 105 106 107 108 109
110
Checking capacity of new array:
OK
Append test #2:
Should print 100 through 120 below, on...

ADVERTISEMENT

Get Answers For Free

Most questions answered within 1 hours.

ADVERTISEMENT

asked 14 minutes ago

asked 15 minutes ago

asked 15 minutes ago

asked 19 minutes ago

asked 22 minutes ago

asked 32 minutes ago

asked 34 minutes ago

asked 35 minutes ago

asked 1 hour ago

asked 1 hour ago

asked 1 hour ago

asked 1 hour ago