Answer:
B.O(1)
Explanation:
When we are implementing ADT stack using linked chain we can pop an entry from the stack having O(1) time complexity because in linked chain we have the head or top pointer in linked chain only.Popping and pushing in stack happens on only one end that is top.So we have move to move top in linked chain to the next and delete prev node.
Microsoft Word and do all of those things. So select all of them
Social Media can you knowledge by most users on Social Media spreading their own knowledge.
Answer:
theSentence = input('Enter sentence: ')
theSentence = theSentence.split()
sentence_split_list =[]
for word in theSentence:
sentence_split_list.append(word[1:]+word[0]+'ay')
sentence_split_list = ' '.join(sentence_split_list)
print(sentence_split_list)
Explanation:
Using the input function in python Programming language, the user is prompted to enter a sentence. The sentence is splited and and a new list is created with this statements;
theSentence = theSentence.split()
sentence_split_list =[ ]
In this way every word in the sentence becomes an element in this list and individual operations can be carried out on them
Using the append method and list slicing in the for loop, every word in the sentence is converted to a PIG LATIN
The attached screenshot shows the code and output.
You can try to shut down the computer manually (using the power button) then turn on your computer again. (It always works for me.)