Implement a Polynomial ADT using Linked Lists, Please Implement the Multiplication, Addition, and Subtraction operations of polynomials. Program in (C-Language) should be able to read a file of polynomials called equations.txt and store each equation in a doubly-linked list. Once the file is read and equations are loaded into the linked lists, the user should be able to perform mathematical operations on the polynomials (addition, subtraction, and multiplication). Once the user select an operation through a menu, the output should be displayed and then the menu should show again. Another option for the user is to store the results of all operations in a file called results.txt. The application should show an appropriate screen with menu options to inform the user of the available operations to let choose from. Example of input file: 2x^7+10x^5-10x^3+2x+1 -15x^7-10x^5+90x^2-2 2x^2 +x-1 Upon user selection, the application should show the output of the operation performed (i.e., Addition, Subtraction, or Multiplication). The user then should have an option to enter a value of the variable term in the equation to substitute. Upon user selection, the application should show the output of the operation performed (i.e., Addition, Subtraction, or Multiplication). The user then should have an option to enter a value of the variable term in the equation to substitute.

Using c++ Contact list: Binary Search   A contact list is a place where you can store a specific contact with other associated information such as a phone number, email address, birthday, etc. Write a program that first takes as input an integer N that represents the number of word pairs in the list to follow. Word pairs consist of a name and a phone number (both strings). That list is followed by a name, and your program should output the phone number associated with that name. Define and call the following function. The return value of FindContact is the index of the contact with the provided contact name. If the name is not found, the function should return -1 This function should use binary search. Modify the algorithm to output the count of how many comparisons using == with the contactName were performed during the search, before it returns the index (or -1). int FindContact(ContactInfo contacts[], int size, string contactName) Ex: If the input is: 3 Frank 867-5309 Joe…

Java - Elements in a Range

Please do it on c++ don't use stl function must read the instruction

Complete the reverse_list() function that returns a new string list containing all contents in the parameter but in reverse order. Ex: If the input list is: ['a', 'b', 'c'] then the returned list will be: ['c', 'b', 'a'] Note: Use a for loop. DO NOT use reverse() or reversed(). This is my code so far: def reverse_list(letters):    for x in (letters):        letters.sort(reverse=True)        return lettersif __name__ == '__main__':    ch = ['a', 'b', 'c']    print(reverse_list(ch)) # Should print ['c', 'b', 'a'] When submitting I get 4/10 and it says: Test input list ['a', 'b', 'c'] returns ['c', 'b', 'a'] Your output reverse_list() function reversed array incorrectly: ['c', 'b', 'a'] reverse_list() function should have returned: ['a', 'b', 'c']   Test input list ['a', 'b', 'c', 'd'], first element of returned list is ['d'] Your output First character of returned array should be a instead of d   Test empty input array TypeError: object of type 'NoneType' has no len()

In python

You will create two programs. The first one will use the data structure Stack and the other program will use the data structure Queue. Keep in mind that you should already know from your video and free textbook that Java uses a LinkedList integration for Queue. Stack Program Create a deck of cards using an array (Array size 15). Each card is an object. So you will have to create a Card class that has a value (1 - 10, Jack, Queen, King, Ace) and suit (clubs, diamonds, heart, spade). You will create a stack and randomly pick a card from the deck to put be pushed onto the stack. You will repeat this 5 times. Then you will take cards off the top of the stack (pop) and reveal the values of the cards in the output. As a challenge, you may have the user guess the value and suit of the card at the bottom of the stack. Queue Program There is a new concert coming to town. This concert is popular and has a long line. The line uses the data structure Queue. The people in the line are objects…

A sequential search of a sorted list can halt when the target is less than a given element in the list. Modify the program to stop when the target becomes less than the current value being compared. In a sorted list, this would indicate that the target is not in the list and searching the remaining values is unnecessary.   -----------------------------------------------------------------------------------   """ File: search.py Project 11.1 """ def sequentialSearch(target, lyst):     """Returns the position of the target item if found,     or -1 otherwise.     The lyst is assumed to be sorted in ascending order."""     position = 0     while position < len(lyst):         if target == lyst[position]:             return position         position += 1     return -1 def main():     """Tests with three lists."""     print(sequentialSearch(3, [0, 1, 2, 3, 4]))     print(sequentialSearch(3, [0, 1, 2]))     # Should stop at second position.     print(sequentialSearch(3, [0, 4, 5, 6])) if…

in c++ please paste working code. the program should  Input- Julia Lucas Mia -1 With an expected output of-  Julia Lucas Mia Julia Mia Lucas Lucas Julia Mia Lucas Mia Julia Mia Julia Lucas Mia Lucas Julia

This is a pyhton , Coding the screenshot better explains. It  talks about list