python code easy way please the one that i provide the image with code is just starting code
python code easy way please the one that i provide the image with code is just starting code
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
python code easy way please
the one that i provide the image with code is just starting code
![import pytest
from typing import List
# Accepts a list of integers
def initializeMinMaxList (myList: List[int]) -> None:
myList.sort()
# given
def insertItem(myList: List[int], item: int) -> None: # given
myList.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: int
if minormax == "MAX":
# given -- but requires additional assert
result - 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()
if
name
_main_":
main()](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fdb149631-7aca-418e-8f94-0d5f70bfeb88%2Fa4f3139c-2b07-4b21-858b-d5f0014318b1%2Fuiflcjm_processed.png&w=3840&q=75)
Transcribed Image Text:import pytest
from typing import List
# Accepts a list of integers
def initializeMinMaxList (myList: List[int]) -> None:
myList.sort()
# given
def insertItem(myList: List[int], item: int) -> None: # given
myList.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: int
if minormax == "MAX":
# given -- but requires additional assert
result - 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()
if
name
_main_":
main()
![Modify the function getMinMax(List[int], str) to include an assert statement to check the pre-condition that the list is
not empty. There is already an assert checking if the str is either "MIN" or "MAX".](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fdb149631-7aca-418e-8f94-0d5f70bfeb88%2Fa4f3139c-2b07-4b21-858b-d5f0014318b1%2Fuh8jn8j_processed.png&w=3840&q=75)
Transcribed Image Text:Modify the function getMinMax(List[int], str) to include an assert statement to check the pre-condition that the list is
not empty. There is already an assert checking if the str is either "MIN" or "MAX".
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 1 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
![Concepts of Database Management](https://www.bartleby.com/isbn_cover_images/9781337093422/9781337093422_smallCoverImage.gif)
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
![Prelude to Programming](https://www.bartleby.com/isbn_cover_images/9780133750423/9780133750423_smallCoverImage.jpg)
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
![Sc Business Data Communications and Networking, T…](https://www.bartleby.com/isbn_cover_images/9781119368830/9781119368830_smallCoverImage.gif)
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY