Write a method that takes as input an array of integers and return a list of arrays representing all possible permutations of that array Example: Input: [1, 2, 3, 4] Output: [1, 2, 3, 41, [1, 4, 3, 2], [4, 3, 1, 2], etc.

Write a method that takes as input an array of integers and return a list of arrays representing all possible permutations of that array Example: Input: [1, 2, 3, 4] Output: [1, 2, 3, 41, [1, 4, 3, 2], [4, 3, 1, 2], etc.

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

PLEASE TYPE ONLY*** JAVA PROGRAMMING Task: a program called ArrayList_Practice. In this program, please do the following operations. Complete a method called RedundantCharacterMatch(ArrayList<Character> YourFirstName): the parameter of this method is an ArrayList<Character> whose elements are the characters in your first name (they should be in the order appear in your first name, e.g., if your first name is bob, then the ArrayList<Char> includes ‘b’, ‘o’, ‘b’.). The method will check whether there exists duplicate characters in your name and return the index of those duplicate characters. For example, when using bob as first name, it will return b: 0, 2. Create ArrayList<Character> NameExample. All the characters of your first name will appear twice in this ArrayList. For example, if your first name is bob, then NameExample will include the following element {b,o,b,b,o,b}. Then, please use NameExample as parameter for the method RedundantCharacterMatch(). If…
PLEASE TYPE ONLY*** JAVA PROGRAMMING Task: a program called ArrayList_Practice. In this program, please do the following operations. Complete a method called RedundantCharacterMatch(ArrayList<Character> YourFirstName): the parameter of this method is an ArrayList<Character> whose elements are the characters in your first name (they should be in the order appear in your first name, e.g., if your first name is bob, then the ArrayList<Char> includes ‘b’, ‘o’, ‘b’.). The method will check whether there exists duplicate characters in your name and return the index of those duplicate characters. For example, when using bob as first name, it will return b: 0, 2. Create ArrayList<Character> NameExample. All the characters of your first name will appear twice in this ArrayList. For example, if your first name is bob, then NameExample will include the following element {b,o,b,b,o,b}. Then, please use NameExample as parameter for the method RedundantCharacterMatch().…
Exercise 1: Write a program that generates a sequence of 20 random values between 0 and 99 in an array, prints the sequence, sorts it, and prints the sorted sequence. Use the sort method from the standard Java library. Exercise 2: Write a program that stores a list of countries: "Egypt", "Switzerland", "Argentina", "Spain", "Portugal", "Luxemburg", etc. Initialize your array with a single statement. Then print out the array. Use the sort function as before to sort the countries in alphabetical order. Reprint your array. Exercise 3: Implement exercises 1 and 2 using ArrayList. Use the Collections.sort method for sorting. After you have printed and sorted your results, then append an additional element to each list and reprint your ArrayLists. Notice that the new items will appear just at the end and will not be sorted. Resort and print out the new ArrayLists again. To clarify, you should print out your ArrayLists after your first sort, after adding items with the…
Project Description: In this project you implement an ArrayStack ADT and use the stack for implementing the following methods: a) Reverse an array of Words: Accept an array of words as input parameter and return an array of words in reverse order. Use the method signature: public static String[] reverse Words (String[] wordList) Example Input: Bird Cat Dog Elephant Output: Elephant Dog Cat Bird
Rotate Right k cells (use python) Consider an array named source. Write a method/function named rotateRight( source, k) that rotates all the elements of the source array to the right by 'k' positions. You must execute the method by passing an array and number of cells to be shifted. After calling the method, print the array to show whether the elements have been shifted properly. Example: source=[10,20,30,40,50,60] rotateRight(source,3) After calling rotateRight(source,3), printing the array should give the output as: [ 40, 50, 60, 10, 20, 30]
Project Description: In this project you implement an ArrayStack ADT and use the stack for implementing the following methods: a) Reverse an array of Words: Accept an array of words as input parameter and return an array of words in reverse order. Use the method signature: public static String[] reverseWords (String[] wordList) Example Input: Bird Cat Dog Elephant Output: Elephant Dog Cat Bird
In main() for now: do these - one at a time, each in it's own loop (we will make functions out of them later –Declare an array RandArray with 20 integers –Assign each of the 20 values with a random value from 0 to 99 Hint: Use rand()%100 For mimir: Do not call srand at the top of main. // normally: Call srand(time(0)) at the top of main –(you need #include<cstdlib>) –Write another loop that prints the array, with index values Important: If the output values do not match mimir, please add srand(17); // inside your main function - at the top code format: #include <iostream>using namespace std; #include <cstdlib> // required for rand() int main(){ srand(17); // define a constant ARRAYSIZE that is 20 // declare randArray // set the 20 elements in randArray to be a random number between 0 and 99 // hint: use rand()%100 // print the 20 values return 0;}
. - Write a method called checkArrays that accepts as parameters two arrays of integer (A and B of the same size) and returns another array of integers (C) initialized as follows: C[i] = 1 if B[i] divides A[i], otherwise C[i]=0. For example: A 12 20 4 30 3 6 24 C 1 0 0 1 B Use the following method header: public static int[] checkArrays (int[] A, int[ 1 B) Sample Run: 15 Write a void method called printArray that accepts as parameters an array of integers and print its values. Use the following method header: public static void printArray (int[] arr) ArrayA: 12 ArrayB: 3: ArrayC: 1 17 260 9 Write a main method to test the above methods as follows: Declare and initialize 2 integer arrays (arrayA and arrayB) of size 5 (fill the 2 arrays with random integers between 1 and 100). Invoke the method printArray to display the values stored in the two arrays. Invoke the method checkArrays and pass to it the two arrays arrayA and arrayB. Invoke the method printArray to display the values of the…
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
Problem 1:Complete the sumOfDiagonalsmethod in SumOfDiagonals.javato do the following:-The method takes a 2D Stringarray xas a parameter and returns no value.-The method should calculate and print the sum of the elements on the major diagonal of the array x.-In order to have a major diagonal, the array passed intothe method should be a square (n-by-n),if it’s not a square your program should handle that situation by throwing an exception. (Do Not worry about ragged arrays)-If the array is a square, but there is a non-integer value on the major diagonal, your program should handle that situation by throwing an exception.-When handling the exceptions, be as specific as you can be, (i.e. Do Notjust use the Exceptionclass to handle all exceptions in one catch block).-Make the proper calls to the sumOfDiagonalsmethod from the main method to test your sumOfDiagonalsmethod on all the String arrays provided in the main method.-Sample runs provided on the next page
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
Problem 1: Complete the sumOfDiagonals method in SumOfDiagonals.java to do the following: The method takes a 2D String array x as a parameter and returns no value. The method should calculate and print the sum of the elements on the major diagonal of the array x. In order to have a major diagonal, the array passed into the method should be a square (n-by-n), if it's not a square your program should handle that situation by throwing an exception. (Do Not worry about ragged arrays) If the array is a square, but there is a non-integer value on the major diagonal, your program should handle that situation by throwing an exception. When handling the exceptions, be as specific as you can be, (i.e. Do Not just use the Exception class to handle all exceptions in one catch block). Make the proper calls to the sumOfDiagonals method from the main method to test your sumOfDiagonals method on all the String arrays provided in the main method.