Uncategorized
In this task, you will create a function find_longest_words with three parameters in the file uke_02_oppg_1.py. The function prints the longest words. If several words have the longest length, the program must print all the words. For example, a call to find_longest_words(-Game-, -Action-, -Champion-) will print while a call to find_longest_words(-apple-, -carrot-, -pineapple-) will print and a call to find_longest_words(-Four-, -Five-, -Nine-) will print Task 2 The rule for calculating whether a year is a leap year or not is as follows: Usually, a year divisible by 4 is a leap year (for example, 1996 was a leap year); except for years that are also divisible by 100 (for example, 1900 is not a leap year); but if the year that is divisible by 100 is also divisible by 400, then it is still a leap year (for example, 2000 is a leap year). n the file uke
Read this week’s course notes. Read the first part of Chapter 2 (up to -while loop statements-) in Automate the Boring Stuff with Python.…