Design a program named SortedNameList.java, which implements a list .pdf

•

0 likes•13 views

Design a program named SortedNameList.java, which implements a list structure with linked list node (LLNode.java). Your SortedNameList ADT should have the following methods: Template: public class SortedNameList{ LLNode head; public SortedNameList(){ head=null; } public LLNode getHead(){ return head; } public boolean isEmpty(){ //return true if the list is empty, otherwise true /* Type your code here. */ } public void add(Name name){ //add name to the list, after this operation, the list should maintain sorted in ascending order /* Type your code here. */ } public void add(LLNode node){ //overloaded method: add node to the list, after this operation, the list should maintain sorted in ascending order /* Type your code here. */ } public int size(){ //return the number of nodes in the list /* Type your code here. */ return 0; // replace with yours } public boolean isFull(){ return false; } public int search(Name name){ //return index of the name (the first occurrence) in the list, return -1 if not found /* Type your code here. */ return -10; // replace with yours } public LLNode get(int index){ // return the LLNode object at the specified index location, for invalid index, return null /* Type your code here. */ return new LLNode(new Name("a","b"), null); //replace with yours } public void remove(int index){ //Remove node at the specified index location if valid. /* Type your code here. */ } public void remove(Name name){ //remove all occurences of name - please refer to Name class for details /* Type your code here. */ } public void removeAll(){ //remove all nodes } }.

Education

return 0; // replace with yours
}
public boolean isFull(){
return false;
}
public int search(Name name){
//return index of the name (the first occurrence) in the list, return -1 if not found
/* Type your code here. */
return -10; // replace with yours
}
public LLNode get(int index){
// return the LLNode object at the specified index location, for invalid index, return null
/* Type your code here. */
return new LLNode(new Name("a","b"), null); //replace with yours
}
public void remove(int index){
//Remove node at the specified index location if valid.
/* Type your code here. */
}
public void remove(Name name){
//remove all occurences of name - please refer to Name class for details
/* Type your code here. */
}
public void removeAll(){
//remove all nodes
}
}

Similar to Design a program named SortedNameList.java, which implements a list .pdf

