Assume that the following method is in a class called DLL (not same as KWLinkedList). What does this method do? public void method_LI(). KWLinkedList list = new KWLinkedList( ); list.add(2); list.add(-1); list.add(0); list.add(1); list.add(0); Listiterator iter = list.listlterator(); while(iter.hasNext() if (iter.next() == 0) iter.remove(); if( iter.hasPrevious() ) System.out.printIn("END"); else while(iter.hasNext()) System.out.print(iter.next() + " ");

Assume that the following method is in a class called DLL (not same as KWLinkedList). What does this method do? public void method_LI(). KWLinkedList list = new KWLinkedList( ); list.add(2); list.add(-1); list.add(0); list.add(1); list.add(0); Listiterator iter = list.listlterator(); while(iter.hasNext() if (iter.next() == 0) iter.remove(); if( iter.hasPrevious() ) System.out.printIn("END"); else while(iter.hasNext()) System.out.print(iter.next() + " ");

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

If myList is a declared ADT list and the front of the list is on the left, what does the method getEntry(3) return after applying the following pseudo code? myList.add("horse")myList.add("goat")myList.add(1, "fish")myList.add("cat")myList.add(2, "dog")myList.remove(4)goatdoghorsecat
1- A new static method with one parameter which is a head node for a linked list of integers, the method should create a new linked list which is equivalent to the original list of integers but with all repetitions removed, the method's return value is a head reference for the new list. this is what I have but it's not removing repetitions. public static IntLinkedBag removeRepetition (IntLinkedBag b1) { IntNode next; IntNode head = null; LinkedList<Integer> s = new LinkedList<>(); IntNode new_list = new IntNode(0, null); IntNode now = head; IntNode prev = new_list; while (now!= null) { int x = now.data; if (s.contains(x)) { new_list = new_list.next; } else { s.add(x); new_list.next = new IntNode(x, now); new_list = new_list.next; } now = now.next; } return b1; } }…
Assume that the following method is within the KWLinkedList class, what does this method do? public boolean undefined(E item) { if(head == null) return false; Node<E> p = head.next; Node<E> newNode= new Node<E>(item, p); newNode.prev = head; head.next = newNode; p.prev = newNode; size++; return true; } nserts a new node with its data as item at the front of the list. Inserts a new node with its data as item after the first node of the list. Deletes the node with its data as item. Inserts a new node with its data as item, at the end of the list.
Design and implement a getLastHalf() method for the MyLinkedList class. The method should return the last half of the list as a new list leaving the original list intact. If the list has an uneven number of elements the extra one element must be in the list returned. Example : [1,3,5,4] return [5,4] and [1,6,9] return [6,9]. Follow the three step method for designing the method Develop the java code for the method Create a test program to test the method thoroughly using the Integer wrapper class.
Design and implement a getLastHalf() method for the MyLinkedList class. The method should return the last half of the list as a new list leaving the original list intact. If the list has an uneven number of elements the extra one element must be in the list returned. Example : [1,3,5,4] return [5,4] and [1,6,9] return [6,9]. Follow the three step method for designing the method Develop the java code for the method Create a test program to test the method thoroughly using the Integer wrapper class. public class MyLinkedList<E> { private Node<E> head, tail; public MyLinkedList() { head = null; tail = null; } /** Return the head element in the list */ public E getFirst() { if (head == null) { return null; } else { return head.element; } } /** Return the last element in the list */ public E getLast() { if (head==null) { return null; } else { return tail.element; } } /** Add an element to the beginning of the list */ public void prepend(E e) { Node<E> newNode = new…
Question 5 Assume that the following method is in a class called DLL (not same as KWLinkedList). What does this method do? public void method_LI( ) { KWLinkedList<Integer> list = new KWLinkedList<Integer>( ); list.add(2); list.add(-1); list.add(0); list.add(1); list.add(0); ListIterator<integer> iter = list.listIterator(); while(iter.hasNext()) { if (iter.next() == 0) iter.remove(); } if( iter.hasPrevious() ) System.out.println("END"); else while(iter.hasNext()) System.out.print(iter.next() + " "); } Removes the nodes having 0 as its data and prints END. Removes the nodes having 0 as its data and prints 2 -1 1 Removes the nodes having 0 as its data and prints 1 -1 2 Prints 2 -1 0 1 0 without removing anything.
Assume that the following method is added to the class KWLinkedList. What does this method do? public boolean question() { if (size%2 == 1 || size < 2) return false; Node<E> h = head; for(int i = 0; i < size/2; i++) h=h.next; Node<E> p = head; while (h!= null) { if (! p.data.equals(h.data)) return false; p = p.next; h = h.next; } return true; } Compare the elements of the first half of the list with the second half, if any one node has the same data value, it will return false, else it will return true. Compare the elements of the first half of the list with the second half, if all the nodes have the same data values, it will return true else, it will return false. Compare the elements of the first half of the list with the second half, if all the nodes have the same data values, it will return false else, it will return true…
Assume the following method is within the KWLinkedList class, what does the following method do? public boolean undefined( ) { ListIterator<E> iter1 = iterator( ); ListIterator<E> iter2 = iterator(size - 1); if (Iter1.hasNext() && iter2.hasPrevious()) { if( iter1.next().equals (iter2.previous()) return true; else return false; } } If the last two elements of the list are equal, then the method will return true, else it will return false. If the first element of the list is same as the last element of the list, then the method will return true else it will return false. If the list is same in the forward and reverse direction, then the method will return true, else it will return false. If the first two elements of the list are equal, then the method will return true, else it will return false.
Given the IntNode class, define the getCount() method in the CustomLinkedList class that returns the number of items in the list not including the head node. Ex: If the list contains: head -> 14 -> 19 -> 4 getCount(headObj) returns 3. Ex: If the list contains: head -> getCount(headObj) returns 0. public class IntNode { private int dataVal; // Node data private IntNode nextNodePtr; // Reference to the next node // Default constructor public IntNode() { dataVal = 0; nextNodePtr = null; } // Constructor public IntNode(int dataInit) { this.dataVal = dataInit; this.nextNodePtr = null; } // Constructor public IntNode(int dataInit, IntNode nextLoc) { this.dataVal = dataInit; this.nextNodePtr = nextLoc; } /* Insert node after this node. Before: this -- next After: this -- node -- next */ public void insertAfter(IntNode nodeLoc) { IntNode tmpNext; tmpNext = this.nextNodePtr;…
Write a method called removeLeastNumber in the class WLinkedList (a class for doubly linked list as discussed in the lectures). The method will search for the smallest integer in the double linked list and removes the node that contains that value. Assume that the list must contain at least two nodes. Assume further that the smallest value never be in the first node. Do not use Iterators and you are not allowed to call any of the KWLinkedList class methods. Method heading: public void removeLeastValue() Example: list (before method call): 7 10 2 3 5 3 9 list (after method call): 7 10 3 5 3 9
Given the MileageTrackerNode class, complete main() in the MileageTrackerLinkedList class to insert nodes into a linked list (using the insertAfter() method). The first user-input value is the number of nodes in the linked list. Use the printNodeData() method to print the entire linked list. DO NOT print the dummy head node. Ex. If the input is: 3 2.2 7/2/18 3.2 7/7/18 4.5 7/16/18 the output is: 2.2, 7/2/18 3.2, 7/7/18 4.5, 7/16/18 public class MileageTrackerNode { private double miles; // Node data private String date; // Node data private MileageTrackerNode nextNodeRef; // Reference to the next node public MileageTrackerNode() { miles = 0.0; date = ""; nextNodeRef = null; } // Constructor public MileageTrackerNode(double milesInit, String dateInit) { this.miles =…
Given that values is of type LLNode<Integer> and references a linked list (possibly empty) of Integer objects, what does the following code do if invoked as mystery(values)? int mystery(LLNode<Integer> list) { if (list == null) return 0; else return list.getInfo() + mystery(list.getLink()); } A.returns how many numbers are on the values list. B. returns sum of the numbers on the values list. C. returns 0 D. returns the last number on the values list