C Programming question

1. Write a C program that can compute the addition or the multiplication of two polynomials of any degree. The polynomials are stored on files with the following format: Each row of the file represents one of the terms of the polynomial. Each row includes a positive integer followed by a real number. The positive integer represents the exponent of the term and the real number represents the coefficient of the term. The terms are sorted in descending degree order. For example, the polynomial 3.2 x3 + x + 1.5 can be represented by the following file: 3 3.2 1 1.0 0 1.5 The program must input from the keyboard the names of two files containing two polynomials, then it must input the operation to be performed (addition or multiplication) and the name of a third file where the result must be written. Finally the program must compute the result polynomial and write it to the specified file. What is the time complexity of your program for computing addition and multiplication of two ndegree polynomials? What would be the complexity if the terms of the polynomials were not sorted? [login to view URL] a C program that manages a queueing service for a post office, according to the following specifications. The post office has exactly N desks, each one enabled to provide a different service, where N is a constant in the program. The desks (and the corresponding services) are numbered from 0 to N-1. The program must manage N separate queues of customers, one for each service, and keep track of the customers’ arrival order The program must communicate by a menu including the following three items: • A service • S service • Q where service is a service number (in the range from 0 to N-1). When a new customer arrives at the office, the A service command is entered, where service is the requested service. The program, upon receiving this command, will assign a progressive integer number to the customer (each customer gets a number that is the successor of the number assigned to the previous customer who entered the office) and will queue the customer in the queue for that service. When one of the desks in the office becomes available to serve a new customer, the S service command is given. In response to this command, the program must print the number of the next customer to be served (the one who arrived first among those waiting for the specified service) and remove the customer from the queue. When the Q command is given, the program must print the maximum length that the queue of each service has reached during the whole program execution and then quit. At program startup the queues are empty. There is no upper bound on the number of waiting customers. Explain the data structures used in this program and how they have been selected. [login to view URL] a C program that reads a file containing information about direct flights connecting a set of airports. Each line in the file has the following format: <flight number> <departure airport code> <destination airport code> where the flight numbers are strings of up to 6 characters and the airport codes are strings of 3 characters. The C program must be able to manage files with a maximum of N different airports, and with any number of flights. The program must compute and write, for each different airport occurring in the file, the list of airports that are directly reachable from that airport and the list of airports from which it can be directly reached. What is the worst-case time complexity of the algorithm used by your program? 4. look file lab 7.