The algorithm ADDN implements N-bit fixed-width binary addition for non-negative integers and ignores overflows. For example, AD
1 answer:
You might be interested in
Answer:
Explanation:
The following code is written in Python. It is a function called checkString that takes in a string as an argument and loops through each char in that string and checking to see if it is lowercase, uppercase, vowel, consonant, or punctuations. It adds 1 to the correct variable. At the end of the loop it prints out all of the variables. The picture below shows a test output with the string "Brainly, Question."
def checkString(word):
uppercase = 0
lowercase = 0
vowel = 0
consonants = 0
punctuation = 0
vowelArray = ['a', 'e', 'i', 'o','u', 'y' ]
consonantArray = ['b', 'c', 'd', 'f', 'g', 'h', 'j', 'k', 'l', 'm', 'n', 'p', 'q', 'r', 's', 't', 'v', 'w', 'x', 'y', 'z']
punctuationArray = ['.', '!', '?', ',', ';', '(', ')']
for char in word:
if char.isupper():
uppercase += 1
else:
lowercase += 1
if char.lower() in vowelArray:
vowel += 1
elif char.lower() in consonantArray:
consonants += 1
if char in punctuationArray:
punctuation += 1
print('Uppercase: ' + str(uppercase))
print('Lowercase: ' + str(lowercase))
print('Vowels: ' + str(vowel))
print('Consonants: ' + str(consonants))
print('Punctuations: ' + str(punctuation))
