Answer:
A.O(1)
Explanation:
In the implementation of queue by using linked chain the performance of the enqueue operation is O(1).We have to maintain two pointers one head and the other tailand for enqueue operation we have to insert element to the next of the tail and then make that element tail.Which takes O(1) time.
Answer:
The answer to this question is given below in the explanation section.
Explanation:
The selection sort algorithm step started from 0, and continue till the sorting is done.
The correct answer after selection sort algorithm at the 4th step is:D
[0,1,2,4,8,10].
The complete detail of step by step execution is shown in the attached document file.
Answer:
filter
Explanation:
Some email programs let you use a filter to move incoming mail to a specific folder or to delete it automatically based on the content of the message.
The filter performs this role by either automatically deleting or moving to another location.
Most messages that are moved or deleted are unsolicited emails or spam messages.
Filtering of your mails helps so you ou can manage your incoming mail using filters to send email to a label, or archive, delete, star, or automatically forward your mail.
This is a way of organising your correspondence.
top i believe is the answer
