(2) find_mode () #you have to determine the signature Description: Design and write a function called find_mode() which determines which element(s) from a list occurs the most. The mode is returned as a list, with one or more elements in it. (If there is a tie for the most-occurring, then both/all must be in the list.) If the list is empty, the mode is and empy list. Parameters: (read the description carefully) Return value: (read the description carefully) Assumptions: The items in the list are the same data type. • The list is non-empty. Examples: [12] find_mode ([12, 11, 12, 3, 6, 7, 91) find mode (["hat", "sweater", "pants", "sock"]) → ["hat", "sweater", "pants", "sock"] find_mode ([11.4, 9.9, 13.0, 77.1, 11.4, 13.0, 9.9, 15.881) [9.9, 11.4, 13.0] [1,2,3,4,5] find_mode ([1,2,3,4,5])

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...
icon
Related questions
Question

2A in Python language please:

 

User Defined Functions and Recursion
Background
The purpose of this Programming is to practice writing function definitions, using functions inside of
other functions, and using recursion to solve complex problems.
Restrictions
Any function that violates the following:
• You are not allowed to import anything
•
You are not allowed to use the global keyword, nor should you have any global variables. (In
other words, do not create any variables outside of a function definition.
You are not allowed to use slicing (except for the 5th function add_chars)
•
No built-in function except round(), range(), and len() is allowed
• From list methods, you are allowed to use .append(), .insert(),.remove(), or del
•
From dictionary methods, you are allowed to use .keys(), .values(),.items()
Testing
In addition to the examples in the tester file, you should also devise your own test cases for your code.
Develop additional test cases, on your own, to make sure that you haven't missed anything (empty lists,
different sized lists, etc) and your code is correct. The goal is to keep your focus on writing correct code.
Functions
In this Programming, you will be writing and calling a handful of functions (five). From the description,
you will generate the signature, and function body for each function. (The examples can give you hints
about the signatures!)
Transcribed Image Text:User Defined Functions and Recursion Background The purpose of this Programming is to practice writing function definitions, using functions inside of other functions, and using recursion to solve complex problems. Restrictions Any function that violates the following: • You are not allowed to import anything • You are not allowed to use the global keyword, nor should you have any global variables. (In other words, do not create any variables outside of a function definition. You are not allowed to use slicing (except for the 5th function add_chars) • No built-in function except round(), range(), and len() is allowed • From list methods, you are allowed to use .append(), .insert(),.remove(), or del • From dictionary methods, you are allowed to use .keys(), .values(),.items() Testing In addition to the examples in the tester file, you should also devise your own test cases for your code. Develop additional test cases, on your own, to make sure that you haven't missed anything (empty lists, different sized lists, etc) and your code is correct. The goal is to keep your focus on writing correct code. Functions In this Programming, you will be writing and calling a handful of functions (five). From the description, you will generate the signature, and function body for each function. (The examples can give you hints about the signatures!)
(2) find_mode ()
#you have to determine the signature
Description: Design and write a function called find_mode() which determines which element(s)
from a list occurs the most. The mode is returned as a list, with one or more elements in it. (If
there is a tie for the most-occurring, then both/all must be in the list.) If the list is empty, the
mode is and empy list.
Parameters: (read the description carefully)
Return value: (read the description carefully)
Assumptions:
• The items in the list are the same data type.
• The list is non-empty.
Examples:
[12]
find_mode ([12, 11, 12, 3, 6, 7, 9])
find_mode (["hat", "sweater", "pants", "sock"])
→ ["hat", "sweater", "pants", "sock"]
find_mode ([11.4, 9.9, 13.0, 77.1, 11.4, 13.0, 9.9, 15.881)
[9.9, 11.4, 13.0]
find_mode ([1,2,3,4,5]) [1,2,3,4,5]
Transcribed Image Text:(2) find_mode () #you have to determine the signature Description: Design and write a function called find_mode() which determines which element(s) from a list occurs the most. The mode is returned as a list, with one or more elements in it. (If there is a tie for the most-occurring, then both/all must be in the list.) If the list is empty, the mode is and empy list. Parameters: (read the description carefully) Return value: (read the description carefully) Assumptions: • The items in the list are the same data type. • The list is non-empty. Examples: [12] find_mode ([12, 11, 12, 3, 6, 7, 9]) find_mode (["hat", "sweater", "pants", "sock"]) → ["hat", "sweater", "pants", "sock"] find_mode ([11.4, 9.9, 13.0, 77.1, 11.4, 13.0, 9.9, 15.881) [9.9, 11.4, 13.0] find_mode ([1,2,3,4,5]) [1,2,3,4,5]
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps with 2 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
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…
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)
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
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY