Python Answers

 Write a function called missing_letters that takes a string parameter and returns a new string with all the letters of the alphabet that are not in the argument string. The letters in the returned string should be in alphabetical order. 

Your implementation should use a histogram from the histogram function. It should also use the global variable alphabet. It should use this global variable directly, not through an argument or a local copy. It should loop over the letters in alphabet to determine which are missing from the input parameter. 

The function missing_letters should combine the list of missing letters into a string and return that string. 

Write a loop over the strings in list test_miss and call missing_letters with each string. Print a line for each string listing the missing letters.

QUESTION NOT COMPLETE BUT TO BE CONTINUED...

Write a function n called is_descending that takes a list of numbers and returs True if the elements are in descending order and False if not. It should just check the users input if its in descending order and returns true if it is and if not false    

Write a program that reads integers from the user and stores them in a list. Yourprogram should continue reading values until the user enters 0. Then it should display all of the values entered by the user (except for the 0) in order from smallest to largest,with one value appearing on each line. 

 Write a program ( using loop ) that reads five marks and computes the average. Use the sample code from today’s lesson on adding three numbers to help you get started. 

b) Modify the program to also output the lowest and highest mark. 

c) Modify the program to check if the mark entered is between 0 and 100. 

d) Modify the program to ask the user to enter -1 when done entering marks. 

e) Write the same program using Try and except statement  

 Write a program using function called remove_duplicates that takes a list and returns a new list with only the unique elements from the original list. For example remove_duplicates([1, 2, 3, 3, 4, 2, 1, 5]) would return [1, 2, 3, 4, 5]. 

Write a program using function called cumulative_sum that takes a list of numbers and returns the cumulative sum; that is, a new list where the nth element is the sum of the first n elements from the original list. For example, the cumulative sum of [1, 2, 3] is [1, 3, 6]. 

1. Write a pseudocode a function called fibonacci that determines the first n terms of the Fibonacci sequence. The function should take n as an argument and return a list of the first n terms of the Fibonacci sequence. 

You are given a square matrix A of dimensions NxN. You need to apply the below given 3 operations on the matrix A.

Rotation: It is represented as R S where S is an integer in {90, 180, 270, 360, 450, ...} which denotes the number of degrees to rotate. You need to rotate the matrix A by angle S in the clockwise direction. The angle of rotation(S) will always be in multiples of 90 degrees.

Update: It is represented as U X Y Z. In initial matrix A (as given in input), you need to update the element at row index X and column index Y with value Z.

After the update, all the previous rotation operations have to be applied to the updated initial matrix.

Querying: It is represented as Q K L. You need to print the value at row index K and column index L of the matrix A.

Input

The system shall allow the technician to perform the following operations until the option 5 (exit system) is selected: 1) Add a new order 2) Retrieve an order 3) Deliver an order 4) Print summary report 5) Exit system

Add a new order

The user will add a new cake order request into the system. The system shall store the following cake information into a binary heap. The bakery shop will always prepare an order with nearest delivery date/time. 1. Order ID: Auto generated unique ID to each new job created. 2. Expected delivery Date and time: Delivery date and time 3. Name of the cake: Name based on the flavour of the cake. For example, cheese cake, black forest and etc. 4. Weight: Weight of the cake (0.5kg, 1kg, 2kg) 5. Price: Price of the cake. 6. Status: Status of the order, shall set to “new” when a new order is created.

Note: No built-in classes of the data structure (heap, queue and stack) are allowed. 

Given polynomial, write a program that prints polynomial in Cix^Pi + Ci-1x^Pi-1 + .... + C1x + C0 format.