☑Kizspy.me
(Choose 1 answer)
0
1
3
4
5
0000
Consider the following pseudocode:
(1)
r
]
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
(2)
]
r
to read)
{read a character
if a character is then
0
1
2
3
4
5
(3)
dequeue the queue
else
r
enqueue the character into the queue
0
1
2
3
4
5
}
(4)
r
Back
How the queue looks like after processing
the input "Hello***Worl***d*"?
Next
A. (2)
B. (1)
C. (3)
D. (4)
FUQ.sh
sh the exam.
