Answer using Jupyter Python

#Prompt the user to enter a passing grade and store the value from
#the input() into a variable.

#Refer to the variable in problem 2 to complete the following:
#Use the if statement to evaluate the only the first element in the
#grades list using index notation.
#If the grade is passing, display PASSED, otherwise display FAILED.

"""Problem 1d"""
#Use the for statement to iterate on each element in the
#grades list (from problem 1a) and displays each value.
#Specifically, for each grade in the grades list, if the grade is
#passing (referring to problem 1b), then display PASSED, otherwise display FAILED.

"""Problem 2a"""
#Create a function that will evaluate if each grade in a list is considered
#passing or failing. [hint: use the for statement and if...else together]
#Store the total number of passing and failing grades in their own respective variables.
#The function should return a dictionary with two key-value pairs where the keys are
# the words PASSED and FAILED mapped to their total counts variable.

"""Problem 2b"""
#Call the function and pass in the grades list (from problem 1a) as an argument.

1. Implement the function calculate_score that consumes three parameters, two strings and a list. The strings will each be ONE character and will represent a nucleotide. The list will be a nested int list representing a 4x4 score matrix. This function will return the value (int) from the nested int list at the location of the two referenced nucleotides.

a. An example call to calculate_score would be calculate_score(“A”, “T”, score_matrix). If we look at the alignment score table in the background section we can see that the cell at column “A” and row “T” holds the value 6. Similarly, if we consider this location via the indexes in score_matrix, we can use the index call score_matrix[1][2] to reach the value.

b. We can assume that the score matrix will always be a 4x4 nested int list in the same order as the matrix shown above.

c. You can use this index dictionary in your code for reference, or implement some other way to associate the string arguments to the appropriate index locations: {"G":0, "A":1, "T":2, "C":3}

d. Write three assert_equal statements.

In Python language

Write in Java! (Not Javascript)

Consider the LinkedList class we discussed in class (see the slides for lecture 8). Add the following methods to the class and submit the completed LinkedList class.

• int size() which returns the size of the linked list
• Link getElementByIndex(int index) which returns the Link/node specified by the index. For example, getElementByIndex(0) should return the first Link, getElementByIndex(2) should return the third Link. If index is not in range, your method should return null.
• boolean hasDuplicate() which returns true if the linked list contains duplicate data, returns false if there is no duplicate data in the list.
• Link reverse() which reverses the linked list and returns the new head/first of the linked list (which is of type Link)

your file to be submitted to Gradescope should be named LinkedList.java. and here is the skeleton:

class Link

{

    public int data; // assuming integer data

    public Link next; // reference to the next Link

    //--------------------------------------------------------------

    // Constructor

    public Link(int data)

    {

        this.data = data;

        next = null;

    }

}

public class LinkedList

{

// implement this class

}

The following tables form part of a database held in a relational DBMS:

Hotel (hotelNo, hotelName, hotelAddress, country)

Room (roomNo, hotelNo, type, price)

Guest (guestNo, guestName, guestAddress, country)

Booking (hotelNo, guestNo, dateFrom, dateTo, roomNo)

Write the SQL statements for the following questions:

1. List the rooms that are currently unoccupied at the Grosvenor Hotel, for:

(a) Use 2019-10-01 as today's date. Include all 'Grosvenor' hotels. List in hotelNo, roomNo order. Use NOT IN to perform the difference operation

(b) Use 2019-10-01 as today's date. Include all 'Grosvenor' hotels. List in hotelNo, roomNo order. Use NOT EXISTS to perform the difference operation.

(c) Use 2019-10-01 as today's date. Include all 'Grosvenor' hotels. List in hotelNo, roomNo order. Use LEFT JOIN to perform the difference operation.

(d) Use 2019-10-01 as today's date. Include all 'Grosvenor' hotels. List in hotelNo, roomNo order. Use MINUS to perform the difference operation.

***JAVA PROGRAM

Write a method called shrink that accepts an array of integers (that the user inputs) as a parameter and returns a new array containing the result of replacing each pair of integers with the sum of that pair. For example, if an array called list stores the values {7, 2, 8, 9, 4, 15, 7, 1, 9, 10}, then the call of shrink(list) should return a new array containing {9, 17, 19, 8, 19}.

The first pair from the original list is shrunken into 9 (7 + 2),

the second pair is shrunken into 17 (8 + 9), and so on.

If the list stores an odd number of elements, the final element is not collapsed. For example, if the list had been {1, 2, 3, 4, 5}, then the call would return {3, 7, 5}. Your method should not change the array that is passed as a parameter.

Be sure to have a shrink() method

*All variable names are completely up to you, as long as they’re descriptive

*Use the correct data types

*Use comments to explain what you’re coding

*Put your name in a comment

Write a MIPS program to implement the Bubble Sort algorithm, that sorts an input list of

integers by repeatedly calling a “swap” subroutine.

The original unsorted list of integers should be received from the keyboard input. Your program should first prompt the user “Please input an integer for the number of elements:”. After the user enters a number and return, your program outputs message “Now input each element and then a return:”. For example, if the user enters 8 as the number of integers, and then the sequence of integers one by one: 6,5,9,1,7,0,-3,2,-8, it should display “The elements are sorted as: -8, -3, 0, 1, 2, 4, 6, 7, 9” (the output sequence of integers should be either space-separated or comma-separated).

The final sorted list (in increasing order) should be stored in the data area, that starts with the label "list:".

You should NOT implement a different sorting algorithm (e.g. mergesort or quick sort). You will receive 0% if your program does not call subroutine "swap", or if your sorted list is in decreasing order.

Ann obtains a fully amortizing 30 year Fixed Rate Mortgage with monthly payments for $4,500,000 at 4.38%. What percent of Ann’s 20^th payment goes to interest?

If Ann obtains a fully amortizing 30 year Fixed Rate Mortgage with monthly payments for $4,500,000 at 4.38%. What percent of Ann’s 20^th payment goes to principal?v