Write a method that takes a generic java.util.Queue and an item of type E, and returns a Queue identical to the original queue, but with all occurrences of item moved to the front of the queue. You may use any method of the java.util.LinkedList and java.util.Stack classes and java.util.Queue interface. You may assume that there is an equals method for type E. You must preserve the original queue. For instance, using Integers with item = 7, 10-5-7-4-7-5-9-7 becomes 7-7-7-10-5-4-5-9 The signature of this method is public static Queue moveToFront ( Queue q, E item )

Write a method that takes a generic java.util.Queue and an item of type E, and returns a Queue identical to the original queue, but with all occurrences of item moved to the front of the queue. You may use any method of the java.util.LinkedList and java.util.Stack classes and java.util.Queue interface. You may assume that there is an equals method for type E. You must preserve the original queue. For instance, using Integers with item = 7, 10-5-7-4-7-5-9-7 becomes 7-7-7-10-5-4-5-9 The signature of this method is public static Queue moveToFront ( Queue q, E item )

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

Apply the methods in the ListIterator interface to write a Java program in NetBeans that creates a LinkedList of four elements of type string, namely: Java, C#, PHP and Python.The program should then print out the elements initially in the original order, and then afterwards in reverse order using the ListIterator methods. In this case, the following is the expected output: Run: original order of strings: Java C# PHP Python Reverse order of strings: Python PHP C#Java BUILD SUCCESSFUL
Create a new Java class in a file named "ListPQ.java" that implements the Queue interface and uses the LinkedList provided by the JCF to implement a priority queue. Note that LinkedList does not automatically order values based on priority, so it will be up to you to make sure that values are removed in priority order. You should try to implement your priority queue as efficiently as possible - basic operations should run in constant or linear time. Your priority queue need only work with integers. Do not modify any of the provided code. //This is ArrayHeap (provided code) import java.util.Arrays; public class ArrayHeap implements Heap { private int[ ] array; private int size; public ArrayHeap() { array = new int[3]; size = 0; } @Override public void add(int value) { // add pt 1 if(size == array.length) { array = Arrays.copyOf(array, size*2); } array[size] = value; // sifting up int child = size; int parent = (child - 1) / 2; while(array[parent] > array[child]) { swap(parent,…
Apply the methods in the ListIterator interface to write a Java program in NetBeans that creates a LinkedList of four elements of type string, namely: Java, C#, PHP and Python.The program should then print out the elements initially in the original order, and then afterwards in reverse order using the ListIterator methods. In this case, the following(attached) is the expected output:
in java Write a method for the Linked Based List class which returns the largest item in the list. If the list is empty return null. Assume that class T is Comparable.DO NOT USE ANY OTHER METHODS OF THE LINKED BASED LIST CLASS. What is the worst case and best case complexity of the code in the previous problem? Explain your answer.
Java help!! Consider the generic singly linked list as defined in class via interface GenericList<T> with implementing classes ElementNode<T> and EmptyNode<T>. Code available on GitHub (Links to an external site.). Implement the method GenericList<T> subList(int start, int end) for this list. The method takes a starting index start and ending index end. The item at start should be included in the resulting list, along with all items up to but not including the item at end. List items are numbered from 0. If start and end are equal, the returned list is empty. Be sure to appropriately handle all invalid inputs. Document all error handling appropriately. subList() does not mutate the underlying list; it returns a new list. You may define an additional method or methods on GenericList<T> as part of your solution if you need to. Do not use loops; your solution must be recursive. For this question, no need to do anything with ListADT/ListADTImpl -- just the…
Your task is to: Implement the LinkedList interface ( fill out the implementation shell). Put your implementation through its paces by exercising each of the methods in the test harness. Create a client ( a class with a main ) ‘StagBusClient’ which builds a bus route by performing the following operations on your linked list: - Create (insert) 4 stations - List the stations - Check if a station is in the list (print result). Check for a station that exists, and one that doesn’t - Remove a station. List the stations - Add a station before another station. List the stations - Add a station after another station. Print the stations LinkedList.java package linkedList; public interface LinkedList { public Boolean isItemInList(String thisItem); // true if it is, false if not public Boolean addItem(String thisItem); // true if added, false if it was already there, or an error public Integer itemCount(); public void listItems(); public Boolean deleteItem(String thisItem); // true if deleted,…
Your task is to: Implement the LinkedList interface ( fill out the implementation shell). Put your implementation through its paces by exercising each of the methods in the test harness. Create a client ( a class with a main ) ‘StagBusClient’ which builds a bus route by performing the following operations on your linked list: - Create (insert) 4 stations - List the stations - Check if a station is in the list (print result). Check for a station that exists, and one that doesn’t - Remove a station. List the stations - Add a station before another station. List the stations - Add a station after another station. Print the stations StagBusClient.java package app; import linkedList.LinkedList; import linkedList.LinkedListImpl; public class StagBusClient { public static void main(String[] args) { // create implementation, then System.out.println("-----L I S T T E S T------"); } } LinkedList.java package linkedList; public interface LinkedList { public Boolean isItemInList(String…
Apply the methods in the ListIterator interface to write a Java program in NetBeans that creates a LinkedList of four elements of type string, namely: Java, C#, PHP and Python.The program should then print out the elements initially in the original order, and then afterwards in reverse order using the ListIterator methods.
Write a method called changeQueue to be considered inside the ArrayQueue class and has one parameter item of type E. Your method will change the queue in such a way that if the the first element of the queue and the last element of the queue are equal, the first and last elements in the queue will be replaced with item, otherwise, do not do any change. Similarly, the same process is done for the second element in the queue and the element before the last in the queue and so on. Assume you have a non-empty queue with even number of elements. You are not allowed to call any method from the the ArrayQueue. class. Do not use iterators. Method head: public void changeQueue(E item) Examplet: Before run: front rear "this" queue: 10 29 2 25 10 Item1: 100 After run: front rear "this" queue: 100 29 100 100 5 100 Use the editor to format your answer
Write a method called changeQueue to be considered inside the ArrayQueue class and has one parameter item of type E. Your method will change the queue in such a way that if the the first element of the queue and the last element of the queue are equal, the first and last elements in the queue will be replaced with item, otherwise, do not do any change. Similarly, the same process is done for the second element in the queue and the element before the last in the queue and so on. Assume you have a non-empty queue with even number of elements. You are not allowed to call any method from the the ArrayQueue class. Do not use iterators. Method head: public void changeQueue(E item) Example1: Before run: front rear "this" queue: 10 29 2 2 5 10 Item1: 100 After run: front rear "this" queue: 100 29 100 100 5 100
1. Can you "pop" from a queue -- in other words, is there any reason why you couldn't just copy over the method (after modifying it for generics) to use it in the queue class? 2. Look at the pre-condition and post-condition for nextInt (reproduced below): private int nextIndex(int i) // Precondition: 0 <= i and i < data.length // Postcondition: If i+1 is data.length, // then the return value is zero; otherwise // the return value is i+1.Explain them, including answers to the following in your response : What method uses nextIndex( )? Why is the precondition necessary? Why does the behavior described postcondition make sense? import java.util.EmptyStackException; public class ArrayStack implements Cloneable{private int[ ] data;private int manyItems; public ArrayStack( ){final int INITIAL_CAPACITY = 10;manyItems = 0;data = (int[]) new int[INITIAL_CAPACITY];} public ArrayStack(int initialCapacity){if (initialCapacity < 0)throw new…
Suppose we want to extend the PositionalList ADT with a method, indexOf(p), that returns the current index of the element stored at position p. Write this method using only other methods of the PositionalList interface (not details of our LinkedPositionalList implementation). Write the necessary code to test the method. Hint: Count the steps while traversing the list until encountering position p public interface PositionalList<E> extends Iterable<E> { int size(); boolean isEmpty(); Position<E> first(); Position<E> last(); Position<E> before(Position<E> p) throws IllegalArgumentException; Position<E> after(Position<E> p) throws IllegalArgumentException; Position<E> addFirst(E e); Position<E> addLast(E e); Position<E> addBefore(Position<E> p, E e) throws IllegalArgumentException; Position<E> addAfter(Position<E> p, E e) throws IllegalArgumentException; E set(Position<E> p, E e) throws…