(Choose 1 answer)
0
1
2
3
4
5
(1)
Consider the following
0
pseudocode:
0
1
2
3
4
5
declare a queue of characters, which is implemented by circular array of size 6.
(2)
y
0
while(there are more characters in the word to read)
(3)
0
1
2
3
4
5
0
0
{read a character if a character is then
(4)
1
2
3
4
5
0
dequeue the queue else
enqueue the character into the queue }
How the queue looks.like after processing the input
"How***Are You***"?
A. (1)
vato
fini
21
