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