Computer scienceProgramming languagesPythonAdditional instrumentsAlgorithms and data structures

Queue in Python

Theory

Deque as a queue

Report a typo

Consider the following code fragments:

A.

my_deque = deque()

my_deque.append('a')
my_deque.append('b')
my_deque.append('c')

my_deque.pop()
my_deque.pop()
my_deque.pop()

B.

my_deque = deque()

my_deque.appendleft('a')
my_deque.appendleft('b')
my_deque.appendleft('c')

my_deque.pop()
my_deque.pop()
my_deque.pop()

C.

my_deque = deque()

my_deque.append('a')
my_deque.append('b')
my_deque.append('c')

my_deque.popleft()
my_deque.popleft()
my_deque.popleft()

D.

my_deque = deque()

my_deque.appendleft('a')
my_deque.appendleft('b')
my_deque.appendleft('c')

my_deque.popleft()
my_deque.popleft()
my_deque.popleft()

In which of them the data is manipulated according to the FIFO principle?

Select one or more options from the list
___

Create a free account to access the full topic