PythonChoose letter of correct answerExplain why. You may select many. (There are two answers). The Quick Union implementation assumes that the root nodes are assigned a parent ID of “-1".If I wanted to change this and set root nodes to have a parent ID of "0" instead of "-1", whichlines in the following code would change? Select all that should change.1class QuickUnion:definit_(self, size: int) -> None:CHOICES (Select all that may apply.)size: number of elements to initializeself.size = sizea. None of the aboveself.parent = [-1]*self.sizeb. Line 16defstr(self) -> str:c. Line 1510return f"parent: {self.parent}"d. Line 2611def get_root(self, p: int) -> int:"""Find the root of p"""idx = pwhile self.parent[idx] >= 0:idx = self.parent[idx]12e. Line 2013f. Line 714151617return idx18def is_connected(self, pl: int, p2:int) -> bool:return self.get_root(pl) == self.get_root(p2)192021def connect(self, pl: int, p2: int) -> None:"" "Connects pl and p2"""rl = self.get_root(p1)r2 = self.get_root(p2)self.parent[rl] = r22223242526

Please upvote. I am providing you the correct answer below. Please please please. We need to…

The Quick Union implementation assumes that the root nodes are assigned a parent ID of “-1". If I wanted to change this and set root nodes to have a parent ID of "0" instead of “-1", which lines in the following code would change? Select all that should change. 1 class QuickUnion: def init_(self, size: int) -> None: CHOICES (Select all that may apply.) 3 4 size: number of elements to initialize 6 self.size = size a. None of the above 7 self.parent = [-1]*self.size b. Line 16 8 c. Line 15 str_(self) -> str: return f"parent: {self.parent}" 9. def 10 d. Line 26 11 e. Line 20 def get_root(self, p: int) -> int: ""Find the root of p""" idx = p while self.parent[idx] >= 0: idx = self.parent[idx] 12 13 f. Line 7 14 15 16 17 return idx 18 def is_connected(self, pl: int, p2:int) -> bool: return self.get_root(p1) == self.get_root(p2) 19 20 21 def connect(self, pl: int, p2: int) -> None: """Connects pl and p2""" rl = self.get_root(p1) r2 = self.get_root(p2) self.parent[rl] = r2 22 23 24 25 26

The Quick Union implementation assumes that the root nodes are assigned a parent ID of “-1". If I wanted to change this and set root nodes to have a parent ID of "0" instead of “-1", which lines in the following code would change? Select all that should change. 1 class QuickUnion: def init_(self, size: int) -> None: CHOICES (Select all that may apply.) 3 4 size: number of elements to initialize 6 self.size = size a. None of the above 7 self.parent = [-1]*self.size b. Line 16 8 c. Line 15 str_(self) -> str: return f"parent: {self.parent}" 9. def 10 d. Line 26 11 e. Line 20 def get_root(self, p: int) -> int: ""Find the root of p""" idx = p while self.parent[idx] >= 0: idx = self.parent[idx] 12 13 f. Line 7 14 15 16 17 return idx 18 def is_connected(self, pl: int, p2:int) -> bool: return self.get_root(p1) == self.get_root(p2) 19 20 21 def connect(self, pl: int, p2: int) -> None: """Connects pl and p2""" rl = self.get_root(p1) r2 = self.get_root(p2) self.parent[rl] = r2 22 23 24 25 26

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...

See similar textbooks

Similar questions

Python For this assignment, you will write a program to allow the user to store the names and phone numbers of their contacts. Create the following classes: Contact: two attributes. One for the contact's name and the contact's phone number. Node: two attributes: _data and _next. For use in a linked list. ContactList: One attribute: _head, a reference to the head of an internal linked list of Node objects. Note: self._head is an attribute of the class, so any method which updates the internal linked list can simply update the list self._head references. There is no need to return anything like we did in methods such as add_to_end in the lecture. Note also that for the same reason, we do not have to pass a reference to the head of the list to any method, because each method should already have access to the self._head attribute. ContactList should also have the following methods: add(name, new_number). Creates a new Node with a Contact object as its _data. The new Node is then added…
To finish up the definition of the Node class, we need at least two constructor methods. We definitely want a default constructor that creates an emptyNode, with both the Element and Link members set to null. We also need aparameterized constructor that assigns data to the Element member and setsthe Link member to null.Write the code for the Node class:
Create a node class named LinkedNodes that uses up to 4 dynamic pointers to connect it to the other 8 nodes in the structure (a total of 9). The data in each node will be a unique integer number from 1 through 9. Include in your class definition these functions at a minimum: getVal(), setVal(), getNext(), setNext(), getPrev(), setPrev(), constructor(s) and destructor. Write a simple program to load these nodes into a linked structure. Do not use an array, the pointers will do that for you. You should be able to reach any node from any other node in the structure by traversing a maximum of 2 nodes from the current one. The output from your program should report the traversals between all nodes in the structure, starting with the node whose value is one. (See the example below) Node 1 2 3 4 5 6 7 8 9 -> Traverses to Node 1 Node 2 1->2 2->6->1 3->6->1 3->7->2 4->6->1 4->7->2 4->8->3 5->6->1 5->7->2 5->8->3 6->1->2 6->1->3 7->1->3 8->3 6->1 7->1 8->1 9->1 Node 3 1->3 2->3 7->2 8->2 9->2…
You may find a doubly-linked list implementation below. Our first class is Node which we can make a new node with a given element. Its constructor also includes previous node reference prev and next node reference next. We have another class called DoublyLinkedList which has start_node attribute in its constructor as well as the methods such as: 1. insert_to_empty_list() 2. insert_to_end() 3. insert_at_index() Hints: Make a node object for the new element. Check if the index >= 0.If index is 0, make new node as head; else, make a temp node and iterate to the node previous to the index.If the previous node is not null, adjust the prev and next references. Print a message when the previous node is null. 4. delete_at_start() 5. delete_at_end() . 6. display() the task is to implement these 3 methods: insert_at_index(), delete_at_end(), display(). hint on how to start thee code # Initialize the Node class Node: def __init__(self, data): self.item = data…
Step 1: Inspect the Node.java file Inspect the class declaration for a doubly-linked list node in Node.java. Access Node.java by clicking on the orange arrow next to LabProgram.java at the top of the coding window. The Node class has three fields: a double data value, a reference to the next node, and a reference to the previous node. Each field is protected. So code outside of the class must use the provided getter and setter methods to get or set a field. Node.java is read only, since no changes are required. Step 2: Implement the insert() method A class for a sorted, doubly-linked list is declared in SortedNumberList.java. Implement the SortedNumberList class's insert() method. The method must create a new node with the parameter value, then insert the node into the proper sorted position in the linked list. Ex: Suppose a SortedNumberList's current list is 23 → 47.25 → 86, then insert(33.5) is called. A new node with data value 33.5 is created and inserted between 23 and 47.25,…
Complete the implementation of the link-based set defined in the new class named LinkedSet that implements a set type using linked nodes. Hint: Much of the code in the LinkedBag class from your solution of the linkedbag.py file in Programming Exercise 5.5 can be reused. In the linkedset.py file, complete the following: Complete the accessor methods: isEmpty(), returns true if len(self) == 0, or false otherwise. __len__, returns the number of items in self. __str__, returns the string representation of self. __iter__, supports iteration over a view of self. __add__, returns anew set containing the contents of self and other clone, return a copy of self. __eq__, returns true if self equals other, or false otherwise count, return the numer of instance of item in self. Complete the mutator methods: clear, makes self become empty. add, adds item to self and ignores the item if it’s already in the set. Check array memory and increase it if necessary remove, removes item from self if…
Tour.java Create a Tour data type that represents the sequence of points visited in a TSP tour. Represent the tour as a circular linked list of nodes, one for each point in the tour. Each Node contains two references: one to the associated Point and the other to the next Node in the tour. Each constructor must take constant time. All instance methods must take time linear (or better) in the number of points currently in the tour. To represent a node, within Tour.java, define a nested class Node: private class Node { private Point p; private Node next; } Your Tour data type must implement the following API. You must not add public methods to the API; however, you may add private instance variables or methods (which are only accessible in the class in which they are declared). public class Tour // Creates an empty tour. public Tour() // Creates the 4-point tour a→b→c→d→a (for debugging). public Tour(Point a, Point b, Point c, Point d) // Returns the number of points in this tour. public…
The two classes you will create will implement the operations defined in the interface as shown in the UML class diagram above. In addition, BinarySearchArray will implement a static method testBinarySearchArray() that populates the lists, and lets the user interactively test the two classes by adding and removing elements. The parameter BinarySearch can represent either class and tells testBinarySearchArray which class to test. Steps to Implement: 1) To get started create a new project in IntelliJ called BinarySearch. Add a class to your project called BinarySearchArray. Then add another class BinarySearchArrayList and an interface called BinarySearch. The interface BinarySearch includes public method stubs as shown in the diagram. You are allowed to add BinarySearchArrayList to the same file as BinarySearch but don't add an access modifier to this class, or for easier reading, you can declare the classes in separate files with public access modifiers. Only the class…
Start this lab with the code listed below. The LinkedList class defines the rudiments of the code needed to build a linked list of Node objects. You will first complete the code for its addFirst method. This method is passed an object that is to be added to the beginning of the list. Write code that links the passed object to the list by completing the following tasks in order:1. Create a new Node object.2. Make the data variable in the new Node object reference the object that was passed to addFirst.3. Make the next variable in the new Node object reference the object that is currently referenced in variable first.4. Make variable first reference the new Node.Test your code by running the main method in the LinkedListRunner class below. Explain, step by step, why each of the above operations is necessary. Why are the string objects in the reverse order from the way they were added? public class LinkedList{ private Node first; public LinkedList() { first = null; } public Object…
Exercise 1 The HeapManager in this chapter implements a first-fit mechanism. It uses the first block on the free list that is at least as large as the requested size. Another fairly simple mechanism is called best-fit. As you might guess, the idea is to search the free list for a sufficiently large block that is as close to the requested size as possible. If there is an exact fit on the free list, the best-fit mechanism can stop the search early. Otherwise, it has to search all the way to the end of the free list. This has the advantage that it does not break up large blocks unnecessarily. For example, if there is an exact fit somewhere on the list, the best-fit mechanism will find one, so it will not have to split a block at all. Implement a version of HeapManager with a best-fit mechanism. Start with a renamed copy of the HeapManager class, and then modify the allocate method to implement a best-fit search. (The code for HeapManager is available on the Web site for this book. It…
4 O T O I D06 It is time for you to demonstrate your skills in a project of your own choice. You must DESIGN, ANALYSE AND CODE any method for the GENERIC MyLinkedList class that will manipulate the linked list. You can decide yourself what it should be following the specification below: 1. Purpose: The method must make logical sense - it should be of some purpose to somebody. You should describe in the text who will use the method for which purpose. 2. Clearly explain the problem. Then clearly explain how your method will solve it. 3. Test program: Test the method using a wranned class like Integer l Filters Add a caption. > Status (Contacts)
data structures in java