☑Kizspy.me
(Choose 1 answer)
0
1
2
3
4
5
(1)
0000
Consider the following
y
0
U
pseudocode:
0
1
2
3
4
5
declare a queue of characters.
which is implemented by circular
y
0
U
array of size 6.
while(there are more characters
0
1
2
3
4
5
in the word to read)
{read a character
(3)
U
y
0
if a character is ** then
0
1
2
3
4
5
dequeue the queue
(4)
else
0
U
y
enqueue the character into
the queue
}
How the queue looks like after
processing the input
"How***AreYou***"?
A. (2)
B. (4)
C. (3)
D. (1)
FUO.sh
sh the exam.
