
Explanation of Solution
Method definition for “removeDuplicates”:
/* Method definition for "removeDuplicates" */
public static Character[] removeDuplicates(Character[] in)
{
//Declare boolean variables
boolean keptArray[] = new boolean[in.length];
/* In the start, user indicate that each array element will be kept using "for" loop */
for(int i = 0; i < in.length; i++)
{
/* Assign all array elements to "true" */
keptArray[i] = true;
}
/* Check whether each characters contains duplicate characters */
for(int i = 0; i < in.length; i++)
{
/* If the given character is not a duplicate, then check the remaining character contains duplicate characters or not */
if(keptArray[i])
for(int idx = i+1; idx < in.length; idx++)
{
if(in[i] == in[idx])
keptArray[idx] = false;
}
}
/* Compute the number of non-duplicates character in array */
/* Initializes the char count to "0" */
int charCount = 0;
/* Compute the count of non-duplicate character by using "for" loop */
for(int i=0; i<in.length; i++)
{
if(keptArray[i])
charCount++;
}
/* Declare an array "newArray" for copy the non-duplicate characters */
Character newArray[] = new Character[charCount];
/* Initializes the variable "arrayPosition" to "0" */
int arrayPosition = 0;
/* Copy the non-duplicates character into new array "newArray" */
for(int i = 0; i < in.length; i++)
{
if(keptArray[i])
{
newArray[arrayPosition] = in[i];
arrayPosition++;
}
}
return newArray;
}
Complete code:
The complete code for implementing the method “removeDuplicates” is given below:
//Define "DuplicateArrayTest" class
public class DuplicateArrayTest
{
//Define main function
public static void main(String[] args)
{
//Initializes the array "arr"
Character[] arr = {'b', 'd', 'a', 'b', 'f', 'a', 'g', 'a', 'a', 'f' };
//Display given statement
System.out.println("New array of characters in the given array is: ");
/* Call "removeDuplicates" method and store the result in character variable "result" */
Character [] result = removeDuplicates(arr);
/* Display the character in "result" variable using "for" loop */
for(int i = 0; i < result.length; i++)
{
/* Display the character value in array "result" */
System.out.print(result[i] + " ");
}
//For next line
System.out.println();
}
/* Method definition for "removeDuplicates" */
public static Character[] removeDuplicates(Character[] in)
{
//Declare boolean variables
boolean keptArray[] = new boolean[in.length];
/* In the start, user indicate that each array element will be kept using "for" loop */
for(int i = 0; i < in...
Want to see the full answer?
Check out a sample textbook solution
Chapter 7 Solutions
Java: An Introduction to Problem Solving and Programming (7th Edition)
Additional Engineering Textbook Solutions
Web Development and Design Foundations with HTML5 (8th Edition)
Concepts Of Programming Languages
Management Information Systems: Managing The Digital Firm (16th Edition)
SURVEY OF OPERATING SYSTEMS
Starting Out with C++ from Control Structures to Objects (9th Edition)
Introduction To Programming Using Visual Basic (11th Edition)
- Don't use chatgpt or any other AIarrow_forwardGiven a relation schema R = (A, B, C, D, E,G) with a set of functional dependencies F {ABCD BC → DE B→ D D→ A}. (a) Show that R is not in BCNF using the functional dependency A → BCD. (b) Show that AG is a superkey for R (c) Compute a canonical cover Fc for the set of functional dependencies F. Show your work. (d) Give a 3NF decomposition of R based on the canonical cover found in (c). Show your work. (e) Give a BCNF decomposition of R using F. Show your work.arrow_forwardThe following entity-relationship (ER) diagram models a database that helps car deal- ers maintain records of customers and cars in their inventory. Construct a relational database schema from the ER diagram. Your set of schemas should include primary-key and foreign-key constraints and you should ensure there are no redundant schemas. has_model model modelID name vehicle has_vehicle VIN dealer_ID brand name has_available_option has_option has_dealer options options_ID specification dealer dealer ID name customer_ID owned_by customer customer ID namearrow_forward
- A relation schema R = (A, B, C, D, E) with a set of functional dependencies F= {D A CAB} is decomposed into R₁ = (A, B, C) and R2 = (C, D, E). (a) Is this a lossless-join decomposition? Why or why not? (b) Is the decomposition dependency preserving? Why or why not?arrow_forwardNo chatgpt pleasearrow_forwardPlease help draw alu diagraarrow_forward
- 1. Level the resources (R) for the following network. Show exactly which activity is being moved at each cycle and how many days it is being moved. Show all cycles required to utilize the free float and the back float. B H 3 3 L 2 0-0-0 A C F G K N P Q T 0 3 2 2 1 2-2-2 7R 8R 4R 6R 4R 2R 5R 4R D 1 2R 2 M 000 4R 2 4R 1 2 3 4 B5 B BE B 5 5 7 D 2003 C NO C MBSCM В H 5 2 F 7 7 8 SH2F80 5 Н Н 6 7 7L3G4+ 6H2G4 J 4 4 14 8 L K 00 36 9 10 11 12 13 14 15 P 2 Z+ N N 4 4 Z t 2334 4 Σ + M M 4 +arrow_forward2. Perform resource allocation for the following project. Resource limits are 6 labors and 2 helpers. Legend: Activity Dur Resources G H 2 3 2L 1H 2L OH A 1 3L 1H + B D F J K 3 4 6 2 4 4L 2H 3L OH 4L 1H 2L 2H 4L 2H C E 2 2 I 1 2L 1H 3L 1H 5L 1Harrow_forwardNeed Java method please. Thank you.arrow_forward
- Need Java method please. Thank you.arrow_forward3. Write two nested loops to generate the following output. (Note: There is one space between each number, and any extra line shown is intentional.) 12 10 8 6 18 15 12 24 20 30 2 3 3 6 48 12 5 10 15 20 6 12 18 24 30arrow_forwardWrite in verilog coding languagearrow_forward
- Programming Logic & Design ComprehensiveComputer ScienceISBN:9781337669405Author:FARRELLPublisher:Cengage
EBK JAVA PROGRAMMINGComputer ScienceISBN:9781337671385Author:FARRELLPublisher:CENGAGE LEARNING - CONSIGNMENT
C++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage Learning
Microsoft Visual C#Computer ScienceISBN:9781337102100Author:Joyce, Farrell.Publisher:Cengage Learning,
C++ for Engineers and ScientistsComputer ScienceISBN:9781133187844Author:Bronson, Gary J.Publisher:Course Technology Ptr
New Perspectives on HTML5, CSS3, and JavaScriptComputer ScienceISBN:9781305503922Author:Patrick M. CareyPublisher:Cengage Learning




