Question
Given a singly linked list with 'n' nodes, what is the
time complexity to delete the last node?Solution
Answer: C) O(n) To delete the last node, you need to traverse the list to find the second-to-last node, which takes O(n) time.
Select the correct active form of the given sentence.
Anything would have been permitted by Alice Bennett.
Select the correct active form of the given sentence.
Her phone can’t be switched off by my father.
The shopkeepers were told (A)/by the police that (B)/goods were being selled(C)/by them at higher prices (D).
Choose the option that is the passive form of the sentence.
Switch off the television.
Select the correct passive/active form of the given sentence.
The thief was found guilty by the police.
Choose the option that is the passive form of the sentence.
I burnt my hand yesterday while cooking.
Choose the correct passive voice form.
The road ______ before the minister’s visit.
Select the option that expresses the following sentence in passive voice:
The teacher is checking the answer sheets.
Select the option that expresses the given sentence in active voice.
Not a word was spoken by the criminal in self-defence.Â
Choose the correct passive voice form.
The windows of the classroom _________ by a stray cricket during yesterday's game.