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.
It could be any thing of your chose
the answer is the seconf one
Answer:
Check the explanation
Explanation:
A) Whenever C is sending to D, what other communications are possible?
C’s packet will be seen by A, B and D, but not by E. Thus, D can send to E at the sametime..
B) Whenever B is sending to A, what other communications are likely?
Even though B’s packet will not be seen by D, other nodes, e.g., E, or C, can’t send to D since the packets from these nodes will interfere with the packets from B at A. Therefore, other communications is not likely at the same time.
C) Whenever B is sending to C, what other communications are possible?
B’s packet will be seen by E, A and C, by not by D. therefore, E can send to D at the same point.
Answer:
brainliest plsss
Explanation:
I think so this is what you had asked!!!!!!
hope it helps
