Write a C program that creates a security access code from a social security number entered by a user as follows: Using a recursive function it adds all of the digits of the social security number and then using a regular function gets the square number of the sum and displays it. The access code displayed should be initialized as an integer number but using type casting is displayed as a floating number.

Write a C program that creates a security access code from a social security number entered by a user as follows: Using a recursive function it adds all of the digits of the social security number and then using a regular function gets the square number of the sum and displays it. The access code displayed should be initialized as an integer number but using type casting is displayed as a floating number.

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter10: Pointers

Section: Chapter Questions

Problem 3PP

See similar textbooks

Similar questions

(Program) Write a program that tests the effectiveness of the rand() library function. Start by initializing 10 counters, such as zerocount, onecount, twocount, and so forth, to 0. Then generate a large number of pseudorandom integers between 0 and 9. Each time 0 occurs, increment zerocount; when 1 occurs, increment onecount; and so on. Finally, display the number of 0s, 1s, 2s, and so on that occurred and the percentage of time they occurred.
Write a c++ program that asks the user to enter an integer number and then by a recursive function find the addition of all integer numbers from 0 to the number user entered. (in your program you need to use a recursive function)
Write a C++ program that checks if a number is Palindrome (use recursive function as you code). A palindrome number is a number that reads the same from beginning to end and from end to beginning, in other words, a palindrome number remains the same when its digits are reversed. For example, 13431 is a palindrome number. 2332 is another one. (Note: Your program should receive an integer number as the input and always work with integer types, i.e., you cannot use string or char types throughout your code. You cannot convert the input to a string.)
Write a C program that accepts two integers from the user then Display a menu and return the choice of the user: You must write functions for each of the entries in the Menu. Write a recursive function for number 6. For functions 5 and 6, pass the first integer to the function. Menu… [1] Sum [2] Difference [3] Product [4] Quotient [5] Square [6] Factorial [7] GCD [0] Exit Choice:
In C++ Consider the following recursive function (Chapter 17, #9, modified) void recFun(int x) { if (x > 10) { recFun(x / 10); cout<< x % 10; } else cout<< x; } How can the code be modified so that the sum of all digits is printed?
In C++ Write a recursive function called PrintNumPattern() to output the following number pattern. Given a positive integer as input (Ex: 12), subtract another positive integer (Ex: 3) continually until 0 or a negative value is reached, and then continually add the second integer until the first integer is again reached. For this lab, do not end output with a newline. Ex. If the input is: 123 the output is: 12 9 6 3 0 3 6 9 12 #include <iostream> using namespace std; // TODO: Write recursive PrintNumPattern() function int main(int argc, char* argv[]) { int num1; int num2; cin >> num1; cin >> num2; PrintNumPattern(num1, num2); return 0;}
You need to write a C program that accepts an integer as input and displays the binary equivalent of an integer. The C program uses a recursive function, called binary_convert, to do the binary conversion. Binary notation represents numbers in terms of powers of two and uses only the digits 0 and 1. The initial start is given below: #include <stdio.h> /*line 1 */ int main(void) { int num; printf("Enter a number: "); /*line 2 */ /*line 3 */ return 0; } /*line 4 */ { int rem, div; /*line 5 */ { /*line 6 */ /*line 7 */ } /*line 8 */ /*line 9*/ /*line 10 */ } /* line 1 */…
Write a C++ function using recursion that returns the Greatest Common Divisor of two integers. The greatest common divisor (gcd) of two integers, which are not zero, is the largest positive inteteger that divides each of the integers. The code should follow the exact function declaration: int GCD(int number1, int number2);
You need to implement a C# program that finds the nth Fibonacci number using recursion, where n is an input value. The Fibonacci sequence is a series of numbers in which each number is the sum of the two preceding ones, usually starting with 0 and 1. The program should have a function named Fibonacci(int n) that takes an integer as an argument and returns an integer representing the nth Fibonacci number. Constraints: The input integer will be within the range of 0 <= n <= 45 The function should have a time complexity of O(2^n) You can test the program using the following test cases: Console.WriteLine(Fibonacci(0)); // 0 Console.WriteLine(Fibonacci(1)); // 1 Console.WriteLine(Fibonacci(2)); // 1 Console.WriteLine(Fibonacci(3)); // 2 Console.WriteLine(Fibonacci(4)); // 3