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