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