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