Write a C++ program that defines an array of integers, add a method, removeDuplicate(), that removesduplicates from the array. When a duplicate element is found, the discovered element must be replacedby zero. Display the elements of the array before and after duplicates are removed.For example, if the elements of the array are: 2 711461392After the duplicates are removed, the elements of the array are: 2710460390To implement the code to remove the duplicate integers, use the code I provide and insert your codein the removeDuplicate() method to perform the task.After you complete the code, what is the Big(0) of your removeDuplicate( ) method?Hinclude using namespace stdjint a (] = (2, 7, 1, 1, 4, 6, 1, 3, 9, 2}3int size = sizeof(a)/sizeof(a[@]);void displayarray() {for(int i = 0j i e sizej i++) {cout « a[i] « * *icout « endl;void removeDuplicate() {Write your C+ code to removethe duplicate integers in this method.int main() {displayArray();removeDuplicate();displayArray();return e;

We have to code in C++ for the following question. I have implemented the code to remove the…

uplicates from the array. When a duplicate element is found, the discovered element must be y zero. Display the elements of the array before and after duplicates are removed. pr example, if the elements of the array are: 2711461392 fter the duplicates are removed, the elements of the array are: 2710 460390 implement the code to remove the duplicate integers, use the code l provide and insert y the removeDuplicate(0 method to perform the task. ter you complete the code, what is the Big(O) of your removeDuplicate( ) method? include sing namespace std; nt a [] (2, 7, 1, 1, 4, 6, 1, 3, 9, 2}3 nt size = sizeof(a)/sizeof(a[@]); oid displayarray() { for (int i = ej i e size; i++) { cout « ati] « cout e endl; oid removeDuplicate() { Write your C+ code to remove the duplicate integers in this method. nt main() { displayarray(); removeDuplicate(); displayArray(); return e

uplicates from the array. When a duplicate element is found, the discovered element must be y zero. Display the elements of the array before and after duplicates are removed. pr example, if the elements of the array are: 2711461392 fter the duplicates are removed, the elements of the array are: 2710 460390 implement the code to remove the duplicate integers, use the code l provide and insert y the removeDuplicate(0 method to perform the task. ter you complete the code, what is the Big(O) of your removeDuplicate( ) method? include sing namespace std; nt a [] (2, 7, 1, 1, 4, 6, 1, 3, 9, 2}3 nt size = sizeof(a)/sizeof(a[@]); oid displayarray() { for (int i = ej i e size; i++) { cout « ati] « cout e endl; oid removeDuplicate() { Write your C+ code to remove the duplicate integers in this method. nt main() { displayarray(); removeDuplicate(); displayArray(); return e

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Program64.javaWrite a program that demonstrates method overloading by defining and calling methods that return the area of a triangle, a rectangle, or a square. Program71.java Write a program that creates a 32-element array of random integers all from 1 to 100, inclusive. Then execute a custom method with the array as its only argument. The method should begin by using a loop to print the array elements in 4 rows and 8 columns, with all columns being five characters wide. Duplicates are okay. This same loop should determine how many integers in the array are odd numbers. After this loop ends, use this figure to declare a new array of integers named odds. Process the array again in the method, but this time with a foreach loop, and add the odd integers to the odds array. Return the odds array back to main. In main, report the size of the array and sort it ascending. Finally use a while loop to print the odd integers all on one line separated by spaces.
Java Problem: Implementing a method to print a cell's neighbors on a 2D array. The method's header is provided. The main method (do not alter it)w ill read N numbers to create the 2D array and it will call the method for you. Do not go out of the bounds of the 2D array. I have attached what it should look like with the following input: 4 4 1 2 3 4 7 8 9 10 13 14 15 16 19 20 21 22 2 2 Code I have so far: import java.util.Arrays;import java.util.Scanner;public class Problem3 {public static void printNeighbours(int[][] data, int row, int col){}public static void main(String[] args) {Scanner kb = new Scanner(System.in);int[][] data = new int[kb.nextInt()][kb.nextInt()];for (int i = 0; i < data.length; i++) {for (int j = 0; j < data[0].length; j++) {data[i][j] = kb.nextInt();}}System.out.println("The 2D Array:");for (int[] cols : data) {System.out.println(Arrays.toString(cols));}int row = kb.nextInt();int col = kb.nextInt();System.out.printf("The centre point is: %d %d…
Use C#. Chapter 6 discussed the predefined IndexOf() method of an array; the method takes two parameters, the whole array and an element to search. The method returns the index of the element if found, and -1 if not found. Now, you are asked to write a program that has a method FindMatch() that does exactly the same thing: 1) The Main() calls FindMatch(). 2) FindMatch() takes two parameters: 1) the whole array of integer test scores { 85, 98, 100, 73, 67, 82, 92, 87 }, and 2) an element to search from users input. 3) FindMatch() returns the index of element if found back to the Main(), and -1 if not found. The method should not use IndexOf() to do the search. 4) The program displays either the index or -1 in the Main(). Sample output (from Microsoft Visual Studio) as shown below
3. Remove an element from an array Consider an array named source. Write a method/function named remove( source, size, idx) that removes the element in index idx of the source array. You must execute the method by passing an array, its size and the idx( that is the index of the element to be removed). After calling the method, print the array to show whether the element of that particular index has been removed properly. Example: source=[10,20,30,40,50,0,0] remove(source,5,2) After calling remove(source,5,2) , printing the array should give the output as: [ 10,20,40,50,0,0,0] Use Python language
3. Remove an element from an array Consider an array named source. Write a method/function named remove( source, size, idx) that removes the element in index idx of the source array. You must execute the method by passing an array, its size and the idx( that is the index of the element to be removed). After calling the method, print the array to show whether the element of that particular index has been removed properly. Example: source=[10,20,30,40,50,0,0] remove(source,5,2) After calling remove(source,5,2) , printing the array should give the output as: [ 10,20,40,50,0,0,0] [Use Python and Don't use Built-in function like "pop"]
3. write a method called insert that inserts an element into an integer array. It should take 3 parameters: an int array, the number to be inserted and the index it should be inserted at. It should return a new array that has the element inserted at the index (the new array should have a length 1 longer than the original array). Sample code int[] a = {1,2,3,4,5}; int[] inserted = insert (a,9,0); printArray (inserted); int [] a = {1,2,3,4,5}; int[] inserted = insert (a,9,3); printArray(inserted); int [] a = {1,2,3,4,5}; int[] inserted = insert(a,9,5); | printArray(inserted); Sample output 912345 123945 123459
3. write a method called insert that inserts an element into an integer array. It should take 3 parameters: an int array, the number to be inserted and the index it should be inserted at. It should return a new array that has the element inserted at the index (the new array should have a length 1 longer than the original array). Sample code int [] a = {1,2,3,4, 5}; int[] inserted = insert (a,9,0); printArray (inserted); int[] a = int[] inserted = insert(a,9,3); printArray (inserted); int[] a = {1,2,3,4,5}; int [] inserted = insert (a,9,5); printArray(inserted); Sample output 9123 4 5 {1,2,3,4,5}; 123945 1234 59
Pseudocode for Java code Write the algorithm in pseudocode for a method that accepts three parameters: an integer array, an integer representing the number of valid values in the array, and an integer representing a factor. The method will count the number of valid values in the array that are multiples of the factor and will return the count. There is a Java operator that might be very helpful in solving this problem. Testing Above problem: Assuming that the first two parameters are an array containing 4, 10, 15, 12, 8, 20, 100, 25, 32, 7, 28, and 48 and the number 12, come up with three good test cases for the factor and the return value. factor numMultiples
A bit new to methods and need a little bit of help. Swap Method Your task is to write a public static method named swap that takes a single parameter which is an array of doubles. This method should swap the first and last element in the array and then return the adjusted double array. You can assume that all arrays passed into the method are a length of 2 or more. For example, the test data provided when passed into the swap method should go from: {8.34, 7.221, 10.643, 93.2} to
URGENT JAVA Write a Java method that takes two 2 dimensional int arrays (a and b) and a 2 dimensional boolean array (c) where all three arrays have the same size. Your method should return an array (result) such that, if a partic- ular element in c is true, then the corresponding (same indexed) element in result must be the multiplication of the the corresponding elements of a and b. If the element in c is false, then the the corresponding element in result must be the negative of multiplication of the the corresponding element in a and b. For example ifa = {{1,2,3},{4,5}},b = {{1,2,1},{0,2}} andc = {{true,false,true},{false,true}}, then the result should be result={{1, -4, 3}{0, 10}}.
Problem: Write a method that will determine whether a given value can be made given an array of coin values. For example, each value in the array represents a coin with that value. An array with [1, 2, 3] represents 3 coins with the values, 1, 2, and 3. Determine whether or not these values can be used to make a desired value. The coins in the array are infinite and can only be used as many times as needed. Return true if the value can be made and false otherwise. Dynamic Programming would be handy for this problem. Data: An array containing 0 or more coin values and an amount. Output: Return true or false. Sample Data ( 1, 2, 3, 12, 5 ), 3 ( 4, 15, 16, 17, 1 ), 21 ( 1 ), 5 ( 3 ), 7 Sample Output true true true false
Write a Java program tat prompts user for a list of integers with 0 as the last value.Save the values in an array. Assume there can be maximum 100 values. Theprogram should have the following methods:- A method that takes the array as parameter and updates each value in thearray to the square of the value.- Another method that takes the original and modified arrays as parametersand displays the original and the squared values.