<span>One vital component of your professional behavior with regard to computing systems today is the creation of strong passwords.
It is very important to have a good password on your computer, especially if you are dealing with sensitive data and information. It would be for the best to create such a password which won't be hacked into easily, in case somebody wants to steal your data.
</span>
Answer:
In Python:
mystr = input("Sentence: ")
mylist = []
word = ""
for i in range(len(mystr)):
if not i == len(mystr)-1:
if not mystr[i] == " ":
word+=mystr[i]
else:
mylist.append(word)
word = ""
else:
word+=mystr[i]
mylist.append(word)
print(mylist)
Explanation:
Prompt the user for an input sentence
mystr = input("Sentence: ")
Initialize an empty list
mylist = []
Initialize each word to an empty string
word = ""
Iterates through the input sentence
for i in range(len(mystr)):
If index is not the last, the following if condition is executed
if not i == len(mystr)-1:
If the current character is not space
if not mystr[i] == " ":
Append the character to word
word+=mystr[i]
If otherwise
else:
Append word to the list
mylist.append(word)
Set word to an empty string
word = ""
If otherwise; i.e. If index is not the last
else:
Append the last character to word
word+=mystr[i]
Append word to the list
mylist.append(word)
Print the list
print(mylist)
Only B and C would be the best choice
Answer:
See the code below in python.
Explanation:
num = int(input("Enter a number: "))
if (num == 0):
print("You entered 0...")
elif (num < 0):
print("Your entered a negative number...")
else:
print("You entered a positive number...")
Regards: Your Friendly Study Co-Pilot!
Answer:
The number of nodes in a full binary tree of height 2 = 7
Explanation:
At each level k, of the full binary tree there are usually 
nodes.
So the full binary tree of height 2 has nodes= 
+ 
+ 
.
which is 7.