Write the following using java Given a class ‘Node’ and ‘NodeList’, that contains the below information diagram. -id: int -name: String -next: Node +Node(id: int, name: String) +setId(id: int): void +getId(): int +setName(name: String) : void +getName(): String +setNext(node: Node): void +getNext(): Node NodeList -size: int -root: Node +add(node: Node): void +size(): int +findNode(node: Node): boolean Implement add(Node), findNode(Node) and size methods in the NodeList class which is provided to you. The methods should work as: Using the following main method: public static void main(String[] args) { NodeList list = new NodeList(); Node node = new Node(1, \"Book\"); Node node2 = new Node(2, \"Lappy\"); list.add(node); list.add(node2); System.out.println(\"Length : \"+list.size()); Node node3 = new Node(3, \"Glass\"); Node node4 = new Node(4, \"Pen\"); list.add(node3); System.out.println(\"Length : \"+list.size()); if(list.findNode(node3)) System.out.println(\"Node found: \"+ node3.getName()); else System.out.println(\"Node not found: \"+ node3.getName()); if(list.findNode(node4)) System.out.println(\"Node found: \"+ node4.getName()); else System.out.println(\"Node not found: \"+ node4.getName()); } Then it should return the following output: Length : 2 Length : 3 Node found: Glass Node not found: Pen The given Node class is: public class Node { private int id = 0; private String name = \"\"; private Node next; public Node(int id, String name) { this.id = id; this.name = name; this.next = null; } public Node getNext() { return next; } public void setNext(Node node) { this.next = node } public int getId() { return id; { public void setId(int id) { this.id = id; } public String getName() { return name; } public void setName(String name) { this.name = name; } public String toString() { return \"ID : \"+this.id+\" Name : \"+this.name; } } The given NodeList class is: public class NodeList { private int size = 0; private Node root = null; /* * It has to take a new Node and add that to the next address of previous Node. * If the list is empty, assign it as the \"root\" * @Param - Node */ public void add(Node node) { // Implement this method!!! } /* * It has to return the size of the NodeList * * @return size */ public int size() { // Implement this method!!! } /* * It has to take a Node and checks if the node is in the list. * If it finds the node, it returns true, otherwise false * * @param - Node * @return boolean true/false */ public boolean findNode(Node node) { // Implement this method!!! } }Node -id: int -name: String -next: Node +Node(id: int, name: String) +setId(id: int): void +getId(): int +setName(name: String) : void +getName(): String +setNext(node: Node): void +getNext(): Node Solution Hi, Please find my implementation. Please let me know in case of any issue. ############ Node.java ############# public class Node { private int id = 0; private String name = \"\"; private Node next; public Node(int id, String name) { this.id = id; this..

Write the following using javaGiven a class ‘Node’ and ‘NodeList’,.pdf

fathimalinks

Please help me to make a programming project I have to sue them today. Please help me make a UnsortedList and SortedList classes. The instructor give me The code of the List and AbstracList Classes that 2 pages we do not modify them. Do not modify this pages!!! List.java import java.util.Iterator; /** * Represents List interface. * * @author Varik Hoang * @version Sep 26, 2016 * @param is of any object type. */ public interface List { /** * The method returns the current number of elements in the list. * * @return the current number of elements in the list greater than or equal 0 */ public int getSize(); /** * The method returns whether the list is empty. * * @return true if list is empty, false otherwise. */ public boolean isEmpty(); /** * The method returns whether value is in the list. * * @param value the value is assigned * @return true if value in the list, false otherwise. */ public boolean contains(Type value); /** * The method inserts an element into the list. * * @param value the value is assigned */ public void insert(Type value); /** * The method clears the list. */ public void clear(); /** * The method returns a string representation of list contents. * * @return a string representation of list contents. * @see Object#toString() */ @Override public String toString(); /** * /** * The method removes first element occurrence from the list. * * @param value the value is assigned * @return the removed value */ public Type remove(Type value); /** * The method returns the index of value. * * @param value the value is assigned. * @return the index of value if in the list, -1 otherwise. */ public int getIndex(Type value); /** * The method removes value at the given index. * * @param index the index must be in range of 0 and size * @return the removed value * @throws IndexOutOfBoundsException if index less than 0 or index greater than * or equal size */ public Type removeAtIndex(int index); /** * The method replaces the value at the given index with the given value. * * @param index the index must be in range of 0 and size * @param value the value is assigned * @throws IndexOutOfBoundsException if index less 0 or index greater than size */ public void set(int index, Type value); /** * Returns the value at the given index in the list. * * @param index the index must be in range of 0 and size * @throws IndexOutOfBoundsException if index less than 0 or greater size * @return the value at the given index in the list. */ public Type get(int index); /** * The method returns an iterator for this list. * * @return an iterator for the list. */ public Iterator iterator(); } Do not modify this pages public abstract class AbstractList implements List { /** * The reference to the last element */ protected ListNode tail; /** * The size of the list */ protected int size; /** * The constructor that initiate the tail and size references */ public AbstractList() { tail = null; size = 0; } @Override public int getSize() { return size; } @Override public bool.

Please help me to make a programming project I have to sue them today- (1).pdf

seoagam1

Can somebody solve the TODO parts of the following problem. Thanks Description This assignment builds on top of the ListNode class designed and tested in Assignment 4 where constructionand testing of the ListNode class has already been done. Recall that a ListNode object contains a data field and a pointer to the next ListNode object. We now encapsulate the functions to create, search and update the database into a LinkedList class. There are two members in this class. A pointer called front that points to a ListNode object and an integer count of the total number of objects currently in the list. As before, we are not going to use pre-fabricated classes from the c++ library, but construct the LinkedList ADT from scratch. We can now use this class to create a LinkedList object which contains a collection of ListNodes each having a Song object in the data field. The api is put through its paces by initially testing it on a dummy database containing four songs. The main program then repeats the testing process with the song list in the file SongData.txt and then again with the song list in the file SongDataDouble.txt. The number of steps taken to populate the database for both files is recorded. Instruction #This assignment requires you to Read the Assignment 5 Notes Watch the Assignment 5 Support video Implement the following methods of the LinkedList class -custom constructor -setters for next pointer and data Implement the insert, remove and get method in the LinkedListcpp.h file Scan the given template to find the above //TODO and implement the code needed //Requires: Song for inserting //Effects: creates a new ListNode with input value and inserts in proper position (increasing order of chart position)in the chain. If LinkedList, adds to the beginning //Modifies: front, if node is added at the beginning. //Also changes the next pointer of the previous node to point to the newly inserted list node. the next pointer of the newly inserted pointer points to what was the next of the previous node. This way both previous and current links are adjusted //TODO template <class T> int LinkedList<T>::insert( T value, SortBy<T> f){ int steps=0; //TODO return steps; } //Requires: Song title for searching //Effects: traverses the LinkedList (database) starting from front until the end comparing titles Returns the original search value if found otherwise returns an empty song with blank title //Modifies: Nothing //TODO template <class T> T LinkedList<T>::get(T value){ ListNode<T> * current = front;//this may need to change //TODO return current->getData(); } //TODO template <class T> int LinkedList<T>::remove(T value){ //TODO int steps=0; return steps; } / /Requires: index position of Song to be found //Effects: traverses the LinkedList starting from front and travels to the index position (if valid) and returns the song at that index position. Note index position may NOT be the same as chart position //Modifies: Nothing //TODO template <class T> T Linke.

Can somebody solve the TODO parts of the following problem- Thanks D.pdf

vinaythemodel

main.cpp /* Build and procees a sorted linked list of Patient objects. The list is sorted in ascending order by name. Assume that the name is unique. */ #include <iostream> #include <iomanip> #include <fstream> #include <sstream> #include <string> #include <cctype> #include "LinkedList.h" using namespace std; void buildList(const string &filename, LinkedList &list); void deleteManager(LinkedList &list); void searchManager(const LinkedList &list); void displayManager(const LinkedList &list); int main() { string inputFileName; LinkedList list; cout << "Enter file name: "; getline(cin, inputFileName); buildList(inputFileName, list); displayManager(list); searchManager(list); deleteManager(list); displayManager(list); return 0; } /* This function reads data from a file and inserts them into a sorted linked list. The list is sorted in ascending order by name */ void buildList(const string &filename, LinkedList &list) { ifstream inFile(filename); cout << "Reading data from "" << filename << ""n"; if(!inFile) { cout << "Error opening the input file: ""<< filename << """ << endl; exit(EXIT_FAILURE); } string id; int year; string name; int amount; string line; while (getline(inFile, line)) { stringstream temp(line); temp >> id >> year; temp.ignore(); getline(temp, name, ';'); temp >> amount; // create a Sales object and initialize it with data from file /* Write your code here */ // call insert to insert this new Sales object into the sorted list /* Write your code here */ } inFile.close(); } /* Delete manager: delete items from the list until the user enters Q to quit deleting Input Parameter: list */ void deleteManager(LinkedList &list) { string target = ""; cout << " Delete" << endl; cout << "========" << endl; while(target != "Q") { cout << "Enter a name (or Q to stop deleting):" << endl; getline(cin, target); target[0] = toupper(target[0]); if(target != "Q") { if(list.deleteNode(target)) cout << target << " has been deleted!" << endl; else cout << target << " not found!" << endl; } } cout << "___________________END DELETE SECTION_____" << endl; } /* Search manager: search the list until the user enters Q to quit searching Input Parameter: list */ void searchManager(const LinkedList &list) { string target = ""; Sales obj; cout << " Search" << endl; cout << "========" << endl; /* Write your code here */ cout << "___________________END SEARCH SECTION _____" << endl; } /* Display manager: all, average, or year hired reports including header and footer where appropriate, depending on the user's choice; displays the number of nodes (always) Input Parameter: list */ void displayManager(const LinkedList &list) { // Sub-functions of displayManager() void showMenu(void); string getOption(void); void showHeader(string line); string line = "==== ==================== =============n"; string option; showMenu(); option = getOption(); while(option[0] != 'Q') { switch (option[0]) { case 'A': showHeader(line); list.displayList(); cout << line; break; case 'G': cou.

maincpp Build and procees a sorted linked list of Patie.pdf

adityastores21

Implementation The starter code includes List.java. You should not change anything in List.java. Your task will be to create LinkedList.java, make LinkedList use generics and inherit from List, and complete several methods in LinkedList.java. Create LinkedList.java in IntelliJ. Add a main method to LinkedList.java containing the following code. Your program will not compile again. public static void main(String[] args) { LinkedList list = new LinkedList(); System.out.println(list.getHead()); System.out.println(list.getTail()); list.add("first"); list.add("middle"); list.add("last"); System.out.println(list.getHead().value); System.out.println(list.getTail().value); System.out.println(list); } The first issue is that your LinkedList class does not have a way of specifying what type of data it should store. You can fix this using Java Generics. Change the first line of your class to the following: LinkedList . Confirm that the first line in your main method no longer has an error. On the line that declares the LinkedList class, add extends List before the bracket that begins the class. The first line in your class will now have a compile error because LinkedList does not implement the methods required by the List abstract class. Press Ctrl-i to have IntelliJ insert stubs of these methods. Ensure that Copy JavaDoc is selected so you get JavaDoc comments which describe the method requirements, then click OK. Your code should now compile again. Next add fields for the head and tail. These will be of type Node. Create a getHead method which returns your head field, and a getTail method which returns your tail field. Run your main method now and you will see that there is a NullPointerException because the add method does not actually add anything to the list, so head and tail will always be null. Complete the method boolean add(T value) for which IntelliJ gave you a stub. You need to create a new node with value to add at the end of the list. This means you will need to connect it to the old tail and update tail to point to the node you created. Make sure that you handle the case where the list is empty and both head and tail should be set to the new node you've created. Note: For the full Map I assignment, add will need to prevent duplicate values being added to the list and should return true or false based on whether the value was added or not. For this lab, you can ignore this requirement and simply return true. Add a toString method to your LinkedList class. It should start at the head of your list and proceed through all the nodes in a loop, combining the values of each node with a comma between each and square brackets containing the whole thing. When you run your main method, the final thing printed should be: [first, middle, last] List.java: /** * Specification for a List ADT. * @author Shubham Chatterjee * @version 03/07/2019 * @param Type */ public abstract class List { /** * Appends the specified value to the end of this list. * * @para.

Implementation The starter code includes List.java. You should not c.pdf

maheshkumar12354

you will implement some sorting algorithms for arrays and linked lists. Insertion Sort and Quicksort of an array Implement the insertion sort and quicksort for an integer array. The functions are defined in the "sorting.h" header file. /** * @brief Insertion sort algorithm * @param array Array to be sorted. The array is modified in place. * @param lowindex Lowest index of the array * @param highindex Highest index of the array * @param reversed If reversed = true, the array should be sorted in descending order, otherwise in ascending order */ void insertionSort(int array[], int lowindex, int highindex, bool reversed = false); and ** * @brief Quick sort algorithm * * @param array Array to be sorted. The array is modified in place. * @param lowindex Lowest index of the array * @param highindex Highest index of the array * @param reversed If reversed = true, the array should be sorted in descending order, otherwise in ascending order */ void quickSort(int array[], int lowindex, int highindex, bool reversed = false); The array should be sorted in place. Compared to the examples in the textbook, those functions have an additional parameter reversed. If reversed = true, the array should be sorted in descending order, otherwise in ascending order. You should complete the implementations of those two functions in the "sorting_basic.cpp" file. A better quicksort algorithm Quicksort is a very fast comparison sorting algorithm, especially wheb the array or list gets large. However, when the arrays/lists are small enough, quicksort may run slower than some of the (n^2) algorithms. This might not seem important until you note that when sorting a large array with quicksort, many small sublists must be sorted. While the savings on sorting one small list with a faster algorithm might be negligible, sorting hundreds of small lists with a faster algorithm can make a difference in the overall efficiency of the sort. For this part of the assignment, you will combine quicksort with another sorting algorithm to build a faster sorting algorithm. One option is to use quicksort until the array/list gets small enough, and then use insertion sort or another sort to sort the small arrays/lists What does "small enough" mean? You can try a percentage of the list (say, 5% or 10%), or an absolute number (5 elements, 8 elements, 10 elements, 15 elements, 100 elements, etc), or something else of your choosing. Based on your tests, choose the one that is the most efficient. You should also tests to ensure that your hybrid quicksort has reasonable performance on all lists -- most notably, it should be efficient on sorted and inverse sorted lists as well as random lists. The definition of the hybrid quicksort function is as the following: /** * @brief A hybrid of insertion sort and quick sort algorithm. The algorithm is based on the idea that if the array is short, it is better to use insertion sort. * It uses quicksort until the list gets small enough, and then uses insertion s.

you will implement some sorting algorithms for arrays and linked lis.pdf

info335653

I need to implment a function that can reverse a single linked list. Not just print it, but actually change the order of the list. THIS MUST BE DONE USING RECURSION EX: a, b, c, d -> d, c, b, a You have access to the start of the list. Code must be in C++ Solution #include using namespace std; struct node { char data; struct node* next; }; void reverse(struct node* head) { if (head == NULL) //base case return; reverse(head->next); //calling function recursively cout<data<<\",\"; } //add data to the front of the linked list void add(struct node** head_ref, char data) { //create new node struct node* newnode=new node(); //adding data newnode->data = data; //adding node to the front newnode->next = (*head_ref); //making new node head (*head_ref) = newnode; } int main() { // create linked list a, b, c, d struct node* head = NULL; add(&head, \'d\'); add(&head, \'c\'); add(&head, \'b\'); add(&head, \'a\'); reverse(head); return 0; } //OUTPUT*********** d,c,b,a, //OUTPUT*********** //This code has been tested on g++ compiler,Please ask in case of any doubt,Thanks..

I need to implment a function that can reverse a single linked list..pdf

rohit219406

you will implement some sorting algorithms for arrays and linked lis.pdf

clearvisioneyecareno

This assignment and the next (#5) involve design and development of a sequential non contiguous and dynamic datastructure called LinkedList. A linked list object is a container consisting of connected ListNode objects. As before, we are not going to use pre-fabricated classes from the c++ library, but construct the LinkedList ADT from scratch. The first step is construction and testing of the ListNode class. A ListNode object contains a data field and a pointer to the next ListNode object (note the recursive definition). #This assignment requires you to 1. Read the Assignment 4 Notes 2. Watch the Assignment 4 Support video 3. Implement the following methods of the ListNode class -custom constructor -setters for next pointer and data 4. Implement the insert and remove method in the main program 5. Scan the given template to find the above //TODO and implement the code needed //TODO in ListNodecpp.h file public: ListNode(T idata, ListNode<T> * newNext); public: void setNext(ListNode<T> * newNext); public: void setData(T newData); // TODO in main program void remove(ListNode<int> * &front,int value) void insert(ListNode<int> * &front,int value) # The driver is given ListNodeMain.cpp is given to you that does the following tests 1. Declares a pointer called front to point to a ListNode of datatype integer 2. Constructs four ListNodes with data 1,2,4 and adds them to form a linked list. 3. Inserts ListNode with data 3 to the list 4. Removes node 1 and adds it back to test removing and adding the first element 5. Removes node 3 to test removing a middle node 6. Removes node 4 to test removing the last node 7. Attempt to remove a non existent node 8. Remove all existing nodes to empty the list 9. Insert node 4 and then node 1 to test if insertions preserve order 10.Print the list Main.cpp #include <iostream> #include "ListNodecpp.h" // REMEMBER each ListNode has two parts : a data field // and an address field. The address is either null or points to the next node //in the chain //Requires: integer value for searching, address of front //Effects: traverses the list node chain starting from front until the end comparing search value with listnode getData. Returns the original search value if found, if not adds +1 to indicate not found //Modifies: Nothing int search(ListNode<int> * front, int value); //Requires: integer value for inserting, address of front //Effects: creates a new ListNode with value and inserts in proper position (increasing order)in the chain. If chain is empty, adds to the beginning //Modifies: front, if node is added at the beginning. //Also changes the next pointer of the previous node to point to the //newly inserted list node. the next pointer of the newly inserted pointer //points to what was the next of the previous node. //This way both previous and current links are adjusted //******** NOTE the use of & in passing pointer to front as parameter - // Why do you think this is needed ?********** void insert(ListNode<int> * &fr.

This assignment and the next (#5) involve design and development of a.pdf

EricvtJFraserr

There are a couple of new methods that you will be writing for this project. Some are easy, some are hard. I have provided code that tests most of the methods by calling them from the main method in the file ListTest.java. The test file will only work when you have done all the methods. In COMP182LinkedList.java I have provided the signature (definition and input parameters) for these methods. At this point to make sure you can run the file (COMP182LinkedList.java that you downloaded from Cavas) I have added template values as return types of the methods. For example, if the method returns an int then I added return 0 as the return value. Here are the methods are as follows: Anything getFixst () Anything getLast () void add (Anything value) void addafter (1nt index, Anyehtng value) Anything set(int index, Rnything aewvalue) void removeAl1 (Anything vaiue) lastIndex (Anything value) COMP182IinkedIi ateAnything; elone boolean equala (object in) CoMP182IinkedList KAnythang? gplat () boolean hascycle () Node reveraeliat () Node oddeventiat () Node deleteDuplicates () boolean ispalindrome () "For the last two methods, you need to add proper testing to ListTest Java Method Specifications Here are more details for implementing each of these methods. You need to complete all the following methods in the COMP182LinkedList class. You can write the methods in any order you wish, but I suggest you do them in the order they are listed. In particular, make sure all your methods work for empty lists, lists of different sizes, etc as you can see from the sample test cases provided in ListTest.java. While grading your project, we will make changes to these values! Also, make sure that your solutions do not modify the original lists (unless you are specifically instructed to do so). roid main(String[] args) You can use this method in the ListTest class to create lists as needed and test each of the methods listed above. I have provided a few test cases, but you may want to add more to some of the method tests. Until you get add working, you will need to use addFirst to create lists to test your other methods. Anything getFirsto This method returns the value stored in the first node an the list. It should prit an error message and seturn null if the list is empty. Anything getLasto This method returns the value stored in the last node in the list. It should print an error mesiage and retuin noll if the list is emipty. void add(Anything value) Thus method adds a nade containing new yalue to the end of the last. This method returns the value stored in the first node in the list. It should print an error message and return null if the list is empty. Anything getLast0 This method returns the value stored in the last node in the list. It should print an error message and retum null if the list is empty: void add(Anything value) This method adds a node containing new value to the end of the list. void addAfter(int index, Anything value) This method adds a node contai.

There are a couple of new methods that you will be writing for this pr.pdf

aamousnowov

How do I fix this error " Exception in thread "main" java.lang.NullPointerException: Cannot invoke "String.hashCode()" because "action" is null at AddressBook.main(AddressBook.java:25)" import java.util.Scanner; public class AddressBook { public static void main(String[] args) { Tablea addressBook = new Tablea(); Scanner scanner = new Scanner(System.in); String name, address; String action = null; boolean moreEntries = true; while (moreEntries) { System.out.println("/nMenu"); System.out.println("n.Add Entry"); System.out.println("d. Delete Entry"); System.out.println("u. Update Entry"); System.out.println("l. Search"); System.out.println("a. View All"); System.out.println("q. Exit"); // Insert a new entry into the address book switch (action) { case "n": System.out.print("Enter a name: "); name = scanner.nextLine(); System.out.print("Enter an address: "); address = scanner.nextLine(); addressBook.insert(name, address); System.out.println("New Contact has been added,"); System.out.print("Add another entry? (y/n): "); String answer = scanner.nextLine().toLowerCase(); moreEntries = answer.equals("y") || answer.equals("yes"); break; // Delete an entry from the address book case "d": System.out.println("Enter a name to delete: "); name = scanner.nextLine(); boolean deleted = addressBook.delete(name); if (deleted) { System.out.println("Address deleted"); } else { System.out.println("Name not found"); } break; // Update an entry in the address book case "u": System.out.print("Enter a name to update: "); name = scanner.nextLine(); System.out.print("Enter a new address: "); address = scanner.nextLine(); boolean updated = addressBook.update(name, address); if (updated) { System.out.println("Address updated"); } else { System.out.println("Name not found"); } break; // Lookup an entry in the address book case "l": System.out.print("Enter a name to look up: "); name = scanner.nextLine(); String result = addressBook.lookUp(name); if (result != null) { System.out.println("Address: " + result); } else { System.out.println("Name not found"); } break; // Display all entries in the address book case "a": System.out.println("All entries:"); addressBook.displayAll(); break; // Quit the program case"q": System.out.println("Quitting..."); } } } } Other files that go with it public class Node { private String name; private String address; private Node next; Node() { // add here .. } Node(String name, String address) { // add here .. this.name = name; this.address = address; this.next = null; } public String getKey() { // add here .. return this.name; } public void setKey(String name) { // add here .. this.name = name; } public String getValue() { // add here .. return this.address; } public void setValue(String address) { // add here .. this.address = address; } public Node getNext() { // add here .. return this.next; } public void setNext(Node next) { // add here .. this.next = next; } } import java.util.Scanner; public class Tablea { private Node mark; public Node.

How do I fix this error - Exception in thread -main- java-lang-NullPoi.pdf

pnaran46

PROBLEM STATEMENT: In this assignment, you will complete DoubleEndedList.java that implements the ListInterface as well as an interface called DoubleEndedInterface which represents the list's entries by using a chain of nodes that has both a head reference and a tail reference. Be sure to read through the code and understand the implementation. WHAT IS PROVIDED: - A driver class to test your code. You should not modify this file! - A list interface (ListInterface.java) - A double ended interface (DoubleEndedInterface.java) - An incomplete DoubleEndedList class (DoubleEndedList.java) WHAT YOU NEED TO DO: 4. Complete the DoubleEndedList class 4. Run the driver and make sure your output is exactly the same as mine (at the bottom of Driver.java) \} // end else numberofEntries--; else throw new IndexOut0fBoundsException("Illegal position given to remove operation."); return result; // Return removed entry }//endreturnreve public T replace(int givenPosition, T newEntry) \{ T replace(int givenPosition, T newEntry) \{ if ((givenPosition >=1)&& (givenPosition <= numberOfEntries)) \{ // Assertion: The list is not empty Node desiredNode = getNodeAt (givenPosition); ToriginalEntry = desiredNode.getData(); desiredNode.setData(newEntry); return originalEntry; f // end if else throw new IndexOut0fBoundsException("Illegal position given to replace operation."); replace if (( givenPosition >=1)&& (givenPosition <= number0fEntries)) \{ // Assertion: The list is not empty Node desiredNode = getNodeAt ( givenPosition); T originalEntry = desiredNode. getData( ); desiredNode.setData(newEntry); return originalentry; \} // end if throw new Index0ut0fBoundsException("Illegal position given to replace operation."); \} // end replace public T getEntry(int givenPosition) \{ if ((givenPosition >=1) \&\& (givenPosition < = number0fEntries ) ) \{ // Assertion: The list is not empty return getNodeAt (givenPosition). getData(); else // end if throw new IndexOut0fBoundsException("Illegal position given to getEntry operation."); \} // end getEntry public boolean contains ( T anEntry) \{ boolean found = false; Node currentNode = firstNode; while (!found && (currentNode != null)) \{ if (anEntry.equals (currentNode.getData())) else found = true; \} // end while currentNode = currentNode. getNextNode () ; return found; \} // end contains public int getLength() \{ return numberofEntries; \} // end getLength public boolean isEmpty() \{ return number0fEntries ==0; \} // end isEmpty public T[] toArray() \{ // The cast is safe because the new array contains null entries aSuppressWarnings ("unchecked") T[] result =(T[]) new 0bject [numberofEntries]; // Unchecked cast int index =0; Node currentNode = firstNode; while ((index < numberOfEntries) \&\& (currentNode != null)) \& result [ index ]= currentNode. getData () ; currentNode = currentNode.getNextNode ( ); index++; 3 // end while return result; 3 // end toArray // Returns a reference to the node at a given position. // Precondition: L.

PROBLEM STATEMENTIn this assignment, you will complete DoubleEnde.pdf

climatecontrolsv

Implement a minimum spanning tree using Boruvka\'s algorithm. Implement a minimum spanning tree using Boruvka\'s algorithm. Solution The psuedo code is as follows: 1 Graph input = /* read input */; 2 UnionFind uf (input.getNodes ()); 3 Workset ws = input.getNodes(); 4 foreach (Node n : ws) { 5 Edge e = minWeight (input.getOutEdges (n)); 6 Node rep1 = uf.find (e.src); 7 Node rep2 = uf.find (e.dst); 8 if (rep1 != rep2) { 9 e.markInMST(); 10 Node rep = uf.union (rep1, rep2); 11 ws.add (rep) 12 } 13 }.

Implement the additional 5 methods as indicated in the LinkedList fi.pdf

footstatus

Need help finishing this doubly linked list code. Commented lines are what's needed, also add the following recursive methods: findFirstNodeWithValue() and getDisplayString() that returns a string containing the strings in the list separated by spaces Code in C# language only, please. internal class DoubleLinkedList { public DoubleLinkedListNode? firstNode = null; public DoubleLinkedListNode? lastNode = null; public DoubleLinkedListNode? currentNode = null; // other class level variables needed? public DoubleLinkedList() { // creates first node in list with firstValue } public DoubleLinkedList(string firstValue) { // methods and features to add: // get current node reference // insert node before first // delete first node // insert node after last // delete last node // insert node after current - uses multiple methods // delete current // move current to next node // move current to previous node // recursive: find node with value - return reference or null // recursive: get display string } } /******************************* * double Linked List Node - needs to be made generic * class is incomplete * *****************************/ internal class DoubleLinkedListNode { public string? value = null; public DoubleLinkedListNode? nextNode = null; public DoubleLinkedListNode? previousNode = null; public DoubleLinkedListNode(string v) { value = v.ToLower(); } private DoubleLinkedListNode() { value = null; } } .

Need help finishing this doubly linked list code- Commented lines are.docx

Jason0x0Scottw

import java.util.ArrayList; import java.util.List; /** * * */ public class AList { List list = new ArrayList(); public AList() { // TODO Auto-generated constructor stub } /** * */ public AList(List list) { this.list = list; } /* * (non-Javadoc) * * see java.lang.Object#equals(java.lang.Object) */ public boolean equals(Object obj) { // TODO Auto-generated method stub AList aList = (AList) obj; List arrayList = aList.getList(); if (arrayList.size() != list.size()) { return false; } for (int i = 0; i < list.size(); i++) { if (list.get(i) != arrayList.get(i)) { return false; } } return true; } /** * return the list */ public List getList() { return list; } /** * param list * the list to set */ public void setList(List list) { this.list = list; } /** * param args */ public static void main(String[] args) { // TODO Auto-generated method stub List integers = new ArrayList(); integers.add(10); integers.add(20); integers.add(30); integers.add(40); integers.add(50); List integers1 = new ArrayList(); integers1.add(10); integers1.add(20); integers1.add(30); integers1.add(40); integers1.add(60); AList aList1 = new AList(integers); AList aList2 = new AList(integers); System.out.println(\"list1 and list2 are equal? \" + aList1.equals(aList2)); aList2 = new AList(integers1); System.out .println(\"After adding 60 to list2, list1 and list2 are not equal? \" + aList1.equals(aList2)); } } OUTPUT: list1 and list2 are equal? true After adding 60 to list2, list1 and list2 are not equal? false Solution import java.util.ArrayList; import java.util.List; /** * * */ public class AList { List list = new ArrayList(); public AList() { // TODO Auto-generated constructor stub } /** * */ public AList(List list) { this.list = list; } /* * (non-Javadoc) * * see java.lang.Object#equals(java.lang.Object) */ public boolean equals(Object obj) { // TODO Auto-generated method stub AList aList = (AList) obj; List arrayList = aList.getList(); if (arrayList.size() != list.size()) { return false; } for (int i = 0; i < list.size(); i++) { if (list.get(i) != arrayList.get(i)) { return false; } } return true; } /** * return the list */ public List getList() { return list; } /** * param list * the list to set */ public void setList(List list) { this.list = list; } /** * param args */ public static void main(String[] args) { // TODO Auto-generated method stub List integers = new ArrayList(); integers.add(10); integers.add(20); integers.add(30); integers.add(40); integers.add(50); List integers1 = new ArrayList(); integers1.add(10); integers1.add(20); integers1.add(30); integers1.add(40); integers1.add(60); AList aList1 = new AList(integers); AList aList2 = new AList(integers); System.out.println(\"list1 and list2 are equal? \" + aList1.equals(aList2)); aList2 = new AList(integers1); System.out .println(\"After adding 60 to list2, list1 and list2 are not equal? \" + aList1.equals(aList2)); } } OUTPUT: list1 and list2 are equal? true After adding 60 to list2, list1 and list2 are not equal? fal.

import java.util.ArrayList; import java.util.List; .pdf

anuradhasilks

Write a program to implement below operations with both singly and doubly linked list. Use inheritance to define singly linked list and doubly linked list. Add Node() Delete Node() Update Node() Delete All() Size() Solution #include using namespace std; class List; class Node { friend class List; protected: int Data; Node *Link; }; class List:public Node { friend class Node; private: Node *Start; public: List() { Start=NULL; } Node Insert(int x); Node Delete(int &x); void Display(); }; Node List::Insert(int x) { Node *New=new Node; New->Data=x; New->Link=Start; Start=New; return *this; } Node List::Delete(int &x)//deletes first node { Node *Del=Start; Start=Start->Link; delete Del; return *this; } void List::Display() { Node *P=Start; while(P!=NULL) { cout<Data<<\" \"; P=P->Link; } } int main() { List L; L.Insert(4); L.Insert(64); L.Insert(3); L.Insert(90); L.Insert(66); L.Insert(13); L.Display(); } Double Linked List.

Write a program to implement below operations with both singly and d.pdf

thangarajarivukadal

need this program in java please and thanks! NOTICE: There are NO static variables allowed in this lab. The only class that a static method is allowed is in the TestDriver class. The only static method that you actually really need is main. The purpose of this lab is to give you an opportunity to create your own linked list data structure and implement all the methods specified below to do list operations. The following specifies the linked list class which you must implement. Only implement the methods listed below. Do NOT add any additional member variables. class OrderedLinkedList { private class Node { // NOTE: The member variables are public so the methods // of the OrderedLinkedList class have direct access to them // NO setters and getters are needed – more efficient access. public String payload; public int keyValue; public Node next; // Explicit value constructor for the Node class public Node(String payload, int value) { …. } } private Node first; // This is the only member variable allowed. // You can NOT add any other member variables!!! public OrderedLinkedList ( ) { … } // default constructor public boolean empty( ) { … } // returns true if list is empty public String getFirst( ) throws Exception { … } // The first node is removed from the list and its payload is returned. // An exception with a meaningful error message is thrown if the list is empty. public String getLast( ) throws Exception { … } // The last node is removed from the list and its payload is returned. // An exception with a meaningful error message is thrown if the list is empty. public void insert(String payload, int key) throws Exception { … } // The insert method creates a new node, puts the input parameter values // into the new node, and then inserts the node into the list in sorted order // based on the keyValue. For example, if a list has 3 nodes with key values // of 5, 10, and 15, insertion of a new node which has a key value of 12 would // require that the new node was inserted after the node with key value of 10. // If the key being inserted is already in the list, throw an Exception with a // meaningful error string. Make sure that you test all possible cases for insertion. public void remove(int key) throws Exception { … } // Traverse the list, keeping track of where the precedessor for each node // is located. When the value is found in some node in the list, make the // predecessor node bypass the node which holds the value. If the key value // is not found, throw an Exception that indicates the error has occurred. public int listCount( ) { … } // Returns the number of nodes in the list. public String getValue(int key) throws Exception { … } // Traverse the list until you locate the requested key value. Return the // payload from the node which has the requested key value. If the key value // is not found, throw an Exception that indicates the error has occurred. public String toString( ) { … } // Override the toString method and create a string t.

need this program in java please and thanks!NOTICE There are NO s.pdf

arshin9

Creat Shape classes from scratch DETAILS You will create 3 shape classes (Circle, Rectangle, Triangle) that all inherit from a single abstract class called AbstractShape which implements Shape (also created by you). You are also responsible for creating the driver class \"Assignment7.java\" (program that tests your classes and described on page 3) which does the following reads input data from a file instantiates various objects of the three shapes based on the input data stores each in a LinkedList outputs this list to an output file sorts a \"copy\" of this LinkedList of objects outputs the sorted version of the list to the output file outputs the original list to the output file This driver program also needs to \"ignore errors in the input file that breach the specified input format as described in the Assianment7,java details (see page 3 1. Shape.java This is an interface that has 2 abstract methods, and passes the responsibility of implementing the compareTo method to the class that implements Shape (you may note, nomally Comparable is \"implemented\" by a class. However, an interface cannot implement because interfaces can only contain abstract methods. That said, an interface can only extend other interfaces and the responsibility of actually \"implementing\" the abstract method(s) of the super class interface is passed on to the sub-classes) public interface Shape extends Comparable public double calculateAreal) Il This abstract method is implemented at the concrete level public Shape copyShape); Il also implemented at the concrete level 2. AbstractShape.java public abstract class AbstractShape implements Shape This class should contain an instance field to store the name of each obiect. The constructor which sets this field should receive the name and a number to be concatenated to the name and then stored in the name field Recall, when the super class has a parameterized constructor, the sub-classes will need to call it AND the sub- classes will need to also provide a constructor without parameters This abstract class will implement the compareTo method passed on from the Shape interface and will pass on the responsibility of implementing calculateArea to the extending sub-classes (compare To will use the calculateArea method when comparing 2 Shape objects). Along with compare To, one more concrete method should be included. The following will be used by the sub-classes\' toString method: public String getName) II Simply returns the name field data Solution in7.txt 4.4 2.5 3 8.1 3.0 5.0 2.5 3 4 2.5 tuesday -7 1.0 3 three 3 -9 3 5 1.0 Assignment7.java import java.io.*; import java.util.*; public class Assignment7 { /** * This is the test driver class that will include main. * This program MUST read a file named in7.txt and * generate an output file named out7.txt. The in7.txt * file must be created by you based on formatting * described shortly. * * @param theArgs */ public static void main(String[] theArgs) { List myList = new Arra.

Creat Shape classes from scratch DETAILS You will create 3 shape cla.pdf

aromanets

Inspect the class declaration for a doubly-linked list node in Node-h-.pdf

vishalateen

package singlylinkedlist; public class Node { public String value; public Node next; public Node(String value) { this.value = value; } @Override public String toString() { return value; } } SingleyLinkedList.java : package singlylinkedlist; import java.io.*; import java.util.*; /** * Defines the interface for a singly-linked list. * */ public interface SinglyLinkedList { /** * @return Reference to the first node. If the list is empty, this method * returns null. */ public Node getFirst(); /** * @return Reference to the last node . If the list is empty, this method * returns null. */ public Node getLast(); /** * @return Number of nodes in the list */ public int size(); /** * @return true if the list has no nodes; false otherwise */ public boolean isEmpty(); /** * Removes all nodes in the list. */ public void clear(); /** * Inserts a new node with the given value after cursor. * * @param cursor * The node to insert after. Set this to null to insert value as the * new first Node. * @param value * The value to insert * @return a reference to the newly inserted Node */ public Node insert(Node cursor, String value); /** * Inserts a new node with the given value at the "end" of the list. * * @param value * @return a reference to the newly inserted Node */ public Node append(String value); /** * Removes the node after the specified Node (cursor) from the list. * * @param cursor * A reference to the Node to remove. */ public void removeAfter(Node cursor); /** * Returns a reference to the first Node containing the key, starting from the * given Node. * * @param start * @param key * @return a reference to the first Node containing the key */ public Node find(Node start, String key); /** * Prints the values of all the items in a list */ public void printWholeList(); } SinglyLinkedTester.java: package sbccunittest; import static java.lang.Math.*; import static java.lang.System.*; import static org.apache.commons.lang3.StringUtils.*; import static org.junit.Assert.*; import static sbcc.Core.*; import java.io.*; import java.lang.reflect.*; import java.nio.file.*; import java.util.*; import java.util.stream.*; import org.apache.commons.lang3.*; import org.junit.*; import org.w3c.dom.ranges.*; import sbcc.*; import singlylinkedlist.*; /** * 09/16/2021 * * @author sstrenn * */ public class SinglyLinkedListTester { public static String newline = System.getProperty("line.separator"); public static int totalScore = 0; public static int extraCredit = 0; public static boolean isZeroScore = false; public static String scorePreamble = ""; @BeforeClass public static void beforeTesting() { totalScore = 0; extraCredit = 0; } @AfterClass public static void afterTesting() { if (isZeroScore) { totalScore = 0; extraCredit = 0; } println(scorePreamble + "Estimated score (w/o late penalties, etc.) is: " + totalScore + " out of 25."); // If the project follows the naming convention, save the results in a folder on // the desktop. (Alex Kohanim) try { String directory = substri.

package singlylinkedlist; public class Node { public String valu.pdf

amazing2001

Similar to Design a program named SortedNameList.java, which implements a list .pdf (20)