ple Choices
(Choose 1 answer)
0
1
2
3
4
5
(1)
0
g
Consider the following pseudocode:
0
1
2
3
4
5
(2)
declare a queue of
0
g
characters.which is implemented by circular array of size 6.
(3)
0
1
2
3
4
5
g
0
0
(4)
1
2
3
4
5
n
g
0
while(there are more characters in the word to read)
{read a character
if a character is '*' then
dequeue the queue else
enqueue the character into the queue }
How the queue looks like after processing the input
"Hello***Hoa**ng*"?
A.
(2)
B. (3)
C. (1)
D. (4)
<
I want to nisin the exam.
