Slip 13 Q 2
CODE :
Note rule of a queue: The order is First In First Out (FIFO).
q=[]
q.append(10)print("Initial Queue is:",q)q.append(100)print("Initial Queue is:",q)q.append(1000)print("Initial Queue is:",q)q.append(10000)print("Initial Queue is:",q)
print('{} is out from queue ! '.format(q.pop(0)))print("After Removing elements:",q)print('{} is out from queue ! '.format(q.pop(0)))print("After Removing elements:",q)print('{} is out from queue ! '.format(q.pop(0)))print("After Removing elements:",q)
OUTPUT :
q=[]
q.append(10)
print("Initial Queue is:",q)
q.append(100)
print("Initial Queue is:",q)
q.append(1000)
print("Initial Queue is:",q)
q.append(10000)
print("Initial Queue is:",q)
print('{} is out from queue ! '.format(q.pop(0)))
print("After Removing elements:",q)
print('{} is out from queue ! '.format(q.pop(0)))
print("After Removing elements:",q)
print('{} is out from queue ! '.format(q.pop(0)))
print("After Removing elements:",q)
No comments:
Post a Comment