Here is the IntegerLinkedList_incomplete class:
public class IntegerLinkedList {
static class Node {
/** The element stored at this node */
private int element; // reference to the element stored at this node
/** A reference to the subsequent node in the list */
private Node next; // reference to the subsequent node in the list
/**
* Creates a node with the given element and next node.
*
* @param e the element to be stored
* @param n reference to a node that should follow the new node
*/
public Node(int e, Node n) {
element = e;
next = n;
}
// Accessor methods
/**
* Returns the element stored at the node.
* @return the element stored at the node
*/
public int getElement() { return element; }
/**
* Returns the node that follows this one (or null if no such node).
* @return the following node
*/
public Node getNext() { return next; }
// Modifier methods
/**
* Sets the node's next reference to point to Node n.
* @param n the node that should follow this one
*/
public void setNext(Node n) { next = n; }
} //----------- end of nested Node class -----------
// instance variables of the SinglyLinkedList
/** The head node of the list */
private Node head = null; // head node of the list (or null if empty)
/** The last node of the list */
private Node tail = null; // last node of the list (or null if empty)
/** Number of nodes in the list */
private int size = 0; // number of nodes in the list
public Node getHead() { return head; }
public Node getTail() { return tail; }
public int getSize() { return size; }
public void setHead(Node h) { head = h; }
public void setTail(Node t) { tail = t; }
public void setSize(int s) { size = s; }
/** Constructs an initially empty list. */
public IntegerLinkedList() { } // constructs an initially empty list
// access methods
/**
* Returns the number of elements in the linked list.
* @return number of elements in the linked list
*/
public int size() { return size; }
/**
* Tests whether the linked list is empty.
* @return true if the linked list is empty, false otherwise
*/
public boolean isEmpty() { return size == 0; }
/**
* Returns (but does not remove) the first element of the list
* @return element at the front of the list (or -1000000 if empty)
*/
public int first() { // returns (but does not remove) the first element
if (isEmpty()) return -1000000;
return head.getElement();
}
/**
* Returns (but does not remove) the last element of the list.
* @return element at the end of the list (or -1000000 if empty)
*/
public int last() { // returns (but does not remove) the last element
if (isEmpty()) return -1000000;
return tail.getElement();
}
// update methods
/**
* Adds an element to the front of the list.
* @param e the new element to add
*/
public void addFirst(int e) { // adds element e to the front of the list
head = new Node(e, head); // create and link a new node
if (size == 0)
tail = head; // special case: new node becomes tail also
size++;
}
/**
* Adds an element to the end of the list.
* @param e the new element to add
*/
public void addLast(int e) { // adds element e to the end of the list
Node newest = new Node(e, null); // node will eventually be the tail
if (isEmpty())
head = newest; // special case: previously empty list
else
tail.setNext(newest); // new node after existing tail
tail = newest; // new node becomes the tail
size++;
}
/**
* Removes and returns the first element of the list.
* @return the removed element (or -1000000 if empty)
*/
public int removeFirst() { // removes and returns the first element
if (isEmpty()) return -1000000; // nothing to remove
int answer = head.getElement();
head = head.getNext(); // will become null if list had only one node
size--;
if (size == 0)
tail = null; // special case as list is now empty
return answer;
}
/**
* Removes the node pointed to by r
* @param r: pointer to the node to be removed
* @return: the int element of the removed node
*/
public int removeNode(Node r) {
if (isEmpty()) return -1000000;
Node current = head;
Node previous = current;
while ((current != null) && (current != r)) {
previous = current;
current = current.getNext();
}
if (current == null) return -1000000;
previous.next = current.getNext();
size--;
if (size == 0)
tail = null;
return current.getElement();
}
/**
* Prints the elements in the given linked list
* @param head: head of a linked list
*/
public static void printList(Node head) {
Node current = head;
while (current != null) {
System.out.print(current.getElement() + " ");
current = current.getNext();
}
}
public IntegerLinkedList copyList() {
IntegerLinkedList other = new IntegerLinkedList();
if (size > 0) { // we need independent chain of nodes
other.head = new Node(head.getElement(), null);
int s = other.getSize();
s++;
other.setSize(s);
Node walk = head.getNext(); // walk through remainder of original list
Node otherTail = other.head; // remember most recently created node
while (walk != null) { // make a new node storing same element
Node newest = new Node(walk.getElement(), null);
otherTail.setNext(newest); // link previous node to this one
s = other.getSize();
s++;
other.setSize(s);
otherTail = newest;
walk = walk.getNext();
}
}
return other;
}
/**
* Reverses the order of first n elements in the give linked list recursively
* @param list: IntegerLinkedList
* @param n: 1 <= n <= size of the list
* @return: a Node type; exactly what should be returned (or nothing is returned) must be determined by students
* in the context of their recursive algorithm; refer to the assignment
*/
public static Node reverseFirstN(IntegerLinkedList list, int n) {
// complete this method
// this method must be a recursive method
}
}
Here is the Hw4_Part3 class:
public class Hw4_Part3 {
public static void main(String[] args) {
IntegerLinkedList intList = new IntegerLinkedList();
for (int i=1; i<=10; i++) {
intList.addLast(i*10);
}
System.out.println("Original list: ");
IntegerLinkedList.printList(intList.getHead());
System.out.println();
// make a copy and use it for testing
IntegerLinkedList intListCopy = new IntegerLinkedList();
intListCopy = intList.copyList();
int N = 2;
IntegerLinkedList.reverseFirstN(intListCopy, N);
System.out.println("\nAfter reversing first " + N + " elements: ");
IntegerLinkedList.printList(intListCopy.getHead());
System.out.println();
intListCopy = intList.copyList();
N = 4;
IntegerLinkedList.reverseFirstN(intListCopy, N);
System.out.println("\nAfter reversing first " + N + " elements: ");
IntegerLinkedList.printList(intListCopy.getHead());
System.out.println();
intListCopy = intList.copyList();
N = 8;
IntegerLinkedList.reverseFirstN(intListCopy, N);
System.out.println("\nAfter reversing first " + N + " elements: ");
IntegerLinkedList.printList(intListCopy.getHead());
System.out.println();
}
}Homework Answers
/* package whatever; // don't place package name! */
import java.util.*;
import java.lang.*;
import java.io.*;
/* Name of the class has to be "Main" only if the class is public. */
public class Hw4_Part3 {
public static void main(String[] args) {
IntegerLinkedList intList = new IntegerLinkedList();
for (int i=1; i<=10; i++) {
intList.addLast(i*10);
}
System.out.println("Original list: ");
IntegerLinkedList.printList(intList.getHead());
System.out.println();
// make a copy and use it for testing
IntegerLinkedList intListCopy = new IntegerLinkedList();
intListCopy = intList.copyList();
int N = 2;
IntegerLinkedList.reverseFirstN(intListCopy, N);
System.out.println("\nAfter reversing first " + N + " elements: ");
IntegerLinkedList.printList(intListCopy.getHead());
System.out.println();
intListCopy = intList.copyList();
N = 4;
IntegerLinkedList.reverseFirstN(intListCopy, N);
System.out.println("\nAfter reversing first " + N + " elements: ");
IntegerLinkedList.printList(intListCopy.getHead());
System.out.println();
intListCopy = intList.copyList();
N = 8;
IntegerLinkedList.reverseFirstN(intListCopy, N);
System.out.println("\nAfter reversing first " + N + " elements: ");
IntegerLinkedList.printList(intListCopy.getHead());
System.out.println();
}
}
public class IntegerLinkedList {
static class Node {
/** The element stored at this node */
private int element; // reference to the element stored at this node
/** A reference to the subsequent node in the list */
private Node next; // reference to the subsequent node in the list
/**
* Creates a node with the given element and next node.
*
* @param e the element to be stored
* @param n reference to a node that should follow the new node
*/
public Node(int e, Node n) {
element = e;
next = n;
}
// Accessor methods
/**
* Returns the element stored at the node.
* @return the element stored at the node
*/
public int getElement() { return element; }
/**
* Returns the node that follows this one (or null if no such node).
* @return the following node
*/
public Node getNext() { return next; }
// Modifier methods
/**
* Sets the node's next reference to point to Node n.
* @param n the node that should follow this one
*/
public void setNext(Node n) { next = n; }
} //----------- end of nested Node class -----------
// instance variables of the SinglyLinkedList
/** The head node of the list */
private Node head = null; // head node of the list (or null if empty)
/** The last node of the list */
private Node tail = null; // last node of the list (or null if empty)
/** Number of nodes in the list */
private int size = 0; // number of nodes in the list
public Node getHead() { return head; }
public Node getTail() { return tail; }
public int getSize() { return size; }
public void setHead(Node h) { head = h; }
public void setTail(Node t) { tail = t; }
public void setSize(int s) { size = s; }
/** Constructs an initially empty list. */
public IntegerLinkedList() { } // constructs an initially empty list
// access methods
/**
* Returns the number of elements in the linked list.
* @return number of elements in the linked list
*/
public int size() { return size; }
/**
* Tests whether the linked list is empty.
* @return true if the linked list is empty, false otherwise
*/
public boolean isEmpty() { return size == 0; }
/**
* Returns (but does not remove) the first element of the list
* @return element at the front of the list (or -1000000 if empty)
*/
public int first() { // returns (but does not remove) the first element
if (isEmpty()) return -1000000;
return head.getElement();
}
/**
* Returns (but does not remove) the last element of the list.
* @return element at the end of the list (or -1000000 if empty)
*/
public int last() { // returns (but does not remove) the last element
if (isEmpty()) return -1000000;
return tail.getElement();
}
// update methods
/**
* Adds an element to the front of the list.
* @param e the new element to add
*/
public void addFirst(int e) { // adds element e to the front of the list
head = new Node(e, head); // create and link a new node
if (size == 0)
tail = head; // special case: new node becomes tail also
size++;
}
/**
* Adds an element to the end of the list.
* @param e the new element to add
*/
public void addLast(int e) { // adds element e to the end of the list
Node newest = new Node(e, null); // node will eventually be the tail
if (isEmpty())
head = newest; // special case: previously empty list
else
tail.setNext(newest); // new node after existing tail
tail = newest; // new node becomes the tail
size++;
}
/**
* Removes and returns the first element of the list.
* @return the removed element (or -1000000 if empty)
*/
public int removeFirst() { // removes and returns the first element
if (isEmpty()) return -1000000; // nothing to remove
int answer = head.getElement();
head = head.getNext(); // will become null if list had only one node
size--;
if (size == 0)
tail = null; // special case as list is now empty
return answer;
}
/**
* Removes the node pointed to by r
* @param r: pointer to the node to be removed
* @return: the int element of the removed node
*/
public int removeNode(Node r) {
if (isEmpty()) return -1000000;
Node current = head;
Node previous = current;
while ((current != null) && (current != r)) {
previous = current;
current = current.getNext();
}
if (current == null) return -1000000;
previous.next = current.getNext();
size--;
if (size == 0)
tail = null;
return current.getElement();
}
/**
* Prints the elements in the given linked list
* @param head: head of a linked list
*/
public static void printList(Node head) {
Node current = head;
while (current != null) {
System.out.print(current.getElement() + " ");
current = current.getNext();
}
}
public IntegerLinkedList copyList() {
IntegerLinkedList other = new IntegerLinkedList();
if (size > 0) { // we need independent chain of nodes
other.head = new Node(head.getElement(), null);
int s = other.getSize();
s++;
other.setSize(s);
Node walk = head.getNext(); // walk through remainder of original list
Node otherTail = other.head; // remember most recently created node
while (walk != null) { // make a new node storing same element
Node newest = new Node(walk.getElement(), null);
otherTail.setNext(newest); // link previous node to this one
s = other.getSize();
s++;
other.setSize(s);
otherTail = newest;
walk = walk.getNext();
}
}
return other;
}
/**
* Reverses the order of first n elements in the give linked list recursively
* @param list: IntegerLinkedList
* @param n: 1 <= n <= size of the list
* @return: a Node type; exactly what should be returned (or nothing is returned) must be determined by students
* in the context of their recursive algorithm; refer to the assignment
*/
public static void reverseFirstN(IntegerLinkedList list, int n) {
// complete this method
// this method must be a recursive method
///first travel till the element n
Node plusone;
reverseFirstNutil(list.getHead(),plusone,n);
}
public static void reverseFirstNutil(Node temp,Node plusone,int n){
if(n==1)
{
plusone=temp.getNext();
Node headf=temp;
return;
}
reverseFirstNutil(temp.getNext(),plusone,n-1);
Node q=temp.getNext();
q.next=temp;
temp.next=plusone;
// return headf;
}
}//here unable to rename file(.java). plz give correct direction
Add Answer to:
Here is the IntegerLinkedList_incomplete
class:
public class IntegerLinkedList {
static class Node {
/** The element...
Data Structures - Singly Linked Lists You will add a method swapNodes to SinglyLinkedList class (below). This method should swap two nodes node1 and node2 (and not just their contents) given reference...
Data Structures - Singly Linked Lists You will add a method swapNodes to SinglyLinkedList class (below). This method should swap two nodes node1 and node2 (and not just their contents) given references only to node1 and node2. The new method should check if node1 and node2 are the same node, etc. Write the main method to test the swapNodes method. You may need to traverse the list. package linkedlists; public class SinglyLinkedList<E> implements Cloneable { // ---------------- nested Node class...
Q1: You can find a file that defines the CircularlyLinked List class similar to what we...
Q1: You can find a file that defines the CircularlyLinked List class similar to what we discussed in the class. Download the file and work on it. Your task is to: 1. Complete the missing methods in the file as discussed in the class. Search for the comment/" MISSING / in the file to see the methods that need to be completed. 2. Add the following methods to the class a. public Node getMin 1. Task: find the node with...
Question: SWAPPING NODES IN A SINGULARLY LINKED LIST: I am attempting to create a program that...
Question: SWAPPING NODES IN A SINGULARLY LINKED LIST: I am attempting to create a program that swaps 2 nodes (no matter where they are in the list) and am having some difficulty. I can't seem to figure out why this swap method is throwing an error. Code: (SWAPPING METHOD AND TEST LINE BOLDED) package linkedlists; public class SinglyLinkedList<E> implements Cloneable { //---------------- nested Node class ---------------- /** * Node of a singly linked list, which stores a reference to its...
could somone please help me to complete this ! public class MyLinkedList<AnyType> { private Node<AnyType> head,...
could somone please help me to complete this ! public class MyLinkedList<AnyType> { private Node<AnyType> head, tail; private int size; public MyLinkedList() { this.head = null; this.tail = null; this.size = 0; } //1.Insert a node at the end of the list public void insert(AnyType data) { Node<AnyType> newNode = new Node(); newNode.data = data; if (head == null) { head = newNode; tail = newNode; head.next = null; tail.next = null; } else { tail.next = newNode; tail =...
(1) Implement the countKey(T element) method, which should return a count of the number of times...
(1) Implement the countKey(T element) method, which should return a count of the number of times that the given key (the element) is found in the list. (2) Implement the indexOf(T element) method, which is similar as the indexOf method in the String class. It returns the index (the position starting from the head node) of the first occurrence of the given element, or -1, if the element does not occur in the list. You will need to track the...
Java help: Please help complete the locate method that is in bold.. public class LinkedDoubleEndedList implements...
Java help: Please help complete the locate method that is in bold.. public class LinkedDoubleEndedList implements DoubleEndedList { private Node front; // first node in list private Node rear; // last node in list private int size; // number of elements in list ////////////////////////////////////////////////// // YOU MUST IMPLEMENT THE LOCATE METHOD BELOW // ////////////////////////////////////////////////// /** * Returns the position of the node containing the given value, where * the front node is at position zero and the rear node is...
Given a singly-linked list interface and linked list node class, implement the singly-linked list which has...
Given a singly-linked list interface and linked list node class, implement the singly-linked list which has the following methods in Java: 1. Implement 3 add() methods. One will add to the front (must be O(1)), one will add to the back (must be O(1)), and one will add anywhere in the list according to given index (must be O(1) for index 0 and O(n) for all other indices). They are: void addAtIndex(int index, T data), void addToFront(T data), void addToBack(T...
Write a method with signature "concatenate(LinkedQueue<E> Q2)" for the LinkedQueue<E> class that takes all elements of...
Write a method with signature "concatenate(LinkedQueue<E> Q2)" for the LinkedQueue<E> class that takes all elements of Q2 and appends them to the end of the original queue. The operation should run in O(1) time and should result in Q2 being an empty queue. Write the necessary code to test the method.You may just modify the SinglyLinkedList class to add necessary support. LinkedQueue Class public class LinkedQueue<E> implements Queue<E> { /** The primary storage for elements of the queue */ private...
Problem 2: based on java.util.LinkedList class, create MyStack class that should have the methods: push(), pop(),...
Problem 2: based on java.util.LinkedList class, create MyStack class that should have the methods: push(), pop(), peek(), size(), isEmpty(). my linkedlist class is: public class Lab8_problem1 { private Node head, tail; private int size; public Lab8_problem1() { this.head = null; this.tail = null; this.size = 0; } //Insert a node at specifc Location public void insertAt(int value, int index) { Node newNode = new Node(); newNode.data = value; if(head == null){ head = newNode; tail = newNode; head.next...
//LinkedList import java.util.Scanner; public class PoD { public static void main( String [] args )...
//LinkedList
import java.util.Scanner;
public class PoD
{
public static void main( String [] args )
{
Scanner in = new Scanner( System.in );
LinkedList teamList = new LinkedList();
final int TEAM_SIZE = Integer.valueOf(in.nextLine());
for (int i=0; i<TEAM_SIZE; i++)
{
String newTeamMember = in.nextLine();
teamList.append(newTeamMember);
}
while (in.hasNext())
{
String removeMember = in.nextLine();
teamList.remove(removeMember);
}
System.out.println("FINAL TEAM:");
System.out.println(teamList);
in.close();
System.out.print("END OF OUTPUT");
}
}
===========================================================================================
//PoD
import java.util.NoSuchElementException;
/**
* A listnked list is a sequence of nodes with...
Q1: You can find a file that defines the CircularlyLinked List class similar to what we discussed in the class. Download the file and work on it. Your task is to: 1. Complete the missing methods in the file as discussed in the class. Search for the comment/" MISSING / in the file to see the methods that need to be completed. 2. Add the following methods to the class a. public Node getMin 1. Task: find the node with...
//LinkedList
import java.util.Scanner;
public class PoD
{
public static void main( String [] args )
{
Scanner in = new Scanner( System.in );
LinkedList teamList = new LinkedList();
final int TEAM_SIZE = Integer.valueOf(in.nextLine());
for (int i=0; i<TEAM_SIZE; i++)
{
String newTeamMember = in.nextLine();
teamList.append(newTeamMember);
}
while (in.hasNext())
{
String removeMember = in.nextLine();
teamList.remove(removeMember);
}
System.out.println("FINAL TEAM:");
System.out.println(teamList);
in.close();
System.out.print("END OF OUTPUT");
}
}
===========================================================================================
//PoD
import java.util.NoSuchElementException;
/**
* A listnked list is a sequence of nodes with...
Most questions answered within 3 hours.
-
Where is the error in this code sequence?
String s1 = "Hello";
String s2 = "ello";...
asked 10 months ago -
Financial data for Joel de Paris, Inc., for last year
follow:
Joel de Paris, Inc.
Balance...
asked 10 months ago -
Consider this reaction:
Al2(SO4)3 (aq)+ BaCl3
(aq) Al2Cl6 (aq)- +
3BaSO4(s) . What is the...
asked 10 months ago -
Suppose that Savneet is considering increasing her
recent random sample from 20 car rentals to 40...
asked 10 months ago -
Trucks arrive at an unloading terminal at an average rate of 120
per hour.
Trucks arrive...
asked 10 months ago -
Why are methanol and ethanol completely soluble in water while
octanol is not very little soluble....
asked 10 months ago -
A facilities manager at a university reads in a research report
that the mean amount of...
asked 10 months ago -
When the CuSO4 is rehydrated by adding water to the anhydrous
compound, is this an endothermic...
asked 10 months ago -
A ray of sunlight is passing from diamond into crown glass; the
angle of incidence is...
asked 10 months ago -
A block of mass 0.249 kg is placed on top of a light, vertical
spring of...
asked 10 months ago -
how do the kidneys compensate in the presences of acidosis
a) trigger hyperventilate
b) reserve acid...
asked 10 months ago -
Question 501 pts
The rental rate of capital to the firm increases. Which of the
following...
asked 10 months ago