Write a loop that counts the number of space characters in a string. Recall that the space character is represented as ' '.
1 answer:
Answer:
I am writing Python program.
string = input("Enter a string: ")
print(string.count(' '))
Explanation:
The first statement takes input string from the user.
input() is used to read the input from the user.
The next statement uses count() function to count the number of times the specified object which is space ' ' here occurs in the string.
The print() function is used to return the number of times the space occurs in the string entered by the user.
Output:
Enter a string: How are you doing today?
4
The screenshot of program and its output is attached.
You might be interested in
Answer:
A python code was used in writing of the recursive function max_depth; and passed a binary (any binary tree, not necessarily a binary search tree) and a value as arguments.
Explanation:
Solution
To solve this given question we make use of Python programming language.
Thus
THE CODE:
class BinaryTreeNode:
def __init__(self, value, left=None, right=None):
self.value = value
self.left = left
self.right = right
# recursive max_depth function implementation
def max_depth(tree, value):
if tree == None:
return -1
# recursive calls to this function
leftDepth = max_depth(tree.left, value)
rightDepth = max_depth(tree.right, value)
# return the maximum depth
if tree.value == value or leftDepth > -1 or rightDepth > -1:
return 1 + max(leftDepth, rightDepth)
else:
return max(leftDepth, rightDepth)
btn1 = BinaryTreeNode(2)
btn2 = BinaryTreeNode(3, None, btn1)
btn3 = BinaryTreeNode(3)
btn4 = BinaryTreeNode(3)
btn5 = BinaryTreeNode(2, btn2, btn3)
btn6 = BinaryTreeNode(1, btn4)
tree = BinaryTreeNode(3, btn5, btn6)
print('max_depth(tree, 1):',max_depth(tree, 1))
print('max_depth(tree, 2):',max_depth(tree, 2))
print('max_depth(tree, 3):',max_depth(tree, 3))
Note: Kindly find an attached copy of the Implementation of max_depth() function, Code to test the max_depth() function and the sample output below.
Answer:
def max_magnitude(user_val1, user_val2):
if abs(user_val1) > abs(user_val2):
return user_val1
else:
return user_val2
if __name__ == '__main__':
n1 = int(input("Enter the first integer number: "))
n2 = int(input("Enter the second integer number: "))
print("The largest magnitude value of", n1, "and", n2, "is", max_magnitude(n1, n2))
Explanation:
