[Java] Please test your code in the link I provide before you post your answer.
The output should be looked like exact same as the tester.
http://www.codecheck.it/files/17033122188mcxvjz8n8qbk0k9fyfrd3w95
Use the following file:
LinkedListUtilTester.java
import java.util.LinkedList; public class LinkedListUtilTester { public static void main(String[] args) { LinkedList<String> list = new LinkedList<>(); list.add("1"); list.add("2"); list.add("3"); list.add("4"); list.add("5"); list.add("6"); list.add("7"); list.add("8"); list.add("9"); list.add("10"); list.add("11"); list.add("12"); list.add("13"); list.add("14"); list.add("15"); LinkedListUtil.shrink(list, 3); System.out.println(list); System.out.println("Expected: [1, 2, 4, 5, 7, 8, 10, 11, 13, 14]"); System.out.println(LinkedListUtil.reverse(list)); System.out.println("Expected: [14, 13, 11, 10, 8, 7, 5, 4, 2, 1]"); list.clear(); list.add("uno"); list.add("dos"); list.add("tres"); list.add("cuatro"); list.add("cinco"); list.add("seis"); list.add("siete"); list.add("ocho"); list.add("nueve"); list.add("dies"); list.add("once"); list.add("doce"); list.add("trece"); list.add("catorce"); list.add("quince"); LinkedListUtil.shrink(list, 4); System.out.println(list); System.out.println("Expected: [uno, dos, tres, cinco, seis, siete, nueve, dies, once, trece, catorce, quince]"); System.out.println(LinkedListUtil.reverse(list)); System.out.println("Expected: [quince, catorce, trece, once, dies, nueve, siete, seis, cinco, tres, dos, uno]"); } }
LinkedListUtil.java
import java.util.LinkedList;
public class LinkedListUtil
{
//function that takes a linked list as parameter and
an integer n
//function removes every nth element in the list
public static void shrink(LinkedList strings, int
n)
{
//loop through the linked
list
for(int
i=0;i<strings.size();i++)
{
//if i is not 0
and i % n-1 is 0
if(i!=0
&& i%(n-1)==0)
strings.remove(i); //remove the ith
element
}
}
//function that takes a linked list as parameter
and returns its reverse
public static LinkedList reverse(LinkedList
strings)
{
//loop through the linked list
until half of the list is traversed
for (int i = 0; i <
strings.size()/2; i++)
{
//swap the ith
element from first and ith element from last
String temp =
(String) strings.get(i);
strings.set(i,
strings.get(strings.size()-1-i));
strings.set(strings.size()-1-i,temp);
}
//return the reversed linked
list
return strings;
}
}
LinkedListUtilTester.java
import java.util.LinkedList;
public class LinkedListUtilTester
{
public static void main(String[] args)
{
LinkedList list = new LinkedList<>();
//add elements into the list
list.add("1");
list.add("2");
list.add("3");
list.add("4");
list.add("5");
list.add("6");
list.add("7");
list.add("8");
list.add("9");
list.add("10");
list.add("11");
list.add("12");
list.add("13");
list.add("14");
list.add("15");
//call the shrink function to remove every 3rd element
LinkedListUtil.shrink(list, 3);
//print the new list
System.out.println(list);
System.out.println("Expected: [1, 2, 4, 5, 7, 8, 10, 11, 13,
14]");
//call the reverse function and print the reverse of the list
System.out.println(LinkedListUtil.reverse(list));
System.out.println("Expected: [14, 13, 11, 10, 8, 7, 5, 4, 2,
1]");
//clear the linked list
list.clear();
//add elements into the list
list.add("uno");
list.add("dos");
list.add("tres");
list.add("cuatro");
list.add("cinco");
list.add("seis");
list.add("siete");
list.add("ocho");
list.add("nueve");
list.add("dies");
list.add("once");
list.add("doce");
list.add("trece");
list.add("catorce");
list.add("quince");
//call the shrink function to remove every 4th element
LinkedListUtil.shrink(list, 4);
//print the new list
System.out.println(list);
System.out.println("Expected: [uno, dos, tres, cinco, seis, siete,
nueve, dies, once, trece, catorce, quince]");
//call the reverse function and print the reverse of the list
System.out.println(LinkedListUtil.reverse(list));
System.out.println("Expected: [quince, catorce, trece, once, dies,
nueve, siete, seis, cinco, tres, dos, uno]");
}
}
Output:
[Java] Please test your code in the link I provide before you post your answer. The...
[Java] Please test your code in the link I provide before you post your answer. The output should be looked like exact same as the tester. http://www.codecheck.it/files/17050415451csldwjahxt2kwn73ahd6vukt Thank you. Write a simplified application to illustrate the use of an undo button for a word processor. It keeps a history of all items and allows the user to undo the last. Write a class UndoStack. Implement using a Stack of Strings. The constructor will create an empty Stack to keep the...
NO ONE HAS PROVIDED THE CORRECT CODE TO PROVIDE THE GIVEN OUTPUT. PLEASE PROVIDE CODE THAT WOULD CAUSE THE HW1.java TO PRINT THE RIGHT DATA.!!! The LinkedList class implements both the List interface and the Stack interface, but several methods (listed below) are missing bodies. Write the code so it works correctly. You should submit one file, LinkedList.java. Do not change the interfaces. Do not change the public method headers. Do not rename the LinkedList class. None of your methods...
Activity 2. Complete the code inside the Java file below, ListUtil.java, such that this class supplies a utility method to reverse the entries in a linked list. Then, test your code using the tester class, Reverse Tester.java, given below. ListUtil.java import java.util.LinkedList; /** This class supplies a utility method to reverse the entries in a linked list. */ public class ListUtil { /** Reverses the elements in a linked list @param strings the linked list to reverse public static void...
Consider java for fixing this code please: what i need is to insert method to be added ( please don't change the test class and any giving value in the first class ) here is the correct out put: ------------------testAddLast()---- {A} {A->B} {A->B->null} {A->B->null->C} ----------------------------- --------testSubListOfSmallerValues()---------- {} {B->B->B->A} {F->B->B->B->A->D} {F->B->B->G->B->A->M->D} ----------------------------- ------------Test lastIndexOf()----- -1 3 -1 -1 0 5 2 ----------------------------- ---------testRetainAll()--------- {} {6:Tony->6:Tony} {null->bad->null} ----------------------------- ---------------Test removeStartingAtBack--- false true {apple->null->bad->null} true {apple->null->bad} {2:Morning->3:Abby->4:Tim->5:Tom->6:Tony} ----------------------------- ---------test insertionSort()--------- {} {D} {D->E->E->F->G}...
JAVA LANG PLEASE: I have follwed these below guidelines but when i run my queue test it is not executing but my stack is working fine, can you fix it please! MyQueue.java Implement a queue using the MyStack.java implementation as your data structure. In other words, your instance variable to hold the queue items will be a MyStack class. enqueue(String item): inserts item into the queue dequeue(): returns and deletes the first element in the queue isEmpty(): returns true or false...
please help!!!! JAVA I done the project expect one part but I still give you all the detail that you needed... and I will post my code please help me fix the CreateGrid() part in main and make GUI works List Type Data Structures Overview : You will be implementing my version of a linked list. This is a linked list which has possible sublists descending from each node. These sublists are used to group together all nodes which...
starter code To write a program using the starter code which is TestLinkedList to see if the LinkedList program has bugs. It will produce ether a pass or fail.More information is in the first two pictures. LinkedList.java /** * @author someone * * Implements a double-linked list with four errors */ public class LinkedList<E> { // The first and last nodes in the list private Node<E> head, tail; // Number of items stored in the list private int size; //...
Prelab Exercises Your task is to write a Java program that will print out the following message (including the row of equal marks): Computer Science, Yes!!!! ========================= An outline of the program is below. Complete it as follows: a. In the documentation at the top, fill in the name of the file the program would be saved in and a brief description of what the program does. b. Add the code for the main method to do the printing. //...
For this assignment, you will write a program to work with Huffman encoding. Huffman code is an optimal prefix code, which means no code is the prefix of another code. Most of the code is included. You will need to extend the code to complete three additional methods. In particular, code to actually build the Huffman tree is provided. It uses a data file containing the frequency of occurrence of characters. You will write the following three methods in the...
Here is my code to put a quote down, flip it, and reverse it. I do not have much knowledge on coding. Does my code only use Variables, Console I/O, Java Program Design, Intro to IDEs, If Statements, Selection and Conditional Logic, Strings, Loops, Nesting, and Iteration? If not, could it be fixed to only use them? These are the offical steps of the assignment: - Ask a user to enter a quote - whether it's several sentences or a...