Nedd help in this. Must be in java. make the code unique and no plagerism.write a program that prints out the lists in main after the following methods are called.removeOddLength: Takes an ArrayList of strings as a parameter and removes all of the strings that have an odd length (number of characters), from the list. Return the ArrayList to main and print. swapPairs: Takes an ArrayList and switches the order of values of strings in a pairwise fashion. Your method should switch the order of the first two values, then the next two, then the next two and so on. If the number of values in the list is odd, the method should not move the final element. For example, if the list stores [“madam”, “I”, “am”, “your”, “adam”] your method should change this lists content to [“I”, “madam”, “your”, “am”, “adam”] Return the ArrayList to main and print. intersect: Accepts two sorted ArrayList of integers as parameters and returns one containing only the elements that are found in both. For example, if list1 and list2 initially store: [1, 4, 8, 9, 11, 15, 17, 28, 41, 59][4, 7, 11, 17, 19, 20, 23, 28, 37, 59, 81] then the call of intersect(list1, list2)returns: [4, 11, 17, 28, 59]Return the ArrayList to main and print. output should be like this: Before: [Madam, I, am, your, Adam]After:[am, your, Adam]Before: [Madam, I, am, your, Adam]After:[I, Madam, your, am, Adam][4, 11, 17, 28, 59]

Programm: import java.util.ArrayList; import java.util.Arrays; import java.util.Collections;…

Answered: write a program that prints out the…

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

Related questions

Question

Nedd help in this. Must be in java. make the code unique and no plagerism.

write a program that prints out the lists in main after the following methods are called.

removeOddLength: Takes an ArrayList of strings as a parameter and removes all of the strings that have an odd length (number of characters), from the list. Return the ArrayList to main and print.

swapPairs: Takes an ArrayList and switches the order of values of strings in a pairwise fashion. Your method should switch the order of the first two values, then the next two, then the next two and so on. If the number of values in the list is odd, the method should not move the final element. For example, if the list stores [“madam”, “I”, “am”, “your”, “adam”] your method should change this lists content to [“I”, “madam”, “your”, “am”, “adam”] Return the ArrayList to main and print.

intersect: Accepts two sorted ArrayList of integers as parameters and returns one containing only the elements that are found in both. For example, if list1 and list2 initially store:

[1, 4, 8, 9, 11, 15, 17, 28, 41, 59]

[4, 7, 11, 17, 19, 20, 23, 28, 37, 59, 81]

then the call of intersect(list1, list2)returns: [4, 11, 17, 28, 59]

Return the ArrayList to main and print.

output should be like this:

Before: [Madam, I, am, your, Adam]
After:[am, your, Adam]
Before: [Madam, I, am, your, Adam]
After:[I, Madam, your, am, Adam]
[4, 11, 17, 28, 59]

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 2 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions