python code easy way pleasethe one that i provide the image with code is just starting code import pytestfrom typing import List# Accepts a list of integersdef initializeMinMaxList (myList: List[int]) -> None:myList.sort()# givendef insertItem(myList: List[int], item: int) -> None: # givenmyList.append (item)myList.sort()def getMinMax (myList: List[int], minormax: str) -> int:assert minormax.upper()=="MAX" or minormax.upper()=="MIN", "2nd argument must be 'Min' or 'Max' "result: intif minormax == "MAX":# given -- but requires additional assertresult - myList[-1]del mylist[-1]else:result = myList[0]del mylist[0]return result# Main function is given.def main():alist = [10, 11, 99, 1, 55, 100, 34, 88]print("Starting List: ", alist)initializeMinMaxList (alist)mini = getMinMax(alist, "MIN")print("1st min: %d" % (min1))min2 = getMinMax(alist, "MIN")print("2nd min: %d" % (min2))max1 = getMinMax (alist, "MAX")print("1st max: %d" % (max1))max2 = getMinMax (alist, "MAX")print("2nd max: %d" % (max2))print("Insert %d %d %d %d" % (min1 - 1, min2 - 1, max1 + 1, max2 + 1))insertItem(alist, mini -insertItem(alist, min2 - 1)insertItem(alist, max1 + 1)insertItem(alist, max2 + 1)1)mini = getMinMax (alist, "MIN")print("1st min: %d" % (min1))min2 = getMinMax(alist, "MIN")print("2nd min: %d" % (min2))max1 = getMinMax (alist, "MAX")print("1st max: %d" % (max1))max2 = getMinMax(alist, "MAX")print("2nd max: %d" % (max2))print("DONE. Please Enter to exit.")input()ifname_main_":main() (1) def test_getMinMaxCasel():This function will test a standard use case for our MinMaxList.(a) Create a list with two items that are different.(b) Call initializeMinMaxlist() with (a).(c) Use getMinMax () to get the mimimum item. Use an assert statement to check if this is correct. Errormessage should be "Min should be x", where x is the minimum item in the list specified in (a).(d) Use getMinMax() to get the maximum item. Use an assert statement to check if this is correct. Errormessage should be "Max should be y", where y is the maximum item in the list specified in (a).(2) def test_getMinMaxCase2():This function will test an edge case where the list only has a single item.(a) Create a list with only 1 item, let's call this item y.(b) Call initializeMinMaxlist() with (a).(c) Use getMinMax() to get the minimum item (which is y). Use an assert statement to check if this is correct.Error message should be "Min should be y", where y is the single item in your list in (a).(d) Use insertItem() to insert the same item y back into the list in (a).(e) Use getMinMax () to get the maximum item (which is y). Use an assert statement to check if this is correct.Error message should be "Max should be y", where y is the maximum item in the list specified in (a).(3) def test_getMinMaxCase3():This function will test an edge case where the list starts out empty.(a) Create an empty list.(b) Call initializeMinMaxlist() with (a).(c) Insert an item x into (a) using insertItem().(d) Insert an item y into (a) using insertItem(). Item y should be larger than x.(e) Use getMinMax () to get the minimum item. Use an assert statement to check if this is correct.Error message should be "Min should be x", where x is the minimum item inserted into (a).(f) Use getMinMax () to get the maximum item. Use an assert statement to check if this is correct.Error message should be "Max should be y", where y is the maximum item inserted into (a).(4) def test_getMinMaxRequestError()This function will test to see if getMinMax() properly causes an assertion error when the string argument is not correct.(a) Create a list(b) Call initializeMinMa(c) Call getMinMax() with a, but using "MID" instead of "MIN" or "MAX". This will cause getMinMax () to raise an AssertionError.with 3 items.) with (a).(d) Check if the AssertionError was raised. Assert on this condition, if the condition was not rasied, your error should be:"Should ralse AssertionError!"Continues on next page.Page 4/9(5) def test_getMinMaxEmptyError ():This function will test to see if getMinMax() properly causes an assertion error when the list is empty.(a) Create an empty list.(b) Call initializeMinMaxlist() with (a).(c) Call getMinMax(). If you did Task 1 correctly, this will cause getMinMax () to raise an AssertionError.(d) Check if the AssertionError was raised. Assert on this condition, if the condition was not rasie, your error should be:"Should raise AssertionError!"

Answered: python code easy way please the one…

Engineering

Computer Science

python code easy way please the one that i provide the image with code is just starting code

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

What is one possible consequence of leaving the mouse pointer on an irregular section of code for an extended period of time?
computer graphic in opengl
The mouse pointer will stay on a jagged line for a long time if you keep it there for a long time.
Python Programming Please use only numpy no other library like cv2 Or any other Write a python program that doesn't use any special libraries aside from numpy that takes an image.raw and performs histogram equalization and then exports it as a raw image
Python
JAVA LANGUAGE THANK YOU 2. Challenging Numerical Triangles by CodeChum Admin You probably have encountered Triangle pattern problems before when you started learning programming. Let’s see how well you do with numbers this time. Try to look at the examples closely and think of an algorithm that replicates the outputs. Go for it! Input A single line containing an integer n. 9 Output The output generated based on the inputted integer n. 1 23 456 789
USING "images" module from images import Image Write a python program, to create a collage of the same image at a minimum of four times and it can fit onto any background image you choose. One of those four copies must be the original picture. See examples on the next couple of pages.
U7
Directions: Code in Python and Code in Java/C++
Python Algorithms Part 1 – Binary SearchLet's play a little game to give you an idea of how different algorithms for the same problem can have wildly different efficiencies. If I choose an integer from 1 to 16 and ask you to guess what the number is, you can keep guessing numbers until you hit on it. When you guess wrong, I tell you whether you are too high or too low. Once you've guessed the number, think about the technique you used to decide each of your next guesses.If you guessed 1, then 2, then 3, then 4, and so on, until you guessed the right number, you used an approach called “linear search,” meaning you guessed the numbers serially and sequentially, as if they were lined up in a row. This is definitely one way to find the mystery number, but it could require as many as 16 guesses. However, you could get lucky, if the number was 1, you’d only need 1 guess. Using a linear search process, on average, you'd need 8 guesses.There is an approach that is more efficient than just…
Python
Python: Vowel: Display a vowel selected at random.