Table1/2.....hope it helps
Answer: False.
Explanation:
The general case of recursive function is when the solution is obtained recursively by simplification at each step.
However, it is the base case in a recursive function when the solution is obtained directly.
The general case must be reducible to base to arrive at a solution else the recursion would be a infinite recursion.
Answer:
class Example:
def __init__(self, val):
self.val = val
def __gt__(self, other):
return self.val > other.val
def __sub__(self,other):
return abs(len(self.val) - len(other.val))
def main():
obj1 = Example('this is a string')
obj2 = Example('this is another one')
print(obj1 > obj2)
print(obj1 - obj2)
main()
\color{red}\underline{Output:}
Answer:
In Python:
def decimalToBinary(num):
if num == 0:
return 0
else:
return(num%2 + 10*decimalToBinary(int(num//2)))
decimal_number = int(input("Decimal Number: "))
print("Decimal: "+str(decimalToBinary(decimal_number)))
Explanation:
This defines the function
def decimalToBinary(num):
If num is 0, this returns 0
<em> if num == 0:
</em>
<em> return 0
</em>
If otherwise
else:
num is divided by 2, the remainder is saved and the result is recursively passed to the function; this is done until the binary representation is gotten
return(num%2 + 10*decimalToBinary(int(num//2)))
The main begins here.
This prompts the user for decimal number
decimal_number = int(input("Decimal Number: "))
This calls the function and prints the binary representation
print("Decimal: "+str(decimalToBinary(decimal_number)))
