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
Concept explainers
Videos
Textbook Question
Chapter 7, Problem 7.13E
(Duplicate Elimination with array) Use a one-dimensional array 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 array 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. Provide for the “worst case” in which all 20 numbers are different. Use the smallest possible array to solve this problem.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
(FYI: Pseudocode is required (Not any programming language)
Design a pseudocode program that loads an array with the following 7 values. Add one more word (of your own choosing) for a total of 8 words.
biffcomelyfezmottleperukebedraggledquisling
Be sure to use lowercase, as shown above. This will make the processing easier.
Ask the user to enter a word
Search through this array until you find a match with the word the user entered.
Once you find a match, output "Yes, that word is in the dictionary".
If you get to the end of the array and do NOT find a match, output "No, that word is not in the dictionary".
The program should work with any set of words in the arrays. If I were to change the words in the arrays, it should still work.
If you need help, look at the search example in your textbook.
Indicate true or false for the following statements:
Every element in an array has the same type.
The array size is fixed after it is declared.
The array size declarator must be a constant expression.
The array elements are initialized when an array is declared.
(Two dice are rolled 100 times (you can do this with two random values from 1 to 6 in your program). After rounding 100 times, keep the iteration value of how many times each state occurs in a two-dimensional array. For example, the index number of [1,1] must follow the number of times the dice rolls 1 to 1).
Chapter 7 Solutions
C++ How to Program (10th Edition)
Ch. 7 - Exercises 7.6(Fill in the Blanks) Fill in the...Ch. 7 - (True or False) Determine whether each of the...Ch. 7 - (Write C++ Statements) Write C++ statements to...Ch. 7 - (Two-Dimensional array Questions) Consider a...Ch. 7 - (Salesperson Salary Ranges) Use a one-dimensional...Ch. 7 - (One-Dimensional array Questions) Write statements...Ch. 7 - (Find the Errors) Find the error(s) in each of the...Ch. 7 - (Duplicate Elimination with array) Use a...Ch. 7 - Prob. 7.14ECh. 7 - Prob. 7.15E
Ch. 7 - (Dice Rolling) Write a program that simulates...Ch. 7 - ( What Does This Code Do?) What does the following...Ch. 7 - (Craps Game Modification) Modify the program of...Ch. 7 - (Converting vector Example of Section 7.10 to...Ch. 7 - Prob. 7.20ECh. 7 - (Sales Summary) Use a two-dimensional array to...Ch. 7 - (Knight's Tour) One of the more interesting...Ch. 7 - (Knight's Tour: Brute Forty Approaches ) In...Ch. 7 - (Eight Queens) Another puzzler for chess buffs is...Ch. 7 - (Eight Queens: Brute Force Approaches) In this...Ch. 7 - Prob. 7.26ECh. 7 - (The Sieve of Eratosthenes) A prime integer is any...Ch. 7 - Prob. 7.28RECh. 7 - (Eight Queens) Modify the Eight Queens program you...Ch. 7 - (Print an array) Write a recursive function...Ch. 7 - Prob. 7.31RECh. 7 - Prob. 7.32RECh. 7 - (Maze Traversal) The grid of hashes (#) and dots...Ch. 7 - Prob. 7.34RECh. 7 - Making a Difference 7.35 (Polling) The Internet...
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- Alert dont submit AI generated answer.arrow_forwardTotaled columns. (Ending of sentence on attachment) please assist with Java code. Please attachment screenshot of successful output.arrow_forwardFor the array ADT, the operations associated with the type array are: insert a value in the array, delete a value from the array, and test whether a value is in the array or not. 1.true 2.falsearrow_forward
- Hello, can you please help me do this Java program using the two attached pics, here are the instructions: Problem Description:Use a one-dimensional array to solve the following problem:Request five unique numbers, each of which is between 10 and 100, inclusively. As each number is read,display it only if it is not a duplicate of a number already read, providing for the “worst case”, which is allfive numbers are different.Use the smallest possible array to solve this problem. Display the complete set of unique values inputafter the user inputs each new value.Programming Steps1. Download the provided programs Project7_UniqueNumbers.java andProject7_UniqueNumbersTest.java2. Complete the programs to use arrays in your compilera. There are nine (9) TODOsi. Seven (7) in Project7_UniqueNumbers.javaii. Two (2) in Project7_UniqueNumbersTest.javab. You should add necessary statements/structures to the given programs as instructed inthe comments3. Debug and run your applicationarrow_forwardSimple try-catch-finally Program This lab is a simple program that demonstrates how try-catch-finally works. You will notice the output when you enter incorrect input (for example, enter an incorrect index or an alpha character instead of an integer). Type up the code, execute and submit the results ONLY. 1. Enter a valid array index 2. Enter an invalid array index 3. Enter a letter instead of an integer - NOTE: Using the general error will show you the type of exception was caught, and you can then update your code to catch that type of error. 4. Try putting the "Exception e" before the IndexOutOfBounds Exception eob what happens and are you able to run the code - what happens? CODE: import java.util.Scanner; public class TryCatchFinally { public static void main(String[] args) { // Instantiate a scanner Scanner input = new Scanner(System.in); } } // Create an array with 4 values int an IntArr[] = {10, 15, 26, 99); try { System.out.println("Enter the index to see the number: "); int…arrow_forwardUse a single-subscripted array to solve the following problem. Read in 10 numbers, as each number is read, save it in the array only if it is not a duplicate of a number already read. If user enter 5 times duplicated number, then stop taking numbers and print the array. Write a C codearrow_forward
- An array index should normally be of type float. State whether the statement is true or false. If false, explain why.arrow_forward,conveyance allowance and basic pay. Write a program that takes 20 elements of array from user at run time. Find maximum element of array and swap it with last element of array. Display before and after swapping array. OOLuck ENG 813 AM IN 4/14/2021arrow_forwardProblem 3: Use a one dimensional array to solve the following problem: Read in 10 numbers, each of which is between 10 and 100. As each number is read, print it only if it’s not a duplicate of a number that has already been read. Provide for the “worst case,” in which all 10 numbers are different. Use the smallest possible array to solve the problem.arrow_forward
- Correct answer will be upvoted else Multiple Downvoted. Computer science. assume mid=⌊max(array)+min(array)2⌋, where max and min — are capacities that track down the maximum and the base array components. At the end of the day, mid is the amount of the maximum and the base component of array separated by 2 adjusted down. Then, at that point, the array is parted into two parts left and right. The left array contains all components which are not exactly or equal mid, and the right array contains all components which are greater than mid. Components in left and right maintain their relative control from array. During the third step we pick which of the left and right arrays we want to keep. The picked array replaces the current one and the other is permanently discarded. You want to assist Mike with discovering the aftereffects of q beauty tests. Note that you test the attractiveness of the array a, so you start each beauty test with the primordial (initial) array a.…arrow_forwardANSWER IN JAVA: Write an application that inputs five numbers, each between 10 and 100, inclusive. As each number is read, display it only if it’s not a duplicate of a number already read. Provide for the “worst case,” in which all five numbers are different. Use the smallest possible array to solve this problem. Display the complete set of unique values input after the user enters each new value. NOTE: looking for the output to appear on three lines as shown in the results STANDARD OUTPUT: Enter·an·integer·between·10·and·100:This·is·the·first·time·100·has·been·entered↵ Enter·an·integer·between·10·and·100:Enter·an·integer·between·10·and·100:This·is·the·first·time·10·has·been·entered↵ Enter·an·integer·between·10·and·100:This·is·the·first·time·20·has·been·entered↵ Enter·an·integer·between·10·and·100:The·complete·set·of·unique·values·entered·is:↵ Unique·Value·1:·is·100↵ Unique·Value·2:·is·10↵ Unique·Value·3:·is·20↵arrow_forward1.Write the code to take an array (int stuff[100]) and initialize each element of stuff to -1. 2.Write the code to take an array (int stuff[100]) and initialize each element with user input a.Update the program to sum the values in the array. b.Update the program to print all elements of the array in reverse order. c.Update the program to search through the array and find the smallest value in the array. d.Update the program to search through the array for the value 6, and print “found it”, if it exists. #####java only#####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
Programming with Microsoft Visual Basic 2017Computer ScienceISBN:9781337102124Author:Diane ZakPublisher:Cengage Learning
Programming Logic & Design ComprehensiveComputer ScienceISBN:9781337669405Author:FARRELLPublisher:Cengage
EBK JAVA PROGRAMMINGComputer ScienceISBN:9781337671385Author:FARRELLPublisher:CENGAGE LEARNING - CONSIGNMENT
C++ for Engineers and Scientists
Computer Science
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Course Technology Ptr
Programming with Microsoft Visual Basic 2017
Computer Science
ISBN:9781337102124
Author:Diane Zak
Publisher:Cengage Learning
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage
EBK JAVA PROGRAMMING
Computer Science
ISBN:9781337671385
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT
9.1: What is an Array? - Processing Tutorial; Author: The Coding Train;https://www.youtube.com/watch?v=NptnmWvkbTw;License: Standard Youtube License