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.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

T/F 11) An array, when instantiated, is fixed in size, but an ArrayList can dynamically change in size when new elementsare added to it.
Use stack concepts Q #2 Ô https://www.loc-cs.org/~chu/DataStructu Essay Questions (20% each)- continue [0] [1] [2] [3] myList "Bashful" "Awful" Jumpy "Happy The above "myList" is an ArrayList in Java program. 2. If I want to remove "Awful" from myList, which of the following actions should I take first? a. Move "Happy" to the previous element first. b. Move "Jumpy" to the previous element first. Describe the reason of your choice. Next Page
JAVA programming language
C++ Data Structure:Create an AVL Tree C++ class that works similarly to std::map, but does NOT use std::map. In the PRIVATE section, any members or methods may be modified in any way. Standard pointers or unique pointers may be used.** MUST use given Template below: #ifndef avltree_h#define avltree_h #include <memory> template <typename Key, typename Value=Key> class AVL_Tree { public: classNode { private: Key k; Value v; int bf; //balace factor std::unique_ptr<Node> left_, right_; Node(const Key& key) : k(key), bf(0) {} Node(const Key& key, const Value& value) : k(key), v(value), bf(0) {} public: Node *left() { return left_.get(); } Node *right() { return right_.get(); } const Key& key() const { return k; } const Value& value() const { return v; } const int balance_factor() const {…
Array_based circular queue: Define the class Queue using one dimensional circular array representation with no implementation; i.e. declare the data members, and the function members only (Enqueue, Dequeue, IsEmpty, GetHead etc.). Implement the Ennqueue method of the above class
5. List Member Deletion Modify the list class you created in the previous programming challenges by adding a function to remove an item from the ist and by adding a destructor: void zemove (double x) : Linkedtist (02 Test the class by adding a sequence of instructions that mixes operations for adding items, removing items, and printing the list.
Data Structure & Algorithm: Show by fully java coded examples how any two sorting algorithms work. You should test these with various array sizes and run them several times and record the execution times. At least four array sizes are recommended. 15, 20, 25, 30. It is recommended you write the classes and then demonstrate/test them using another class. Discuss the comparative efficiencies of your two chosen sorting algorithms.
Topic: Doubly Linked List Deque Implement the following problem in the main case 0 (see attached photo) Your algorithm for the hierarchy problem should follow this: Evaluate the final set of operations first given the set of rules. Then, do the remove operations. Finally, do the add operations. DO NOT MIND THE #include "dlldeque.h" it is already implemented only the case 0 needs to be solved #include <iostream> #include <cstring> #include "dlldeque.h" using namespace std; int main(int argc, char** argv) { DLLDeque* deque = new DLLDeque(); int test; cin >> test; switch (test) { case 0: // perform your Hierarchy implementation here // utilize the deque initialized, // initialize variables you need before switch // you can use the print() method to debug, but not the final_print() // do not modify from this point onwards deque->final_print();…
PLEASE CODE IN PYTHON PLEASE USE NESTED CLASS FUNCTION Design a Point Class with attributes X and Y coordinates. The Class should have following functions: a) change the coordinates, b) return a 2 element list [x,y] c) print a Point object. d) return distance from this instance to a given [x,y] Also design a Line Class which has 2 Point attributes. The Line class should have functions for following behaviours: a) Return the length of the line. b) Print the equation of the line c) Find if this instance is equal in length to another line.
Java - Gift Exchange *** Please include UML Diagram and notes in code Minimum requirements are: At least 1 loop An Array or ArrayList At least 3 Java classes Use methods I am trying to make it so that the program will: Prompt for the number of people included in exchange - If not even it will state that there has to be an even number and ask for the number of people included again (loops). Prompt to enter a participant's first name Prompt for the participant's age Print out the random matching of participants so that everyone gets a gift and everyone gives a gift. Please include UML Diagram
C++ please
Computer science