{"id":1192,"date":"2020-09-03T02:07:34","date_gmt":"2020-09-03T02:07:34","guid":{"rendered":"http:\/\/learnlearn.uk\/python\/?page_id=1192"},"modified":"2023-11-20T05:41:21","modified_gmt":"2023-11-20T05:41:21","slug":"python-functions-exercises","status":"publish","type":"page","link":"https:\/\/learnlearn.uk\/python\/python-functions-exercises\/","title":{"rendered":"Python Functions Exercises"},"content":{"rendered":"
\n

Exercise 1<\/h2>\n
\n\n

Functions Challenge 1 – Kilometers\u00a0to miles\u00a0converter<\/h3>\n

Write a function called km_to_miles<\/strong> that takes kilometers as a parameter, converts it into miles and returns the result.<\/p>\n

 <\/p>\n

 <\/p>\n

 <\/p>\n\n<\/div>

2<\/h2>\n
\n\n

Functions Challenge 2 – Divisible by 11 checker<\/h3>\n

Write a function called is_divisable_by_11<\/strong> that takes an integer as an parameter and returns whether it is divisible by 11 or not.<\/p>\n

 <\/p>\n

 <\/p>\n

 <\/p>\n\n<\/div>

3<\/h2>\n
\n\n

Functions Challenge 3 – Highest number<\/h3>\n

Write a function called get_highest<\/strong> that takes 2 numbers as parameters and returns the highest of the 2 numbers.<\/p>\n

 <\/p>\n

 <\/p>\n

 <\/p>\n\n<\/div>

4<\/h2>\n
\n\n

Functions Challenge 4 – Hexagon area calculator<\/h3>\n

Write a function called hexagon_area<\/strong> that takes the length of a side of a regular hexagon as a parameter and returns the area of the hexagon.<\/p>\n

Hint: Video for area of a hexagon calculation<\/a><\/p>\n

 <\/p>\n\n<\/div>

5<\/h2>\n
\n\n

Functions Challenge 5 – Sleeps until Christmas<\/h3>\n

Write a function called sleeps_until_xmas<\/strong> that calculates how many days it is until Christmas and returns the number of sleeps left until the big day.<\/p>\n

 <\/p>\n

You may want to use the Datetime module<\/a> to help you.<\/p>\n

 <\/p>\n

 <\/p>\n\n<\/div>

6<\/h2>\n
\n\n

Functions Challenge 6 – Is a palindrome?<\/h3>\n

Create a function called is_palindrone<\/strong> that checks to see if a given string is a palindrome or not.<\/p>\n

 <\/p>\n

 <\/p>\n

You might want to take a look at the String methods video for<\/a> some help.<\/p>\n

 <\/p>\n

 <\/p>\n\n<\/div>

7<\/h2>\n
\n\n

Functions Challenge 7 – Fuel cost calculator<\/h3>\n

Write a function called fuel_cost<\/strong> that takes a distance as a required argument, mpg (default 50 mpg) and fuel cost (default $1 a litre) as optional arguments. The function should return the cost in dollars.<\/p>\n\n<\/div>

8<\/h2>\n
\n\n

Functions Challenge 8 – Most common character<\/h3>\n

Create a function called most_common_char<\/strong> that takes a string as a argument and the returns the most common character in that string.<\/p>\n

 <\/p>\n

 <\/p>\n

 <\/p>\n

 <\/p>\n\n<\/div>

9<\/h2>\n
\n\n

Functions Challenge 9 – Is a prime number?<\/h3>\n

Write a function called is_prime<\/strong> that takes an integer as an argument and checks if it is a prime number or not, returning a Boolean.<\/p>\n

 <\/p>\n

 <\/p>\n

 <\/p>\n\n<\/div>

10<\/h2>\n
\n\n

Functions Challenge 10- All Prime numbers<\/h3>\n

Write a function called primes<\/strong> that takes an integer value as an argument and returns a list of all prime numbers up to that number.<\/p>\n

Hint: You might want to use <\/span>modulo <\/span><\/a><\/p>\n

 <\/p>\n

 <\/p>\n\n<\/div>

11<\/h2>\n
\n\n

Functions Challenge 11 – Highest Common Factor<\/h3>\n

Write a function called hcf<\/strong> that takes 2 integer values and returns the highest common factor of the numbers.<\/p>\n

 <\/p>\n\n<\/div>

12<\/h2>\n
\n\n

Functions Challenge 11 – Valid Date<\/h3>\n

Write a function called is_valid_date<\/strong> that takes a date in string format DD\/MM\/YYYY and checks to see if it is a valid date and in the correct format.<\/p>\n

Your function should take account of leap years.<\/p>\n

 <\/p>\n

You may want to look at the date conversion video<\/a> for help.<\/p>\n

 <\/p>\n\n<\/div>

13<\/h2>\n
\n\n

Functions Challenge 13 – Postcode Checker<\/h3>\n

Write a function called is_valid_postcode<\/strong> that takes a post code as an argument and returns whether it is a valid post code.\u00a0<\/span><\/p>\n

Valid format:<\/span><\/p>\n

[2 letters]\u00a0 [1 or 2 Digits] [Space] [1 Digit] [2 letters]<\/strong><\/p>\n

(This is a slight simplification from the real UK postcode system to make the challenge a little easier – otherwise you would need to use a pretty complicate regular expression<\/a>)<\/span><\/p>\n

 <\/p>\n

Hint: You might want to use on or more of the follow:<\/span><\/p>\n