328 views

2 Answers

Best answer
2 votes
2 votes

Elements of Queue are as follows 

5 4 3 2 1

At x=1 we dequeue 1 then dequeue 2 and enququeu it 

2 5 4 3

At x=2 we dequeue 3 then dequeue 4 and enqueue it 

4 2 5

At x= 3 we dequeue 5 then dequeue 2 then enqueue 2

2 4

At x=4 we dequeue 4 then dequeeue 4 then enqueue 2

2

Our process ends here 

Number of element remains is 1 and value of that element is 2

selected by
0 votes
0 votes
First 5 numbers will be enqueued.

In next for loop

for each iteration ,2 dequeues and 1 enqueue will be done. each iteration one element is dequeued.

So after 4 iterations 1 element will be present

Related questions

0 votes
0 votes
0 answers
1
Hradesh patel asked Dec 22, 2017
411 views
0 votes
0 votes
0 answers
2
Hradesh patel asked Dec 22, 2017
282 views
0 votes
0 votes
1 answer
3
Hradesh patel asked Dec 22, 2017
338 views
my answer 5 plz check but answer given 4
1 votes
1 votes
0 answers
4
cse23 asked Jul 31, 2016
367 views
which of below is recursively enumerable language:a. <M | M is turing macjine and there exist a input whose length is less than 100, on which M halts>b.{M is a turing mac...