Question (see uploaded pic): Given Code (Python): def binary_to_decimal_1(str, n): #Base Case/s #Add conditions here for base case/s if True : print("I will be printed before this recursive function ends.") return 0 #Recursive Case/s #Add conditions here for recursive case/s else: return binary_to_decimal_1(str, n) def binary_to_decimal_2(str): #Base Case/s #Add conditions here for base case/s if True : print("I will be printed before this recursive function ends.") return 0 #Recursive Case/s #Add conditions here for recursive case/s else: return binary_to_decimal_2(str) #Handle binary string input. binary_string = input("Please enter a binary string: ") print(binary_string) #Do function calls and print return values.
Question (see uploaded pic):
Given Code (Python):
def binary_to_decimal_1(str, n):
#Base Case/s
#Add conditions here for base case/s
if True :
print("I will be printed before this recursive function ends.")
return 0
#Recursive Case/s
#Add conditions here for recursive case/s
else:
return binary_to_decimal_1(str, n)
def binary_to_decimal_2(str):
#Base Case/s
#Add conditions here for base case/s
if True :
print("I will be printed before this recursive function ends.")
return 0
#Recursive Case/s
#Add conditions here for recursive case/s
else:
return binary_to_decimal_2(str)
#Handle binary string input.
binary_string = input("Please enter a binary string: ")
print(binary_string)
#Do function calls and print return values.
![1 v def binary_to_decimal_1(str, n):
2
#Base Case/s
#Add conditions here for base case/s
if True :
print("I will be printed before this recursive function ends.")
3
The code is already given
Problem: Using PYTHON, create a code that asks you to enter a binary string and you must use this binary string as
an input to your functions. These functions will be recursive functions that return the decimal number equivalent of your
binary string input.
return 0
7
#Recursive Case/s
Implementation 1: A recursive function with two inputs: a binary string, and a number. You can think of this as the index
that allows you to access each element in your sequence.
9.
#Add conditions here for recursive case/s
10
else:
11
return binary_to_decimal_1(str, n)
12
Implementation 2: A recursive function with only one input: the binary string.
13
def binary_to_decimal_2(str):
#Base Case/s
Constraints: Do implementation 1 if the binary string starts with a '0'. Otherwise, do implementation 2 if the binary string
starts with '1'. Before you return a value in your recursive function's base case, print a statement that reveals the identity
of the function that is currently used.
14
15
#Add conditions here for base case/s
if True :
16
17
print("I will be printed before this recursive function ends.")
18
return 0
19
Example (Input):
Example (Input #2):
20
#Recursive Case/s
#Add conditions here for recursive case/s
1111
0000
21
22
else:
23
return binary_to_decimal_2(str)
Example (Output):
Example (Output #2):
24
Please enter a binary string: 1111
Calculating the decimal number equivalent using implementation 2.
The decimal number equivalent of 1111 is 15.
Please enter a binary string: 0000
Calculating the decimal number equivalent using implementation 1.
The decimal number equivalent of 0000 is 0.
25
#Handle binary string input.
26
binary_string = input("Please enter a binary string: ")
print(binary_string)
27
28
29
30
#Do function calls and print return values.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F4e9f5a4e-733b-4ef8-89d9-ff335bcd5624%2F5a37862f-4e27-40fd-8ce9-03da69aaaf64%2Fyal8lit_processed.png&w=3840&q=75)
![](/static/compass_v2/shared-icons/check-mark.png)
Step by step
Solved in 4 steps with 3 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)