C++ How to Program (10th Edition)
10th Edition
ISBN: 9780134448237
Author: Paul J. Deitel, Harvey Deitel
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 22, Problem 22.34E
Program Plan Intro
- Sentence array used as a input string
- Token pointer used to perform string tokenization
- Function printlatinworld used to print the given string into latin word.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Programming Language : R programming (R Studio)
A twin prime is a prime that has a prime gap of two. Sometimes the term twin prime isused for a pair of twin primes. For example, the five twin prime pairs are (3, 5), (5, 7),(11, 13), (17, 19) and (29, 31). Write a function that returns the number of all twin primepairs between 1 and a given number n.
I just need the if statement to the code to execute.
4. (Prime Numbers) An integer is said to be prime if it is divisible by only 1 and itself. For example, 2, 3, 5 and 7
are prime, but 4, 6, 8 and 9 are not.
Write a function called isPrime that receives an integer and determines whether the integer is prime or not.
Write a test program that uses isPrime to determine and prints all the prime numbers between 1 and 1000.
Display 10 numbers per line.
Chapter 22 Solutions
C++ How to Program (10th Edition)
Ch. 22 - Prob. 22.4ECh. 22 - Prob. 22.5ECh. 22 - (Shifting and Printing an Integer) Write a program...Ch. 22 - (Multiplication Via Bit Shifting) Left-shifting as...Ch. 22 - (Packing Characters into Unsigned Integers) The...Ch. 22 - (Unpacking Characters from Unsigned Integers)...Ch. 22 - Prob. 22.10ECh. 22 - Prob. 22.11ECh. 22 - (Determine the Value) The following program uses...Ch. 22 - Prob. 22.13E
Ch. 22 - Prob. 22.14ECh. 22 - (Converting Strings to Integers) Write program...Ch. 22 - Prob. 22.16ECh. 22 - (searching for Substrings) Write a program that...Ch. 22 - (Searching for Substrings) Write a program based...Ch. 22 - Prob. 22.19ECh. 22 - Prob. 22.20ECh. 22 - (ASCII Character Set) The chart in Appendix B...Ch. 22 - Prob. 22.22ECh. 22 - Prob. 22.23ECh. 22 - (Displaying Characters for Given ASCII Codes)...Ch. 22 - Prob. 22.25ECh. 22 - Prob. 22.26ECh. 22 - Prob. 22.27ECh. 22 - Prob. 22.28ECh. 22 - Prob. 22.29ECh. 22 - Prob. 22.30ECh. 22 - Prob. 22.31ECh. 22 - (Limericks) A limerick is a humorous five-line...Ch. 22 - Prob. 22.33ECh. 22 - Prob. 22.34ECh. 22 - Prob. 22.35ECh. 22 - Prob. 22.36ECh. 22 - Prob. 22.37ECh. 22 - Prob. 22.38ECh. 22 - Prob. 22.39ECh. 22 - Prob. 22.40ECh. 22 - Prob. 22.41ECh. 22 - (Word Processing) One important function in...Ch. 22 - (Printing Dates in Various Formats) Dates are...Ch. 22 - (Check Protection) Computers are frequently in...Ch. 22 - (Writing the Word Equivalent of a Check Amount)...Ch. 22 - (Morse Code) Perhaps the most famous of all coding...Ch. 22 - Prob. 22.47ECh. 22 - (Crossword Puzzle Generator) Most people have...Ch. 22 - (Spelling Checker) Many popular word-processing...
Knowledge Booster
Similar questions
- USE 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_forward(GREATEST COMMON DIVISOR) The greatest common divisor of integers x and y is the largest integer that evenly divides into both x and y. Write and test a recursive function gcd that returns the greatest common divisor of x and y. The gcd of x and y is defined recursively as follows: If y is equal to 0, then gcd (x, y) is x; otherwise, gcd (x, y) is gcd (y, x % y), where % is the remainder operator.arrow_forwardQ2) (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_forward
- Number 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_forwardAssignment Write a program to calculate n! for a given number n and perform the simple calculator operations. The valid operations of the calculator are: + add - sub * mul I div The program must contain a function fact with one input parameter that returns the factorial of a number, a function add that performs the addition of two numbers, a function sub that performs the subtraction of two numbers, a function mul that performs the multiplication of two numbers, a function div that performs the division of two numbers. The program must also check for bad input data. Make sure when you pass parameters you pass the addresses (not the value). • All function return type must be of type void. • Take inputs in main function. • Pass the addresses of the operands and the address of the result to each function. Output must be displayed as follows: 1: Addition 2: Subtraction 3: Multiplication 4: Division 5: Factorial 6: Quit Enter the choice => 1 Enter two numbers => 2, 3 Sum => 5arrow_forwardmake c+++ codearrow_forward
- Minutes(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_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_forwardThis is not a graded question so please don't disregard it as if it is.Thank you in advance professor! Note: This is a THEORETICAL QUESTION and no code should be used for solving it.arrow_forward
- (Learning Objective: students will be able to apply their knowledge of the built-in random package to generate simulations of simple phenomena.) Write a function: • dicesim(D1,D2,trials) that takes as input the number of sides on die 1 (D1) and die2 (D2) and the number of trials. Your function should repeatedly sum pairs of random numbers between 1 and D1 and 1 and D2 and keep track of how many times each sum occurs. The function returns a numpy array with the fraction each sum of rolls occured. Since the numbers are chosen at random, the fractions will differ some from run to run. One run of the function print(p22.dicesim(6,6,10000)) resulted in: [0. 0. 0.0259 0.0615 0.0791 0.1086 0.139 0.1633 0.1385 0.114 0.0833 0.0587 0.0281] or displayed using the code from Section 16.1.1.: PMF of X Note: you should submit a file with only the standard comments at the top and the function. The grading scripts will then import the file for testing.arrow_forward4A in Python language please: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
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage Learning
C++ for Engineers and ScientistsComputer ScienceISBN:9781133187844Author:Bronson, Gary J.Publisher:Course Technology Ptr
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning
C++ for Engineers and Scientists
Computer Science
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Course Technology Ptr