C How To Program Plus Mylab Programming With Pearson Etext -- Access Card Package (8th Edition)
8th Edition
ISBN: 9780134227023
Author: Paul J. Deitel; Harvey Deitel
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 8, Problem 8.29E
Program Plan Intro
Program plan:
- str,cmpstr variablesare used for inputs
- int strcmparr(const char s1[], const char s2[]) function stores string array reference in two array variables and compare the strings character by character using index variable and return the difference between character values.
- int strcmpptr(const char *s1, const char *s2) stores string array reference in pointer variables and copy compare the strings character by character using pointer arithmetic and return the difference between character values.
Program description:
The main purpose of the program is to demonstrate the working of built-in string function strcmp() by writing the two versions of each function. One version uses the pointer arithmetic to compare the strings. Second version uses array index to compare the strings.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
.“Dangling and wild pointers are known to be problems with pointers”. Justify the given statement with the helpof suitable example
(Write a code in C++ Programming language)Use a vector to read 10 integer numbers, each of which is between 1 and 50. Begin with an empty vector and use its push_back function to add each unique value to the vector. As each number is read, validate it and store it in the array only if it is not a duplicate of a number already read. After reading all the values, display only the unique values that the user entered.
(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.
Chapter 8 Solutions
C How To Program Plus Mylab Programming With Pearson Etext -- Access Card Package (8th Edition)
Ch. 8 - (Character Testing) Write a program that inputs a...Ch. 8 - Prob. 8.6ECh. 8 - (Convening Strings to Integers for Calculations)...Ch. 8 - (Converting Strings to Floating Point for...Ch. 8 - Prob. 8.9ECh. 8 - Prob. 8.10ECh. 8 - (Random Sentences) Write a program that uses...Ch. 8 - (Pig Latin) Write a program that encodes...Ch. 8 - (Tokenizing Telephone Numbers) Write a program...Ch. 8 - (Displaying a Sentence with Its Words Reversed)...
Ch. 8 - (Searching for Substrings) Write a program that...Ch. 8 - (Counting the Occurrences of a Substring) Write a...Ch. 8 - (Counting the Occurrences of a Character) Write a...Ch. 8 - Prob. 8.19ECh. 8 - (Counting the Number of Words in a String) Write a...Ch. 8 - (Alphabetizing a List of Strings) Use the...Ch. 8 - Prob. 8.22ECh. 8 - (Strings Starting with b) Write a program that...Ch. 8 - (Strings Ending with ed) Write a program that...Ch. 8 - (Printing Letters for Various ASCII Codes) Write a...Ch. 8 - (Write Your Own Character-Handling Functions)...Ch. 8 - Prob. 8.27ECh. 8 - Prob. 8.28ECh. 8 - Prob. 8.29ECh. 8 - Prob. 8.30ECh. 8 - (Text Analysis) The availability of computers with...Ch. 8 - (Printing Dates in Various Formats) Dates are...Ch. 8 - (Check Protection) Computers are frequently used...Ch. 8 - (Writing the Word Equivalent of a Check Amount)...Ch. 8 - Prob. 8.35ASME
Knowledge Booster
Similar questions
- """3. Write a function validSolution/ValidateSolution/valid_solution()that accepts a 2D array representing a Sudoku board, and returns trueif it is a valid solution, or false otherwise. The cells of the sudokuboard may also contain 0's, which will represent empty cells.Boards containing one or more zeroes are considered to be invalid solutions.The board is always 9 cells by 9 cells, and every cell only contains integersfrom 0 to 9. (More info at: http://en.wikipedia.org/wiki/Sudoku)""" # Using dict/hash-tablefrom collections import defaultdict def valid_solution_hashtable(board): for i in range(len(board)): dict_row = defaultdict(int) dict_col = defaultdict(int) for j in range(len(board[0])): value_row = board[i][j] value_col = board[j][i] if not value_row or value_col == 0: return False if value_row in dict_row: return False else: dict_row[value_row] += 1.arrow_forwardQuestion 4: (Find the minimum value in an array) Write a program that include a recursive function "recursiveMinimnm" that takes an integer array and the array size as arguments and returns the smallest element of the array. The function should stop processing and return when it receives an array of one element. Answer (2.5)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_forward
- (Check test scores) The answers to a true-false test are as follows: T T F F T. Given a two-dimensional answer array, in which each row corresponds to the answers provided on one test, write a function that accepts the two-dimensional array and number of tests as parameters and returns a one-dimensional array containing the grades for each test. (Each question is worth 5 points so that the maximum possible grade is 25.) Test your function with the following data: int score = 0;arrow_forward(Replace strings) Write the following function that replaces the occurrence of a substring old_substring with a new substring new_substring in the string s. The function returns true if string s is changed, and otherwise, it returns false. bool replace_strings (string& s, const string& old_string, const string& new_string) Write a test program that prompts the user to enter three strings, i.e., s, old string, and new_string, and display the replaced string.arrow_forward(True/False): A segment descriptor does not contain segment size informationarrow_forward
- Exercise 2. (Pascal's Triangle) Pascal's triangle Pn is a triangular array with n+1 rows, each listing the coefficients of the binomial expansion (x+ y)', where 0 _ "/workspace/project3 рython3 pавса1.ру 10 1 1 1 1 2 1 1 33 1 1 4 6 4 1 1 5 10 10 5 1 16 15 20 15 6 1 1 7 21 35 35 21 7 1 1 8 28 56 70 56 28 8 1 1 9 36 84 126 126 84 36 9 1 1 10 45 120 210 252 210 120 45 10 1 В равса1.ру import stdarray import stdio іпрort вys # Accept n (int) as command -line argument. ... # Setup a 2D ragged list a of integers. The list must have n + 1 rovs, vith the ith (0 <= i # <= n) row a[i] having i + 1 elements , each initialized to 1. For example, if n = 3, a should be # initialized to [[1], [1, 1], [1, 1, 1], [1, 1, 1, 1]]. a =... for i in range (...): ... # Fill the ragged list a using the formula for Pascal's triangle 1] [j - 1) + a[i - 1] [j] a [i][j] = a[i - 1] [j - 1] + a[i - 1] [j] #3 # vhere o <- i <- n and 1 <= j < i. for i in range (...): for j in range (...): ... # Write a to standard…arrow_forwarddissolve in c ++. Below, write the code of the program that calls the desired functions in the main function and performs the desired operations. a) random (random number range should be set to be in the range of 5-15) 10 an integer with an element produces numbers and transfers them to an array called array A and displays them enter a function that prints. b) then this sequence takes the arithmetic mean of the elements of the sequence A, round the found average value to the nearest large integer and return it to variable A. enter a function that assigns and prints the variable A on the screen. c) Then write a function that finds the factorial of the variable A value and assigns it to factorial A and prints it on the screenarrow_forward(Recursive Greatest Common Divisor) The greatest common divisor of integers x and y isthe largest integer that evenly divides both x and y. Write a recursive function gcd that returns thegreatest common divisor of x and y. The gcd of x and y is defined recursively as follows: If y is equalto 0, then gcd(x, y) is x; otherwise gcd(x, y) is gcd(y, x % y), where % is the remainder operator.arrow_forward
- (Initialize array) Write a function called initializeArray that receives an array, its size, and two integers and initializes the array with random values between the first integer and the second integer. Write another function called printArray that receives an array and its size and prints the array elements in a column. Write a test program that declares and initializes an array of size 20 with random values between 0 and 10 inclusive, and then prints the array using the above functions Write a C++ program that declares and initializes an integer array of size 100 with random integers between 1 and 10 inclusive using initializeArray (from question 1) and counts the occurrence of each number in the array and graphs the information in the form of a bar chart or histogram—each number is printed, then a bar consisting of that many asterisks is printed beside the number. Here is a sample run of the program: Number Value Histogram 1…arrow_forward(Initialize array) Write a function called initializeArray that receives an array, its size, and two integers and initializes the array with random values between the first integer and the second integer. Write another function called printArray that receives an array and its size and prints the array elements in a column. Write a test program that declares and initializes an array of size 20 with random values between 0 and 10 inclusive, and then prints the array using the above functions Write a C++ program that declares and initializes an integer array of size 100 with random integers between 1 and 10 using initializeArray (from question 1) and counts the occurrence of each number in the array and prints the occurrences. Note: Print time or times correctly. Hint: Declare another array called count that stores the number of each value as you count the numbers of the original array. Use printArray (from question 1) to print the values of count. Here is a sample run of the program: 1…arrow_forward4. (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.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
C++ for Engineers and ScientistsComputer ScienceISBN:9781133187844Author:Bronson, Gary J.Publisher:Course Technology Ptr
C++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage Learning
C++ for Engineers and Scientists
Computer Science
ISBN:9781133187844
Author: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