(Pig Latin) Write a
Learn your wayIncludes step-by-step video
Chapter 8 Solutions
C How to Program (8th Edition)
Additional Engineering Textbook Solutions
Experiencing MIS
Starting Out with Java: From Control Structures through Objects (7th Edition) (What's New in Computer Science)
Java How To Program (Early Objects)
Modern Database Management (12th Edition)
Starting Out with C++: Early Objects (9th Edition)
- Q2) (Perfect Numbers) An integer number is said to be a perfect number if its factors, including 1 (but not the number itself), sum to the number. For example, 6 is a perfect number because 6 = 1 + 2 + 3. Write a function perfect that determines if parameter number is a perfect number. Use this function in a program that determines and prints all the perfect numbers between 1 and 1000. Print the factors of each perfect number to confirm that the number is indeed perfect. Challenge the power of your computer by testing numbers much larger than 1000.arrow_forwardUSE C++ (Display matrix of 0s and 1s) Write a function that displays an n-by-n matrix using the following header: void printMatrix(int n) Each element is 0 or 1, which is generated randomly. Write a test program that prompts the user to enter n and displays an n-by-n matrix. Here is a sample run:arrow_forwardNumber of 1 Bits – Hamming Weight (uses bitwise AND) Write a function that takes an unsigned integer and returns the number of '1' bits it has (also known as the Hamming weight). Note: Note that in some languages, such as Java, there is no unsigned integer type. In this case, the input will be given as a signed integer type. It should not affect your implementation, as the integer's internal binary representation is the same, whether it is signed or unsigned. In Java, the compiler represents the signed integers using 2's complement notation. Therefore, in Example 3, the input represents the signed integer. -3. Code in Java A brief explanation of how and why your code works and how it relates to the concepts learned (for example, it uses bitwise operation, stack, or takes into account a word size).arrow_forward
- Write a function recursively_count_vowels() which accepts a pointer to a string, and any other parameters you see fit, and recursively counts the number of vowels in the provided string. This function should return the number of vowels in the string. (programming language c)arrow_forward2. Printing binary Write a function void printBin(int value) that will print an integer as a binary number. Hint: You want to print a 1 or a O based on the high order bit, then you need to move the next to high order bit into the high order bit. You will need to explicitly count the number of bits you have printed. Write a main method that calls printBin multiple times with a few different values to test it. You should try at least a positive number, a negative number and O. Your submission should answer the following questions about this program: • There are at least two approaches to testing the high order bit. Describe one that you did NOT use in your code. • How could you suppress leading zeros in you display? If you did this already, you may just answer that you did.arrow_forward(Numerical) Write a program that tests the effectiveness of the rand() library function. Start by initializing 10 counters to 0, and then generate a large number of pseudorandom integers between 0 and 9. Each time a 0 occurs, increment the variable you have designated as the zero counter; when a 1 occurs, increment the counter variable that’s keeping count of the 1s that occur; and so on. Finally, display the number of 0s, 1s, 2s, and so on that occurred and the percentage of the time they occurred.arrow_forward
- Write and test the “digit” function: Function Prototype: int digit(int n,int k)This function returns the kth digit of the positive integer n. For example, if n is the integer 29,415 that is entered by user , then the call digit(n,0) would return the digit 2, and the call digit(n,2) would returnthe digit 4. do this only by using functions and loops. arrays are not allowed. example :Input: n = 29415 , k = 1 output: 9 Input: n = 2 , k = 1 output: index out of bound (return -1)arrow_forwardMinutes(using Pointers) by Catherine Arellano Write a program that will accept an integer value from 0000 to 2359. It will then extract the first 2 values of the integer to be the hours, and the last 2 to be the minutes. Implement the following functions: void extracts(int* time, int* hour, int* min); /* extract the hours and minutes from the time and stores the result to the address of hour and min respectively.*/ void display (int* hour, int* min); /*display the hours and minutes*/ Note: You are not allowed to edit main.c and Time.h. Input A time in format HHMM 1430 Output Hours and minutes Hour: 14 Minutes: 30 main.c Time.h 1 #include 2 #include "Time.h" 3 int main(void) { M456909 7 8 } int time, hour, min; scanf("%d",&time); extracts (time, &hour, &min); display (&hour, &min); return 0;arrow_forwardExercise 1: (Design of algorithm to find greatest common divisor) In mathematics, the greatest common divisor (gcd) of two or more integers is the largest positive integer that divides each of the integers. For example, the gcd of 8 and 12 is 4. Why? Divisors of 8 are 1, 2, 4, 8. Divisors of 12 are 1, 2, 4, 6, 12 Thus, the common divisors of 8 and 12 are 1, 2, 4. Out of these common divisors, the greatest one is 4. Therefore, the greatest common divisor (gcd) of 8 and 12 is 4. Write a programming code for a function FindGCD(m,n) that find the greatest common divisor. You can use any language of Java/C++/Python/Octave. Find GCD Algorithm: Step 1 Make an array to store common divisors of two integers m, n. Step 2 Check all the integers from 1 to minimun(m,n) whether they divide both m, n. If yes, add it to the array. Step 3 Return the maximum number in the array.arrow_forward
- in this code, what does 2 mean and what does it do?arrow_forwardWrite a function number_name (N) that takes an integer (up to 1000) as argument N and returns the English name of the number as a string. (use Dictionary) python 3 Write a function all_numbernames (N) that takes an integer (up to 1000) as argument N and returns the summed length of all the names from 1 to N (from the Euler text) Type a function solve_euler_17 () that returns the summed length of all names from 1 to 1000arrow_forwardFix my C++ code please! Question and code is below as well as error picture. (Duplicate Elimination with vector) Use a vector to solve the following problem. Read in 20 numbers, each of which is between 10 and 100, inclusive. As each number is read, validate it and store it in the vector only if it isn't a duplicate of a number already read. After reading all the values, display only the unique values that the user entered. Begin with an empty vector and use its push_back function to add each unique value to the vector. My code; #include <iostream>#include <vector> using namespace std;int find(vector<int> &v, int num) { for(int i = 0; i < v.size(); ++i) { if(v[i] == num) { return i; } } return -1;}int main() { vector<int> v; int num; for(int i = 0; i < 20; ++i) { cout << "Enter an Integer : "; cin >> num; if(num >= 10 && num <= 100 && find(v, num) == -1) {…arrow_forward
- C++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage LearningC++ for Engineers and ScientistsComputer ScienceISBN:9781133187844Author:Bronson, Gary J.Publisher:Course Technology Ptr