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