CSC 236-Lab 3 (2 programs) LLL1. A polynomial can be represented as a linked list, where each node called a polyNodecontains the coefficient and the exponent of a term of the polynomial.For example, the polynomial 4x³ + 3x² - 5 would be represented as the linked list:43-4x3●-323x²31/123422357A portion of this data structure is shown below:Ilink9 LI!!!Write a Polynomial class that has methods for creating a polynomial, reading andwriting a polynomial, and adding a pair of polymomials.→In order to add 2 polynomials, traverse both lists. If a particular exponent value ispresent in either one, it should also be present in the resulting polynomial unless itscoefficient is zero.-50- 5xo2. Each student at Middlesex County College takes a different number of courses, so theregistrar has decided to use linear linked lists to store each student's class scheduleand an array to represent the entire student body.Sec cr%CSC1621 337 HIS141|2|4|7CSC23643/These data show that the first student (ID: 1111) is taking section 1 of CSC162 for 3credits and section 2 of HIS101 for 4 credits; the second student is not enrolled; thethird student is enrolled in CSC236 section 4 for 3 credits.Write a class for this data structure. Provide methods for creating the original array,inserting a student's initial class schedule, adding a course, and dropping a course. Includea menu-driven program that uses the class. Lab 3 Directions (linked lists)Program #11. Show PolynomialADT interface2. Create the PolyNodeClass with the following methods: default constructor,overloaded constructor, copy constructor, setCoefficient, setExponent,setNext, getCoefficient, get Exponent, getNext3. Create the PolynomialDataStrucClass with the following methods: defaultconstructor, overloaded constructor, copy constructor, isEmpty,setFirstNode, getFirstNode, addPolyNodeFirst (PolyNode is created and setto beginning of polynomial), addPolyNodeLast, addPolyNode (PolyNode is setto the end of polynomial), addPolynomials, toString4. Create the Polynomial DemoClass: instantiate and initializePolynomial DataStrucClass objects p1, p2, p3, p41- Add terms to the polynomials (pass 2 arguments to the method: coefficientand exponent- for example: p1.addPolyNodeLast(4, 3);)Print out p1, p2 and sum of the polynomials AND p3, p4, and sum of thepolynomialsUse: p1= 4x^3 + 3x^2 - 5; p2 = 3x^5 + 4x^4 + x^3 - 4x^2 + 4x^1 + 2ANDp3= -5x^0 + 3x^2 + 4x^3; p4 = -4x^0 + 4x^3 + 5x^4

''Since you have asked multiple questions, we will solve the first question for you. If you want any…

CSC 236-Lab 3 (2 programs) LLL 1. A polynomial can be represented as a linked list, where each node called a polyNode contains the coefficient and the exponent of a term of the polynomial. For example, the polynomial 4x³ + 3x²-5 would be represented as the linked list: 43 2 % 3x² Write a Polynomial class that has methods for creating a polynomial, reading and writing a polynomial, and adding a pair of polymomials. 4x3 3 -50 -5xo In order to add 2 polynomials, traverse both lists. If a particular exponent value is present in either one, it should also be present in the resulting polynomial unless its coefficient is zero.

CSC 236-Lab 3 (2 programs) LLL 1. A polynomial can be represented as a linked list, where each node called a polyNode contains the coefficient and the exponent of a term of the polynomial. For example, the polynomial 4x³ + 3x²-5 would be represented as the linked list: 43 2 % 3x² Write a Polynomial class that has methods for creating a polynomial, reading and writing a polynomial, and adding a pair of polymomials. 4x3 3 -50 -5xo In order to add 2 polynomials, traverse both lists. If a particular exponent value is present in either one, it should also be present in the resulting polynomial unless its coefficient is zero.

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 3PE

See similar textbooks

Similar questions

