Introduction to Java Programming and Data Structures, Comprehensive Version (11th Edition)
11th Edition
ISBN: 9780134670942
Author: Y. Daniel Liang
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 30, Problem 30.8PE
Program Plan Intro
Eliminate duplicates
Program Plan:
- Import necessary stream packages into program.
- Define the class named “Main”.
- Define main method.
- Declare an array variable “val[]” in type of “int”.
- Initialize the object “obj” for “Scanner” class.
- Prompt the user and get the 10 values from user using “for” loop.
- Call the method “eliminateDuplicates()” and print the resultant values on screen.
- Define the “eliminateDuplicates ()” method which takes integer variable “list” as parameter.
- Call the predefined method “distinct()” to find distinct values and return the sorted elements of array using “IntStream” class.
- Define main method.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
5(b) Give the two arrays that will be merged by the final step of mergesort on [8, 2, 1, 4, 5, 3, 7, 9].
State whether the statement are true or false. If the answer is false, explain why? " If there are fewer initializers in an initializer list than the number of elements in the array , the remaining elements are initialized to the last value in the initializer list.
Where are the arrays stored during execution?
Chapter 30 Solutions
Introduction to Java Programming and Data Structures, Comprehensive Version (11th Edition)
Ch. 30.1 - Prob. 30.1.1CPCh. 30.2 - Prob. 30.2.1CPCh. 30.2 - Prob. 30.2.2CPCh. 30.2 - Prob. 30.2.3CPCh. 30.2 - Prob. 30.2.4CPCh. 30.3 - Prob. 30.3.1CPCh. 30.3 - Prob. 30.3.2CPCh. 30.3 - Prob. 30.3.3CPCh. 30.3 - Prob. 30.3.4CPCh. 30.3 - Given an array names in Listing 30.1, write the...
Ch. 30.4 - Prob. 30.4.1CPCh. 30.4 - How do you create a parallel stream?Ch. 30.4 - Prob. 30.4.3CPCh. 30.4 - Prob. 30.4.4CPCh. 30.4 - Prob. 30.4.5CPCh. 30.4 - Write a statement to obtain an array of 1000...Ch. 30.5 - Prob. 30.5.1CPCh. 30.5 - Prob. 30.5.2CPCh. 30.5 - Prob. 30.5.3CPCh. 30.5 - Prob. 30.5.4CPCh. 30.6 - Prob. 30.6.1CPCh. 30.7 - Prob. 30.7.1CPCh. 30.8 - Can the following code be used to replace line 19...Ch. 30.8 - Prob. 30.8.2CPCh. 30.8 - Prob. 30.8.3CPCh. 30.8 - Prob. 30.8.4CPCh. 30.8 - Write the code to obtain a one-dimensional array...Ch. 30 - Prob. 30.1PECh. 30 - Prob. 30.2PECh. 30 - Prob. 30.3PECh. 30 - (Print distinct numbers) Rewrite Programming...Ch. 30 - Prob. 30.5PECh. 30 - Prob. 30.6PECh. 30 - Prob. 30.7PECh. 30 - Prob. 30.8PECh. 30 - Prob. 30.9PECh. 30 - Prob. 30.10PECh. 30 - Prob. 30.11PECh. 30 - (Sum the digits in an integer) Rewrite Programming...Ch. 30 - (Count the letters in a string) Rewrite...Ch. 30 - Prob. 30.14PECh. 30 - (Display words in ascending alphabetical order)...Ch. 30 - Prob. 30.16PECh. 30 - Prob. 30.17PECh. 30 - (Count the occurrences of words in a text file)...Ch. 30 - (Summary information) Suppose the file test.txt...
Knowledge Booster
Similar questions
- I think you forgot to add the insertion function in the code that you provided. The books still display unsorted.arrow_forwardWhat is the difference between void and NULL pointers .Give suitable examples in support of your answer.Give the differences in TABULAR form.arrow_forward- Write a java program that contains a two-dimensional array of 2 rows and 3 columns. Find the sum of each row in the array, trace the code using a tracing table. - Note: No two students can try the same inputs. - You should submit the code and the tracing table in a handwritten pdf file. - Also, you should submit the code and a screenshot of the output using a word file. Tracing Table may look like the following table: Line# i j Array[0][0] Array[0][1] Array[0][2] Array[1][0] Array[1][1] Array[1][2] rowSum Output …….arrow_forward
- (JAVA) AVOID USING BREAKS, CATCH, AND CASE!!!! Texting Translator For this assignment, we are going to work with adding and removing data from arrays, linear search, and File I/O. This program will act as a texting to English converter This program will read a file containing a list of abbreviations used in texting and another file with their English translations. The abbreviations and translations need to be stored in two separate but parallel arrays (Links to an external site.). Open up two new text files inside of Eclipse: Name these text files abbreviations.txt and translations.txt Copy and paste the following list of names into your abbreviations.txt file: 4cuikrkl8l8rlmkm8nvmrsmhuurwu Copy and paste the following list of translations into your translations.txt file: forsee youI know right?okaylatelaterlet me knowmatenever mindareshaking my headyouyou arewhat's up? Starter Code /** * @author * @author * CIS 36B */ import java.util.Scanner; import java.io.File; import…arrow_forwardfix the code and remove compilation errorarrow_forwardHow easy is it to copy a set of shared pointers into another array in C++? Make a list of different ways to solve the problem you've been given. Is it true that when you copy a shared pointer, you also copy the objects it controls? Explainarrow_forward
- # //Write the assembly for the following loop# // Use indexed array access (no pointers)# const int AMAX = 15;# int A[] = {0,1,2,3,4,5,6,7,8,9,10,,11,12,13,14,15};# for (int i=AMAX; i > 0; i--) {# A[i-1] = A[i] * 2;.dataA: .word 0,1,2,3,4,5,6,7, .word 8,9,10,11,12,13,14,15AMAX: .word 15 .text.globl mainmain: #TODO: write the loop code: A[i+1] = A[i] * 2arrow_forwardWrite a sequence of statements using indexed addressing that copies an element in a doubleword array to the previous position in the same array.arrow_forwardWrite statements to do the following: i. Write a loop that computes the sum of all elements in the array, A ii. Write a loop that finds the minimum element in the array, A iii. Write a method to find the maximum in the array, Aarrow_forward
- What's the distinction between void and NULL pointers? Give appropriate examples to back up your answer. Give the distinctions in TABULAR form.arrow_forward5. Using c++, Write a function that determines the index of the second to the last occurrence of a target b in an integer array a. Return -1 if b is not in a or there is only 1 occurrence of b in a.arrow_forward
arrow_back_ios
arrow_forward_ios
Recommended textbooks for you
- C++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage Learning
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning