circular queue operations | Insertion | Data Structure | HINDI | Niharika Panda

circular queue data structure

[keshavmaheshwari]

mistake at 2:59.. correct answer is :
in that circular queue where front =0 & rear =3; so for insertion first we check that queue is not full ; so for that method is : front==(rear+1)% Max Q; and here front is 0;and rear is 3 ;so; 0==(3+1)%7 (here in max Q we have to write the size of the Q ; so it is 7) therefore result is 0==4%7 and we know that, this is not equal ;this means queue is not full and we can insert element.
Thanks

[vaishalidangi]

First of all Mam u should clear your doubt then ours

[amankhare]

why you don't reply to your students doubt ?

[nunnasaicharan]

at 2:59
4%8 means 8) 4 (
Not 4) 8 (

[cartoonsharma]

4%8 = 4 hoga 😭😭😭😭 kya padhaya kuch nahi samj aaya . Phele khud sikh lo didi 😭😭😭😭😭😭. Main khud sab bhul gya yey dekh k

[car_of_thrones]

Mam but shivani m to front = front +1 diya hai 😅

[aniketmondal]

2.46 minute pai dekhaya app galat bol rahe hai app galat para rahe hai 4%8 wala tik se dekhiya

[studywithprinceethakur]

Mam please 🙏 explain ki
8 kha se aaya

[snehaghugare]

Madam please aap pahle apke concept clear kijiye then video banaye🙏

[prajapatibhavikkumar]

Pele mem.. Ap.. Dekh.. Lo.. Bich me.. Ruk.. Te ho..

[gokulkhaire]

pahile apph ache se sikh loh firh padhane ana