Ask the person who worked on my order 50013 if they are available to do this order. If not then any...

Question

Ask the person who worked on my order 50013 if they are available to do this order. If not then any other person.

Follow the instruction in the word document in the zip file to do assignment 3

Basically you're using code from my assignment 2 (in the zip folder) and code from lecture_code_6(also in the zip folder) to complete assignment 3. Follow the word document to complete assignment 3

assignment3-rciloybk.zip

Abhishek · Accepted Answer

51551 - Linked Bag/Screenshots/O1.png
 51551 - Linked Bag/Problem/assignment_3/Assignment-03-Feb22.docx
Objective  
In this assignment, you are asked to implement a bag collection using a linked list and the collection is to store only one type of Thing of your choice.  
Important: you can NOT use the LinkedList class from the Java library, instead, you have to implement your own linked list as explained below.  
Use assignment_2 and lecture_code_6 from the zip folder to finish assignment_3 with the classes already started
Requirements 
 In order to complete this project, you need to implement the following classes. The details of each class is explained below. 
 Thing: you must use the same Thing that you used for the Assignment 2. But make sure to look for the requirements below and change your previous implementation as necessary. 
· ThingNode: a linked list node where the data part is of type Thing. 
· ThingLinkedBag: a collection of Things in which the elements are stored in a linked list. 
· ThinsLinkedBagIterator: an iterator class that is used to iterate over a linked list. Note that this is NOT an inner class. 
· ThingLinkedBagDriver: a Java class that includes only a main method to test the functionality of your collection.
class Thing  
 Use the same Thing class that you used in Assignment 2 but make sure all the following requirements are met. Basically, your Thing class must have the following:
· has exactly 2 instance variables such that: 
· one instance variable of type String and this variable will be used as a search key. 
· one instance variable of type integer (i.e, int) and this variable will be used to find aggregate information about Things that are stored in a collection class as will be explained later. 
· An implementation of toString method that returns a one-line representation of the 
Thing. 
· Implement equals methods to test the equality of two things.  
· Implement Comparable interface and include compareTo method.  
class ThingNode 
 This class represents a node in the linked list. The node class should include the following:
· two private instance variables: 
· data of type Thing. It is required that the data part to be of a specific Thing type. Do not use a generic node. 
· link of type ThingNode.  
· a constructor that takes two input parameters and use them to initialize the two instance variables. 
· The following instance methods which are the same as in the IntNode class that we discussed in class and also is discussed in the text book (Chapter 4, Section 4.2). You have to change the methods as appropriate to reflect your new type of data. 
· getData, getLink, setData, setLink, addNodeAfter, removeNodeAfter. 
· The following static methods that are the same as IntNode class. You have to change the methods as appropriate. o display, listPosition, listLength,and listSearch.
class ThingLinkedBag 
 The requirements of the ThingLinkedBag class are as follows: 
· two instance variables: 
· head of type ThingNode: this represent the head of the linked list that stores your collection. 
· manyItems of type int: this represent the size of the linked list. 
· Implement the following instance methods in the collection class. Note that all the method headers below are written in terms of Thing, however, your implementation should replace each Thing with your specific data type. 
1. a constructor to create an empty linked list. 
2. int size(): returns the number of nodes in the list. 
3. void display(): displays the contents of the collection such that each element is displayed on one line. Note that this method displays the list on the screen and does NOT return a String representation of the list. 
4. void add(Thing element): a method to add a Thing to the collection.  
5. void add(int position, Thing element): a method to add an element at a specific position in the collection assuming the head node is at position 1. If the position is greater than the collection length, then the element is added as the last element in the collection. The method does not do anything if position is negative. 
6. void addLast(Thing  element): adding an element to be the last element in the linked list 
7. boolean remove(Thing target): this method removes one occurrence from the target from the list if any. The method returns true if an item is removed and false otherwise. 
8. boolean remove(int position): this method removes the element that is located at position position in the linked list where the head node is at position 1. The method returns true if an item is removed and false if no element is removed because position is negative or beyond the list length. 
9. void removeLast(): this method removes the last node in the linked list. 
10. int countRange(Thing start,Thing end): this method counts and returns how many element in the collection falls in the range between start and end inclusive. Note that things are compared using the compareTo method. 
11. Thing grab(int position): returns the element of the node located at position position in the list or null if position is past the end of the list. Note that this method does not remove the element from the list. 
12. int positionOf(Thing target): returns the position of the node that contains target assuming that the head node is at position 1. If the target is not found, the method return -1 and if there are more than one occurrence, then the method returns the position of the first occurrence. 
13. void set(int position, Thing element): changes the element at position position with the input element. If position is negative or beyond the length of the list, then the method does not do anything. 
14. int totalValue(): this method returns the sum of all the integer values of all things in the list  (remember that it was required that each thing has an integer attribute). 
15. ThingNode lessThan(Thing element): this method takes one Thing as input and returns an output a linked list that includes all elements that are less than or equal to the input element. Note that things are ordered based on the compareTo method. 
16. Thing getMax(): this method returns the maximum Thing in the linked list where things are ordered based on the compareTo method.
class ThingLinkedBagIterator  
 This class and it is used to iterate over your linked collection. Note that this class should be an independent class and NOT an inner class. An implementation of the linked list iterator is discussed in class Lecture7's code that is posted on D2L.  Basically, the header of your class should be as follows:
class ThingLinkedBagIterator implements Iterator
You have to change of the rest of iterator class as necessary to reflect your Thing data type.
Change your ThingLinkedBag class to implement Iterable and add the iterator method that returns an iterator of type ThingLinkedBagIterator.
class ThingLinkedBagDriver  
 Write a driver class to test ALL the methods that you implemented in the ThingNode class and the 
ThingLinkedBag class.
 51551 - Linked Bag/Problem/assignment_3/.~lock.Assignment-03-Feb22.docx#
,abhishek,abhishek-HP-Pavilion-15-Notebook-PC,04.03.2020 17:56,file:///home/abhishek/.config/libreoffice/4;
 51551 - Linked Bag/Solution/Simple Code Files/assignment3/ThingNode.java
 51551 - Linked Bag/Solution/Simple Code Files/assignment3/ThingNode.java
package assignment3;
public class ThingNode {
    private Ring data;
    private ThingNode link ;
    public ThingNode(Ring data, ThingNode link) {
        super();
        this.data = data;
        this.link = link;
    }
    public Ring getData() {
        return data;
    }
    public void setData(Ring data) {
        this.data = data;
    }
    public ThingNode getLink() {
        return link;
    }
    public void setLink(ThingNode link) {
        this.link = link;
    }
    public void addNodeAfter(Ring element){
        this.link = new ThingNode(element,this.link);
    }
    public void removeNodeAfter(){
        this.link = this.link.link;

Ask the person who worked on my order 50013 if they are available to do this order. If not then any other person. Follow the instruction in the word document in the zip file to do assignment 3...

Answer To: Ask the person who worked on my order 50013 if they are available to do this order. If not then any...

Answer To This Question Is Available To Download

Related Questions & Answers

Submit New Assignment