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