1. Data is easy to backup as all data is stored on the file server.
2.Network users can communicate by email and instant messenger.
Answer:
c.O(n)
Explanation:
In the array based list implementation of the ADT the worst case time complexity of the getEntry method is O(n).In the worst case it has to travel upto n elements then it has to do the operation.In doing so the time complexity will come out to be O(n).So we conclude that the answer to this question is O(n).
Answer:
The output of this question is 21. As show in the image
The explanation is given in below
Explanation:
Let first write the question
C=1
sum = 0
while(C<10):
C=C+3
sum=sum + C
print(sum)
Now Focus on
while(C<10):
C=C+3
sum=sum + C
The value of C is initially 1
C=1+3
Sum= 0+4
In second loop the value of C will become 4
c=4+3
sum=4+7
In third loop the value of C will be 7
c=7+3
sum=11+10
so the answer is 11+10=21