in python please - all functions should be recursive and not include for/while loops get_count(aList, item) Returns the number of times item appears in aList. You cannot make any assumptions about the contents of the list. You are not allowed to use any count methods from the Python library. Input list aList A list of elements of any type many item An object of any type Output int Recurrence of item in aList >>> get_count([1,4,3.5,'1',3.5, 9, 1, 4, 2], 1) 2 >>> get_count([1,4,3.5,'1',3.5, 9, 4, 2], 3.5) 2 >>> get_count([1,4,3.5,'1',3.5, 9, 4, 2], 9) 1 >>> get_count([1,4,3.5,'1',3.5, 9, 4, 2], 'a') 0
in python please - all functions should be recursive and not include for/while loops get_count(aList, item) Returns the number of times item appears in aList. You cannot make any assumptions about the contents of the list. You are not allowed to use any count methods from the Python library. Input list aList A list of elements of any type many item An object of any type Output int Recurrence of item in aList >>> get_count([1,4,3.5,'1',3.5, 9, 1, 4, 2], 1) 2 >>> get_count([1,4,3.5,'1',3.5, 9, 4, 2], 3.5) 2 >>> get_count([1,4,3.5,'1',3.5, 9, 4, 2], 9) 1 >>> get_count([1,4,3.5,'1',3.5, 9, 4, 2], 'a') 0
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
in python please - all functions should be recursive and not include for/while loops
get_count(aList, item)
Returns the number of times item appears in aList. You cannot make any assumptions about the
contents of the list. You are not allowed to use any count methods from the Python library.
Input
list aList A list of elements of any type
many item An object of any type
Output
int Recurrence of item in aList
>>> get_count([1,4,3.5,'1',3.5, 9, 1, 4, 2], 1)
2
>>> get_count([1,4,3.5,'1',3.5, 9, 4, 2], 3.5)
2
>>> get_count([1,4,3.5,'1',3.5, 9, 4, 2], 9)
1
>>> get_count([1,4,3.5,'1',3.5, 9, 4, 2], 'a')
0
replace(numList, old, new)
Returns a copy of numList with all the occurrences of old replaced by new. The process should not
mutate the original list (alter the memory block referenced by numList). You can assume numList
is a list of numbers and that old and new are either int or float. You are not allowed to use any
replace methods from the Python library.
Input
list numList A list of numbers
int/float old A number
int/float new A number
Output
list Copy of numList with all the occurrences of old replaced by new
>>> input_list = [1, 7, 5.6, 3, 2, 4, 1, 9]
>>> replace(input_list, 1, 99.9)
[99.9, 7, 5.6, 3, 2, 4, 99.9, 9]
>>> input_list
[1, 7, 5.6, 3, 2, 4, 1, 9]
>>> replace([1,7, 5.6, 3, 2, 4, 1, 9], 5.6, 777)
[1, 7, 777, 3, 2, 4, 1, 9]
>>> replace([1,7, 5.6, 3, 2, 4, 1, 9], 8, 99)
[1, 7, 5.6, 3, 2, 4, 1, 9]
Returns the number of times item appears in aList. You cannot make any assumptions about the
contents of the list. You are not allowed to use any count methods from the Python library.
Input
list aList A list of elements of any type
many item An object of any type
Output
int Recurrence of item in aList
>>> get_count([1,4,3.5,'1',3.5, 9, 1, 4, 2], 1)
2
>>> get_count([1,4,3.5,'1',3.5, 9, 4, 2], 3.5)
2
>>> get_count([1,4,3.5,'1',3.5, 9, 4, 2], 9)
1
>>> get_count([1,4,3.5,'1',3.5, 9, 4, 2], 'a')
0
replace(numList, old, new)
Returns a copy of numList with all the occurrences of old replaced by new. The process should not
mutate the original list (alter the memory block referenced by numList). You can assume numList
is a list of numbers and that old and new are either int or float. You are not allowed to use any
replace methods from the Python library.
Input
list numList A list of numbers
int/float old A number
int/float new A number
Output
list Copy of numList with all the occurrences of old replaced by new
>>> input_list = [1, 7, 5.6, 3, 2, 4, 1, 9]
>>> replace(input_list, 1, 99.9)
[99.9, 7, 5.6, 3, 2, 4, 99.9, 9]
>>> input_list
[1, 7, 5.6, 3, 2, 4, 1, 9]
>>> replace([1,7, 5.6, 3, 2, 4, 1, 9], 5.6, 777)
[1, 7, 777, 3, 2, 4, 1, 9]
>>> replace([1,7, 5.6, 3, 2, 4, 1, 9], 8, 99)
[1, 7, 5.6, 3, 2, 4, 1, 9]
cut(aList)
Takes a list of integers and returns a list identical to aList, but when a negative number appears,
the function deletes the negative number and the next x-1 elements, where x is the absolute value
of the negative number. The function should not mutate aList.
Input
list aList A list that contains only integers
Output
list A list identical to aList where we delete a number of elements from that sequence
>>> cut([7, 4, -2, 1, 9]) # Found -2: Delete -2 and 1
[7, 4, 9]
>>> cut([-4, -7, -2, 1, 9]) # Found -4: Delete -4, -7, -2 and 1
[9]
neighbor(n)
Takes a positive integer and returns an integer where neighboring digits of the same value are
removed. Converting n to other types such as str is not allowed. As described in Homework 1,
floor division (//) and modulo (%) operators are useful here. You are not allowed to use the math
module.
Input
int n A positive integer
Output
int Integer with neighboring duplicates removed
>>> neighbor(2222466666678)
24678
>>> neighbor(2222466666625) # Note that the last 2 is not removed
24625
Takes a list of integers and returns a list identical to aList, but when a negative number appears,
the function deletes the negative number and the next x-1 elements, where x is the absolute value
of the negative number. The function should not mutate aList.
Input
list aList A list that contains only integers
Output
list A list identical to aList where we delete a number of elements from that sequence
>>> cut([7, 4, -2, 1, 9]) # Found -2: Delete -2 and 1
[7, 4, 9]
>>> cut([-4, -7, -2, 1, 9]) # Found -4: Delete -4, -7, -2 and 1
[9]
neighbor(n)
Takes a positive integer and returns an integer where neighboring digits of the same value are
removed. Converting n to other types such as str is not allowed. As described in Homework 1,
floor division (//) and modulo (%) operators are useful here. You are not allowed to use the math
module.
Input
int n A positive integer
Output
int Integer with neighboring duplicates removed
>>> neighbor(2222466666678)
24678
>>> neighbor(2222466666625) # Note that the last 2 is not removed
24625
![get_count(aList, item)
Returns the number of times item appears in aList. You cannot make any assumptions about the
contents of the list. You are not allowed to use any count methods from the Python library.
Input
A list of elements of any type
An object of any type
list
aList
many item
Output
int
Recurrence of item in aList
>>> get_count([1,4,3.5, '1',3.5, 9, 1, 4, 2], 1)
>>> get_count([1,4,3.5, '1',3.5, 9, 4, 2], 3.5)
>>> get_count([1,4,3.5, '1',3.5, 9, 4, 2], 9)
1
>>> get_count([1,4,3.5, '1',3.5, 9, 4, 2], 'a')
replace(numList, old, new)
Returns a copy of mumList with all the occurrences of old replaced by new. The process should
not mutate the original list (alter the memory block referenced by numList). You can assume
numList is a list of numbers and that old and new are either int or float. You are not allowed
to use any replace methods from the Python library.
Input
numList A list of numbers
A number
list
int/float old
int/float new
A number
Output
list
Copy of numList with all the occurrences of old replaced by new
>>> input_list
>>> replace(input_list, 1, 99.9)
[99.9, 7, 5.6, 3, 2, 4, 99.9, 9]
>>> input_list
[1, 7, 5.6, 3, 2, 4, 1, 9]
>>> replace([1,7, 5.6, 3, 2, 4, 1, 9], 5.6, 777)
[1, 7, 777, 3, 2, 4, 1, 9]
>>> replace([1,7, 5.6, 3, 2, 4, 1, 9], 8, 99)
[1, 7, 5.6, 3, 2, 4, 1, 9]
[1, 7, 5.6, 3, 2, 4, 1, 9]](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F76de5ad5-a780-4d7f-a00a-85f0792f2226%2F5c10b979-8744-41ac-8cda-dff6a2c11ae2%2F1l61zkv_processed.jpeg&w=3840&q=75)
Transcribed Image Text:get_count(aList, item)
Returns the number of times item appears in aList. You cannot make any assumptions about the
contents of the list. You are not allowed to use any count methods from the Python library.
Input
A list of elements of any type
An object of any type
list
aList
many item
Output
int
Recurrence of item in aList
>>> get_count([1,4,3.5, '1',3.5, 9, 1, 4, 2], 1)
>>> get_count([1,4,3.5, '1',3.5, 9, 4, 2], 3.5)
>>> get_count([1,4,3.5, '1',3.5, 9, 4, 2], 9)
1
>>> get_count([1,4,3.5, '1',3.5, 9, 4, 2], 'a')
replace(numList, old, new)
Returns a copy of mumList with all the occurrences of old replaced by new. The process should
not mutate the original list (alter the memory block referenced by numList). You can assume
numList is a list of numbers and that old and new are either int or float. You are not allowed
to use any replace methods from the Python library.
Input
numList A list of numbers
A number
list
int/float old
int/float new
A number
Output
list
Copy of numList with all the occurrences of old replaced by new
>>> input_list
>>> replace(input_list, 1, 99.9)
[99.9, 7, 5.6, 3, 2, 4, 99.9, 9]
>>> input_list
[1, 7, 5.6, 3, 2, 4, 1, 9]
>>> replace([1,7, 5.6, 3, 2, 4, 1, 9], 5.6, 777)
[1, 7, 777, 3, 2, 4, 1, 9]
>>> replace([1,7, 5.6, 3, 2, 4, 1, 9], 8, 99)
[1, 7, 5.6, 3, 2, 4, 1, 9]
[1, 7, 5.6, 3, 2, 4, 1, 9]
![cut(aList)
Takes a list of integers and returns a list identical to aList, but when a negative number appears,
the function deletes the negative number and the next x-1 elements, where x is the absolute value
of the negative number. The function should not mutate aList.
Input
list
aList A list that contains only integers
Output
list
A list identical to aList where we delete a number of elements from that sequence
>>> cut([7, 4, -2, 1, 9])
Found -2: Delete -2 and 1
[7, 4, 9]
>>> cut([-4, -7, -2, 1, 9]) # Found -4: Delete -4, -7, -2 and 1
[9]
neighbor(n)
Takes a positive integer and returns an integer where neighboring digits of the same value
are removed. Converting n to other types such as str is not allowed. As described in
Homework 1, floor division (//) and modulo (%) operators are useful here. You are not allowed
to use the math module.
Input
int
A positive integer
Output
int Integer with neighboring duplicates removed
>>> neighbor(2222466666678)
24678
>>> neighbor(2222466666625) # Note that the last 2 is not removed
24625](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F76de5ad5-a780-4d7f-a00a-85f0792f2226%2F5c10b979-8744-41ac-8cda-dff6a2c11ae2%2Fyko65cz_processed.jpeg&w=3840&q=75)
Transcribed Image Text:cut(aList)
Takes a list of integers and returns a list identical to aList, but when a negative number appears,
the function deletes the negative number and the next x-1 elements, where x is the absolute value
of the negative number. The function should not mutate aList.
Input
list
aList A list that contains only integers
Output
list
A list identical to aList where we delete a number of elements from that sequence
>>> cut([7, 4, -2, 1, 9])
Found -2: Delete -2 and 1
[7, 4, 9]
>>> cut([-4, -7, -2, 1, 9]) # Found -4: Delete -4, -7, -2 and 1
[9]
neighbor(n)
Takes a positive integer and returns an integer where neighboring digits of the same value
are removed. Converting n to other types such as str is not allowed. As described in
Homework 1, floor division (//) and modulo (%) operators are useful here. You are not allowed
to use the math module.
Input
int
A positive integer
Output
int Integer with neighboring duplicates removed
>>> neighbor(2222466666678)
24678
>>> neighbor(2222466666625) # Note that the last 2 is not removed
24625
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 2 steps with 2 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