Assignent 8

A readinglist is a doubly linked list in which each element of the list is a book. So, you must make sure that Books are linked with the previous prev and next element. A readinglist is unsorted by default or sorted (according to title) in different context. Please pay attention to the task description below. Refer to the relevance classes for more detail information. Implement the add_book_sorted method of the ReadingList class. Assume the readinglist is sorted by title, the add_book_sorted method takes an argument new_book (a book object), it adds the new_book to the readinglist such that the readinglist remain sorted by title. For example, if the readinglist contain the following 3 books: Title: Artificial Intelligence Applications Author: Cassie Ng Published Year: 2000 Title: Python 3 Author: Jack Chan Published Year: 2016 Title: Zoo Author: Cassie Chun Published Year: 2000 If we add another book (titled "Chinese History"; author "Qin Yuan"; and published year 1989) to the…

Q3 / create multiple graphs with single call to plot, these statements plot three related functions of x : t1 = 2sinc (x), t2 = sinc (x), and t3 = 0.5sinc (x), in the interval O < x < 2n . The graphs must be contain desired title , axis labels , and annotations , with symbols for color , style , and marker respectively.

Task 4: Matplotlib Import the plotting function by the command: import matplotlib.pyplot as plt Plotting multiple lines Compute the x and y coordinates for points on sine and cosine curves and plot them on the same graph using matplotlib. Add x and y labels to the graph as well. Note: Please provide PYTHON (ANACONDA) code for above task.

Using Java programming language create a linked list named Cars with four elements: "SUV cars", "Pickup cars", "Sport cars", and "Sedan cars". Apply the following activities on the code you’ve created and provide screen shot of each result: Add a new element “Classic car” at the beginning of the linked list using iterator. Add a new element “Economic cars" after the element "Sedan Cars" using iterator.   Print the LinkedList backward from the last element to the first element using hasPrevious()

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…

Two-dimensional list tictactoe represents a 3x3 tic-tac-toe game board read from input. List tictactoe contains three lists, each representing a row. Each list has three elements representing the three columns on the board. Each element in the tic-tac-toe game board is 'x', 'o', or '-'. If all the elements at column index 0 are 'o', output 'A win at column 0.' Otherwise, output 'No win at column 0.'

Please help me to finish this code in python

In this assignment, you will create a Linked List data structure variant called a “Circular Linked List”. The Node structure is the same as discussed in the slides and defined as follows (we will use integers for data elements): public class Node {          public int data;          public Node next; }   For the Circular Linked List, its class definition is as follows:   public class CircularLinkedList {          public int currentSize;          public Node current; }   In this Circular Linked List (CLL), each node has a reference to an existing next node. When Node elements are added to the CLL, the structure looks like a standard linked list with the last node’s next pointer always pointing to the first. In this way, there is no Node with a “next” pointer in the CLL that is ever pointing to null. For example, if a CLL has elements “5”, “3” and “4” and “current” is pointing to “3”, the CLL should look like:   Key observations with this structure: The currentSize is 3 meaning there…

The arrow and trailing box that comes out of this node represents a link list. Each element of the link list represents the line where this word occurs in the text. There can be more than one element in the link list because the words can be found on different lines. For example, if we assume that the word cupboard occurs on lines 1, 3 and 12, the link list linked to the letter d above should be as follows: 12 4. If attention is paid, it can be seen that the link list only depends on the last letters of the words in the text. 5. Although found in the dictionary, some words are not accepted as words in the tree above (since they are not mentioned in the text). For example, although the words cup, the and wit are in the English dictionary, they are not included as words in the tree above (there is no link list from the letters p, e and t). To repeat, the reason is that they are not mentioned in the text. 6. When the tree is examined, it will be seen that the siblings are added as nodes…

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)

Remove the last element from vector ticketList.

Which of the following is (are) true about Minitab applications? I) In order to write the frequency of each class on the rectangle of the relevant class in the histogram created in Minitab, right click on the graph and follow the steps 'Add' -- 'Gridlines'. II) To create a histogram using frequencies in Minitab, 'Histogram'-- 'Scale'--'Frequency' steps are followed while entering frequency data. III) While entering the reference values for our data in the histogram in Minitab, 'Scale'--'Reference Lines'--'Show reference lines at Y values' steps are followed. IV) In order to manually enter the number of classes in the histogram chart in Minitab, double-click on the histogram and follow the binning - number of intervals steps from the window that opens. Answer options group A) I only B)I-II-III C)II-III-IV D) IV only

TASK 3   Using one of the sorting methods, sort the Car ArrayList based on their ‘City mpg’ feature. Justify your choice of the algorithm used.     HINTS: 1. You need to create a class called Car that implements the Comparable interface and load the data from the file to a list. Then somehow convert the arraylist to an array to use the implementations of the algorithms   2. To measure the time it took to run, you can use System.nanoTime() or System.currentTimeMillisbefore and after the method is executed (see here: https://docs.oracle.com/javase/7/docs/api/java/lang/System.html) and subtract. Deliverables: 1. A IntelliJ project implementing the tasks 2. A report on the second exercise showing a graph of running time vs. input size of both algorithms and your conclusions.

Pls help ASAP

in this assignment i have to remove vowels from a string using a linked list. the linked list and link code is from a textbook and cannot be changed if the code alters the data structure. for some reason when i implement this code it gives me a logical error where the program only removes all instances of the first vowel in a string instead of moving through all vowels of the string and removing each one with all instances. i would appreciate if you could tell me the problem and solution in words and not in code. The code is in java. output please enter a string.researchhcraeserfalseList (first -->last): researchList (first -->last): researchList (first -->last): rsarch CODE  MAIN FUNCTION import java.util.Scanner;/*** Write a description of class test here.** @author (your name)* @version (a version number or a date)*/public class test{// instance variables - replace the example below with your ownpublic static void main(String[] args){Scanner input = new…

In this assignment, you will compare the performance of ArrayList and LinkedList. More specifically, your program should measure the time to “get” and “insert” an element in an ArrayList and a LinkedList.You program should 1. Initializei. create an ArrayList of Integers and populate it with 100,000 random numbersii. create a LinkedList of Integers and populate it with 100,000 random numbers2. Measure and print the total time it takes to i. get 100,000 numbers at random positions from the ArrayList 3. Measure and print the total time it takes to i. get 100,000 numbers at random positions from the LinkedList 4. Measure and print the total time it takes to i. insert 100,000 numbers in the beginning of the ArrayList 5. Measure and print the total time it takes to i. insert 100,000 numbers in the beginning of the LinkedList 6. You must print the time in milliseconds (1 millisecond is 1/1000000 second).A sample run will be like this:Time for get in ArrayList(ms): 1Time for get in…

Write a program that animates the insertion-sort algorithm. Create a list that consists of 20 distinct numbers from 1 to 20 in a random order. The elements are displayed in a histogram, as shown in Figure 10.21. Clicking the Step button causes the program to perform an iteration of the outerloop in the algorithm and repaints the histogram for the new list. Color the last bar in the sorted sublist. When the algorithm is finished, display a dialog box to inform the user. Clicking the Reset button creates a new random list for a new start.

JAVASCRIPT toggleCommentSection a. Receives a postId as the parameter b. Selects the section element with the data-post-id attribute equal to the postId received as a parameter c. Use code to verify the section exists before attempting to access the classList property d. At this point in your code, the section will not exist. You can create one to test if desired. e. Toggles the class 'hide' on the section element f. Return the section element*/

Overview: In this assignment, we will be creating an HTML Checker program that will check the syntax of HTML tags.  You will write a class that stores the contents of an HTML page as a queue of HTMLTags. Your class will also be able to fix invalid HTML tags. Your HTMLManager will use stacks and queues to figure out whether the tags match and fix the mistakes it finds.  There will also be a number of Instructor-provided files to help with this assignment in order to make your work a little less :-) Topics: queues, stacks Background on HTML: Web pages are written in a language called “Hypertext Markup Language”, or HTML. An HTML file consists of text surrounded by markings called tags. Tags give information to the text, such as formatting (bold, italic, etc) or layout (paragraph, table, list, etc). Some tags specify comments or information about the document (header, title, document type). A tag consists of a named element between less-than < and greater-than > symbols. For…

def collapse_intervals(items): This function is the inverse of the previous question of expanding positive integer intervals. Given a nonempty list of positive integers that is guaranteed to be in sorted ascending order, create and return the unique description string where every maximal sublist of consecutive integers has been condensed to the notation first-last. If some maximal sublist consists of a single integer, it must be included in the result string just by itself without the minus sign separating it from the now redundant last number. Make sure that the string returned by your function does not contain any whitespace characters, and does not have a redundant comma at the end. items expected results [1, 2, 4, 6, 7, 8, 9, 10, 12, 13] '1-2,4,6-10,12-13' [42] '42' [3, 5, 6, 7, 9, 11, 12, 13] '3,5-7,9,11-13' [ ]  ' ' range(1, 1000001) '1-1000000' please add comments in between the codes so I understand

Write a program that animates the selection-sort algorithm. Create a list that consists of 20 distinct numbers from 1 to 20 in a random order. The elements are displayed in a histogram, as shown in Figure 10.19. Clicking the Step button causes the program to perform an iteration of the outerloop in the algorithm and repaints the histogram for the new list. Color the last bar in the sorted sublist. When the algorithm is finished, display a dialog box to inform the user. Clicking the Reset button creates a new random list for a new start.

Make a data structure that enables the access and delete actions. If the item isn't already on the data structure, the access action adds it. The object with the least recent access is deleted and returned by the remove operation. Hint: Maintain references to the first and last nodes as well as the items' order of access in a doubly linked list. Use a symbol table where the keys represent the items and the values the links in the list. Remove the element from the linked list after accessing it, then reintroduce it at the start. Delete an element from the end and from the symbol table whenever you remove one.

Make a data structure that enables the access and delete actions. If the item isn't already on the data structure, the access action adds it. The object with the least recent access is deleted and returned by the remove operation. Hint: Maintain references to the first and last nodes as well as the items' order of access in a doubly linked list. Use a symbol table where the keys represent the items and the values the links in the list. Remove the element from the linked list after accessing it, then reintroduce it at the start. When you eliminate an element, do both the symbol table and end deletions.

Question 11 Write a method called changeQueue to be considered inside the ArrayQueue class and has one parameter item of type E. Your method will change the queue in such a way that if the the first element of the queue and the last element of the queue are equal, the first and last elements in the queue will be replaced with item, otherwise, do not do any change. Similarly, the same process is done for the second element in the queue and the element before the last in the queue and so on. Assume you have a non-empty queue with even number of elements. You are not allowed to call any method from the the ArrayQueue class. Do not use iterators. Method head: public void changeQueue(E item) Example1: Before run: front rear "this" queue: 10 29 2 25 10 Item1: 100 After run: front rear "this" queue: 100 29 100 100 5 100 Use the editor to format your answer

3. Create an ArrayList of strings to store the names of celebrities or athletes. Add five names to the list. Process the list with a for loop and the get() method to display the names, one name per line. Pass the list to avoid method. Inside the method, Insert another name at index 2 and remove the name at index 4. Use a foreach loop to display the arraylist again, all names on one line separated by asterisks. After the method call in main, create an iterator for the arraylist and use it to display the list one more time. See Sample Output. SAMPLE OUTPUT Here is the list Lionel Messi Drake Adele Dwayne Johnson Beyonce Here is the new list * Lionel Messi * Drake * Taylor Swift * Adele * Beyonce Using an iterator, here is the list Lionel Messi Drake Taylor Swift Adele Beyonce

How many references must you changes to insert a node between two nodes in a double linked list. Show your answer with a drawing highlighting the new references. Assuming current is the reference of the next-to-last node in a linked list, write a statement that deletes the last node from the list. What is the time complexity of deleting a node from a linked listed? Is it faster than deleting a node from an array? Why?

Consider the following linked list of the form. This list already exists, so you do not need to write the code to create the list below:   struct nodeType {    int infoData;    nodeType * next; };   nodeType *first;   … and containing the values (see image) : Write a code segment that prints all the current values in the linked list.

Body of the Loop: A reasonable step would be:
Choose some nodeu from foundNotHandled, and handle it. This involves following all the edges from u.
Newly found nodes are now added to the set foundNotHandled (if they have notbeen found already).
u is moved from foundNotHandled to foundHandled.

gram works correctly. 33. Using the circular doubly linked list below, give the expression corresponding to each of the following descriptions. TH HHF Node Node Node Node Node 2 3 4 1 A For example, the expression for the info value of node 1, referenced from reference A would be A.getInfo(). a. The info value of node 1, referenced from reference Cs b. The info value of node 2, referenced from reference B C. The link value of node 2, referenced from reference A d. The link value of node 4, referenced from reference C e. Node 1, referenced from reference B f. The back value of node 4, referenced from reference C 79v16 g. The back value of node 1, referenced from reference A

Question 44  Computer Science A list of elements has a size of 100. Choose the operations where an ArrayList would be faster than a LinkedList. (Select all that apply) Question 5 options:     removing from index 99       inserting at index 1       removing from index 4       inserting at index 4    Full explain this question and text typing work only

Java Programming language Help please.

Question 6 sm.Full explain this question and text typing work only     We should answer our question within 2 hours takes more time then we will reduce Rating Dont ignore this line

Java - Mileage for a Runner