
Using arrays or ArrayList in java language
Write the method named mesh.
*
* Start with two ArrayLists of String, A and B, each with
* its elements in alphabetical order and without any duplicates.
* Return a new list containing the first N elements from the two
* lists. The result list should be in alphabetical order and without
* duplicates. A and B will both have a size which is N or more.
* Your solution should make a single pass over A and B, taking
* advantage of the fact that they are in alphabetical order,
* copying elements directly to the new list.
*
* Remember, to see if one String is "greater than" or "less than"
* another, you need to use the compareTo() method, not the < or >
* operators.
*
* Examples:
* mesh(["a","c","z"], ["b","f","z"], 3) returns ["a","b","c"]
* mesh(["a","c","z"], ["c","f","z"], 3) returns ["a","c","f"]
* mesh(["f","g","z"], ["c","f","g"], 3) returns ["c","f","g"]
*
* @param a an ArrayList of String in alphabetical order.
* @param b an ArrayList of String in alphabetical order.
* @param n the size of the resulting list to return.
* @return a list of n elements in alphabetical order.

Trending nowThis is a popular solution!
Step by stepSolved in 3 steps with 1 images

- using arrays or Arraylist in java language Write the method named examScore().* * The "key" list contains the correct answers * to an exam, like ["a", "a", "b", "b"]. The "answers" * list contains a student's answers, with "?" representing * a question left blank. The two lists are not empty and * are the same length. Return the score for this list * of answers, giving +4 for each correct answer, -1 for * each incorrect answer, and +0 for each blank answer.* * Examples:* examScore(["a", "a", "b", "b"], ["a", "c", "b", "c"]) returns 6* examScore(["a", "a", "b", "b"], ["a", "a", "b", "c"]) returns 11* examScore(["a", "a", "b", "b"], ["a", "a", "b", "b"]) returns 16* * @param key a list of correct answers to an exam.* @param answers the student's answers to the exam.* @return the score as described above.arrow_forwardWrite a programme that calls a method that accepts an integer array as a parameter (you may initialise an array in the main function) and returns the list's minimal value. Below is a partial programme. public class Min{ public static void main(String[] args){ int arr= System.out.print(minimum(arr)); }arrow_forwardCreate a method that checks if two sets of integers are equivalent by writing a function to compare them. If two lists are drastically different, the method should highlight the greater of their maximum values.arrow_forward
- Create a program that will encrypt letters and create a secret code. You will create an array of numbers from 0 - 25. use [i for i in range (26)] to create an array of numbers from 0 - 25. use random.shuffle to to shuffle the above array. This will be used for a new letter index order. For example: The first created array [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25] gets shuffled to become[2, 14, 12, 20, 16, 5, 11, 1, 13, 17, 15, 21, 19, 10, 23, 22, 25, 3, 6, 7, 18, 4, 9, 24, 0, 8] This will be used as the new index for the encrypted alphabet. create an array of letters using list(string.ascii_lowercase), this requires importing the string module. This will create: ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z'] Accept an input of a word. Using the above tables take each letter of the word and convert it to the encrypted letter. Print each…arrow_forward(a) Write a method public static void insert(int[] a, int n, int x) that inserts x in order among the first n elements of a, assuming these elements are arranged in ascending order. Do NOT use arraylists. x is the last element in a. n does not include x. (b) Using the insert method from Part (a), write a recursive implementation of Insertion Sort.arrow_forwardJava Programming! Please, write the method only, not an entire program. Thanks Write a method that is passed in an ArrayList of Strings and returns true of the list is sorted in non-descending order, false if not.arrow_forward
- Complete the below function (using recursion)arrow_forwardYou are given an array-like data structure Listy which lacks a size method. It does, however, have an elementAt ( i) method that returns the element at index i in 0( 1) time. If i is beyond the bounds of the data structure, it returns -1. (For this reason, the data structure only supports positive integers.) Given a Listy which contains sorted, positive integers, find the index at which an element x occurs. If x occurs multiple times, you may return any index. Write code with explanationarrow_forwardQuestion in java Arraylist Please help fastarrow_forward
- Write a Java program that will allow the user to play a hangman game repeatedly until theychoose to stop. The game should randomly choose a secret word from a pre-set list of wordsfor the user to guess. Store the list of words available for play in an array so you can randomlychoose them by index during game play.During a turn, the user will guess one letter at a time. Each letter in the secret word shoulddisplay as an asterisk until the letter is guessed by the user. When a correct letter is guessed,the letter should be displayed in the correct position in place of the asterisk. The user hangshimself with the 8th wrong guess and loses the game.Make a character array to hold the characters and asterisks representing the word beingguessed. You can change the contents of this array as the letters are guessed and revealed. Inother words, this array can be used to display the current state of the secret word each round.Here is the list of words the game should choose from for the secret…arrow_forward1. Write a method countCommon that accepts two lists of integers as parameters and returns the number of unique integers that occur in both lists. Use one or more sets as storage to help you solve this problem. For example, if one list contains the values [3, 7, 3, –1, 2, 3, 7, 2, 15, 15] and the other list contains the values [–5, 15, 2, –1, 7, 15, 36], your method should return 4 because the elements –1, 2, 7, and 15 occur in both lists. Your method should return correct result with different lists as well. 2. Write a method maxLength that accepts a set of strings as a parameter and that returns the length of the longest string in the list. If your method is passed an empty set, it should return 0.In your project COSC241<Lab4>_<your username>, create Lab4_yourusername.java and declare proper lists and sets to call the two methods countCommon and maxLength. And your output should show the two methods work as expected.Make sure you have comments through your program.arrow_forwardDefine a collection “ArrayList” to store the students' names. Use a loop to take 5 students’ names from the user and store them in the collection. Add two student names to the collection and remove the last name in the list. Insert a student name in third place in the collection. Sort the names alphabetically. Ask the user to enter a student name and search for it in the collection and prints the result as “Found” or “Not Found”. Print the whole collection using the enhanced for loop. (java)arrow_forward
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education





