Please fix the code and explain the steps (specially the recursive part). Also please test it and screenshot the code as well as the output. (using python)
Please fix the code and explain the steps (specially the recursive part). Also please test it and screenshot the code as well as the output. (using python)
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
Please fix the code and explain the steps (specially the recursive part). Also please test it and screenshot the code as well as the output. (using python)
![1. Write a module, namely MyOwnFunctions, which contains the following
functions:
a. SplitType(numlist) which takes a list of numbers (integer or float) and
returns a list of only integers and a list of only floats from a numlist.
b. ListofOdd(numlist) which takes a list of integers and returns a list of only
odd integers. Note that this function must be a recursive function.
c. KeepTwoDup(numlist) which takes a list of integers and returns a list of
unique integers and duplicated integers that a maximum number of
duplications is two. For example
numlist = [1,2,2,2,3,4,5,5,5,1,2,3,3]
outlist = [1, 2, 2, 3, 4, 5, 5, 1, 3]
d. Write a complete Python code to import MyOwnFunctions and test
each individual function accordingly.
Hints: for ListofOdd(numlist), the below function returns all integers
from the original numlist.
def ReturnAlINum(numlist):
if len(numlist) == 1:
outlist.append(numlist[0])
return outlist
else:
outlist.append(numlist[0])
return ReturnAlINum(numlist[1:]) # Recursive Call
For KeepTwoDup(), modify RemoveDuplicate() by adding seen2 = set()
and add necessary if-else condition(s).](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F67facd66-b9ef-42d7-84c8-bd5006cb0c63%2F5e5713d9-63ea-456a-a129-b0e366c3ba1e%2Flgjic_processed.jpeg&w=3840&q=75)
Transcribed Image Text:1. Write a module, namely MyOwnFunctions, which contains the following
functions:
a. SplitType(numlist) which takes a list of numbers (integer or float) and
returns a list of only integers and a list of only floats from a numlist.
b. ListofOdd(numlist) which takes a list of integers and returns a list of only
odd integers. Note that this function must be a recursive function.
c. KeepTwoDup(numlist) which takes a list of integers and returns a list of
unique integers and duplicated integers that a maximum number of
duplications is two. For example
numlist = [1,2,2,2,3,4,5,5,5,1,2,3,3]
outlist = [1, 2, 2, 3, 4, 5, 5, 1, 3]
d. Write a complete Python code to import MyOwnFunctions and test
each individual function accordingly.
Hints: for ListofOdd(numlist), the below function returns all integers
from the original numlist.
def ReturnAlINum(numlist):
if len(numlist) == 1:
outlist.append(numlist[0])
return outlist
else:
outlist.append(numlist[0])
return ReturnAlINum(numlist[1:]) # Recursive Call
For KeepTwoDup(), modify RemoveDuplicate() by adding seen2 = set()
and add necessary if-else condition(s).
![*MyOwnFunctions.py - /Users/macpro/Documents/MyOwnFunctions.py (3.8.5)*
#Q1
#a
def SplitType(numList):
intlist = 0
floatlist = []
for i in numList:
if check_int isinstance(i,int):
intlist.append(i)
return intList
if check_float = isinstance(i, float):
floatlist.append(i)
return floatlist
#b
def Listof0dd(numList):
oddlist = []
for i in numlist:
if i%2 != 0:
oddlist.append(i)
return oddList
#c
def KeepTwoDup(numList):
time = 0
for i in numlist:
if i in numList:
time += 1
if time >=](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F67facd66-b9ef-42d7-84c8-bd5006cb0c63%2F5e5713d9-63ea-456a-a129-b0e366c3ba1e%2Fqaj5a3y_processed.jpeg&w=3840&q=75)
Transcribed Image Text:*MyOwnFunctions.py - /Users/macpro/Documents/MyOwnFunctions.py (3.8.5)*
#Q1
#a
def SplitType(numList):
intlist = 0
floatlist = []
for i in numList:
if check_int isinstance(i,int):
intlist.append(i)
return intList
if check_float = isinstance(i, float):
floatlist.append(i)
return floatlist
#b
def Listof0dd(numList):
oddlist = []
for i in numlist:
if i%2 != 0:
oddlist.append(i)
return oddList
#c
def KeepTwoDup(numList):
time = 0
for i in numlist:
if i in numList:
time += 1
if time >=
Expert Solution
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 4 steps with 2 images
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education