C++ function Linked list Write a function, to be included in an unsorted linked list class, called replaceItem, that will receive two parameters, one called olditem, the other called new item. The function will replace all occurrences of old item with new item (if old item exists !!) and it will return the number of replacements done.
Grocery shopping list (linked list: inserting at the end of a list) Given main() in the ShoppingList class, define an insertAtEnd() method in the ItemNode class that adds an element to the end of a linked list. DO NOT print the dummy head node. Ex. if the input is: 4 Kale Lettuce Carrots Peanuts where 4 is the number of items to be inserted; Kale, Lettuce, Carrots, Peanuts are the names of the items to be added at the end of the list. The output is: Kale Lettuce Carrots Peanuts
Topic: Singly Linked ListImplement the following functions in C++ program. Read the question carefully. (See attached photo for reference) void isEmpty() This method will return true if the linked list is empty, otherwise return false. void clear() This method will empty your linked list. Effectively, this should and already has been called in your destructor (i.e., the ~LinkedList() method) so that it will deallocate the nodes created first before deallocating the linked list itself.
Exercise 1• Create a class that sorts a list in ascending order. Make use of the Collections method sort• The list should be a list of Strings.• Test your code with {“Hearts”, “Diamonds”, “Clubs”, “Spades”}• Before and after the sort, use the implicit call to the list’s toString method to output the list contents. Exercise 2• Create a class with the same requirement as in Exercise 1, but the sort should be in descending order• Make use of the Comparator interface• Make use of the static collection method reverseOrder java
class Node: def __init__(self, e, n): self.element = e self.next = n class LinkedList: def __init__(self, a): # Design the constructor based on data type of a. If 'a' is built in python list then # Creates a linked list using the values from the given array. head will refer # to the Node that contains the element from a[0] # Else Sets the value of head. head will refer # to the given LinkedList # Hint: Use the type() function to determine the data type of a self.head = None # To Do # Count the number of nodes in the list def countNode(self): # To Do # Print elements in the list def printList(self): # To Do # returns the reference of the Node at the given index. For invalid index return None. def nodeAt(self, idx): # To Do
7. ASK class DoublyLinkedList<E> {// define ListNode elements specific for this type of list, indicating current, previous and next// consider head as name for previous node, and tail for the next one.private ListNode<E> head;private ListNode<E> current;private ListNode<E> tail; // default constructorpublic DoublyLinkedList(){//*** Task #1: implement a default constructor here, initializing the nodes to null } // method that calculates the length of the listpublic int length(){//*** Task #2: implement the method navigating through the list until you run out of elements } // method that adds a node at the beginning of the listpublic void addANodeToStart(E addData){//*** Task #3: implement this method, taking into consideration that the head will be replaced by a new node. You may want to use a temporary variable } // accessor method that gets data at current nodepublic E getDataAtCurrent(){//*** Task #4: implement this method making sure to take into account…
C++ ProgrammingActivity: Deque Linked List Explain the flow of the code not necessarily every line, as long as you explain what the important parts of the code do. The code is already correct, just explain the flow. #include "deque.h" #include "linkedlist.h" #include <iostream> using namespace std; class DLLDeque : public Deque { DoublyLinkedList* list; public: DLLDeque() { list = new DoublyLinkedList(); } void addFirst(int e) { list->addAt(e,1); } void addLast(int e) { list->addAt(e,size()+1); } int removeFirst() { return list->removeAt(1); } int removeLast() { return list->removeAt(size()); } int size(){ return list->size(); } bool isEmpty() { return list->isEmpty(); } // OPTIONAL: a helper method to help you debug void print() {…
Purpose: The purpose of this: Design and develop Applications that incorporate fundamental data structures such as: Singly Linked Lists Doubly Linked Lists Circularly Linked Lists Exercise 1 If your first name starts with a letter from A-J inclusively: Add a method swapTwoNodes to SinglyLinkedList class from week 2 lecture examples. 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 swapTwoNodes method. Hint: You may need to traverse the list. If your first name starts with a letter from K-Z inclusively: Add a method swapTwoNodes to DoublyLinkedList class from week 2 lecture examples. 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…
Programming in C: Challenge 1: Create and Print a Doubly Linked List In class, I briefly mentioned how to create a doubly linked list (a linked list with two directions: forward and backwards). This task challenges you to create a doubly linked list of 5 nodes. If your nodes were called n1, n2, n3, n4 and n5 (which they shouldn’t, please give them original names), your list should be linked as follows: We discussed what "start" and "end" should be. Then, also in main, you will have to print the list forwards by taking advantage of the arrows pointing to the right. You will also have to print it backwards taking advantage of the arrows pointing to the left. Again, everything must be done in main. Hint: look at the way in which I printed the singly linked list in class. In other words, if your nodes had the values: n1=1, n2=2, n3=3, n4=4 and n5=5; your program should print:1 3 5 2 4 (forwards) and 4 2 5 3 1 (backwards). Please give different values to your nodes, they should not have…
linked_list_stack_shopping_list_manager.py This is a file that includes the class of linked list based shopping list manager. This class contains such methods as init, insert_item, is_list_empty, print_item_recursive_from_top, print_items_from_top, print_item_recursive_from_bottom, print_items_from_bottom, getLastItem, removeLastItem. In addition, this class requires the inner class to hold onto data as a linked list based on Stack. DO NOT use standard python library, such as deque from the collections module. Please keep in mind the following notes for each method during implementation: Init(): initializes linked list based on Stack object to be used throughout object life. insert_item(item): inserts item at the front of the linked list based on Stack. Parameters: item name. is_list_empty (): checks if the current Stack object is empty (ex. check if head is None). print_item_recursive_from_top(currentNode): a helper method to print linked list based on Stack item recursively. Note:…
Part 3: Building a Point of Sales (POS) linked list data structure. In a POS system, a transaction is based on items purchased by the customer. The following is an example of a customer transaction receipt, where the prices shown in the receipt are GST inclusive. Write a linked list classes (one class for Node and another class for List), which store the items in the transaction. Test the classes by printing the items in the linked list and show the total price of the transaction. The following listing is the sample output for your reference: ============================== BC Items Price ============================== 10 Pagoda Gnut 110g 3.49 11 Hup Seng Cream Cracker 4.19 12 Yit Poh 2n1 Kopi-o 7.28 13 Zoelife SN & Seed 5.24 14 Gatsby S/FO Wet&Hard 16.99 15 GB W/G U/Hold 150g 6.49 ============================== Total (GST Incl.) 43.68…
Tree Define a class called TreeNode containing three data fields: element, left and right. The element is a generic type. Create constructors, setters and getters as appropriate. Define a class called BinaryTree containing two data fields: root and numberElement. Create constructors, setters and getters as appropriate. Define a method balanceCheck to check if a tree is balanced. A tree being balanced means that the balance factor is -1, 0, or 1.