4.2 Implementation of Queue using Arrays | Data Structures & Algorithm Tutorials

In this lecture I have described array based implementation of queue data structure. I have written C program to implement queue using arrays.
DSA Full Course: https: • Data Structures and Al...
******************************************
See Complete Playlists:
C Programming Course: • Programming in C
C++ Programming: • C++ Complete Course
Python Full Course: • Python - Basic to Advance
Printing Pattern in C: • Printing Pattern Progr...
DAA Course: • Design and Analysis of...
Placement Series: • Placements Series
Dynamic Programming: • Dynamic Programming
Operating Systems: // • Operating Systems
DBMS: • DBMS (Database Managem...
*********************************************
Connect & Contact Me:
Facebook: / jennys-lectures-csit-n...
Quora: www.quora.com/...
Instagram: / jayantikhatrilamba
#jennyslectures, #datastructures #queue #queueimplementation

[@thengakola6217]

literally every student have exam tomorrow and this lecture is helpful........ dont repeat what everyones saying

[@saiswaroopkunda8055]

But I'm having now exam listening to this class😆

[@nemothekitten3994]

umm i have viva in half an hour i have to write sheduling algorithms

[@chagantisrichandana8070]

🤣🤣 exactly true thenga

[@deepaksinghranawat4929]

Apun ke bhi exam h aaj

[@arenaofgaming2471]

Nop today 🥲

[@muhammadahsanriaz9969]

Hi Mam ! I am from Pakistan . Thank You So much for teaching us in outstanding way. I respect and love all the KZbin Tutors of India Although other departments are better in Pakistan but Department of Cs and IT is not so good and updated in the universities here, so through your lectures we can learn the updated course ,you helped us a lot ....Thanks Again.

[@pratikkumbhkar9729]

Really want person like you that make relations friendly ❤❤

[@muhammadahsanriaz9969]

@@pratikkumbhkar9729 Thanks bro.

[@adarsh_kr_maurya]

Love ❤️ from India 👍

[@flakky626]

💣💥

[@itzritam2127]

oh so according to you anything is best in Bhikaristan?

[@aditishaw2697]

I just love how she teaches with so much enthusiasm and repeats every point like a thousand times so things really fit into your head. Thank you so much ma'am for your videos.

[@adwaithvinod5705]

yeh exactly the repetition of points is really helpful which a lot of teachers dont realize and mostly wont cause they dont wanna put in the work

[@akhilbille2670]

Maam if a lecturer like u are in college then no one miss u r cls u r really great in subject

[@FrontLineEngineer]

Sahi batao 😳

[@venkatbvbcet]

I'm technical lead have almost 10 years of experience, still i loved to watch your videos, excellent teaching skill you have really appreciated..🤗

[@JAYPATEL-ih2qm]

I have found the Right Place to Learn DSA in KZbin . Thanks 🙌

[@shabanajafar4631]

Thanks alot mam. You are benefited every student in the country. Pls keep following the same. You have a subscribers in each corner of the india. Kudos to your lecture!

[@MegaMicraman]

I need to brush up on data structures for work. These lectures are top quality. From a mature student.

[@122_ankitkumargupta8]

Mam... Plz put the whole lectures of ds in a single playlist.... I couldnot find the best lecture of ds... But aftr watching ur videos.... I can say u r the best one

[@nagmanazrin8760]

the only teacher i have seen giving u a strong look like are u getting my point and i rotating my head ya ya i'm getting it😂lol a real feeling of being in a class.Thanku so much mam🤗

[@MrSiddharth999]

Love from Bangladesh. What I have learned after watching your videos only in 6 hours, my varsity couldn't teach me data structure in 6 months of the semester.

[@adithyaraj8984]

tq so much mam, im paying lacks of fees to college which is of no use , but your golden lecture which is of no cost means a lot to me mam Tq once again

[@zulfiqaraliahmed6667]

Upload some leetcode problem & interview problems (product based companies) You are a great teacher

[@nastranzahra8829]

i have an exam tomorrow and your this lecture literally helped me a lot ma'am. Thank you so much.

[@jaimaabhawaniji]

Mam trust me ,i was about to write this queue data structures as a lecture series on every video you have uploaded, as a comment ,so that you may decide to do so and here you are 💯💯💯😊 !!!! Thanks alot.Trees like b+ etc will also be appreciated.

[@sankalpa_gunasekara]

Thank you so much, Ma'am, for saving my entire Data Structures & Algorithms subject! God bless you and May the triple gems bless you !!

[@ayushvasani5489]

I can not have word to say anything about you Such a great explanation Mind-blowing

[@devaldhamsania7034]

Ma'am you just made this really easy, till now I'm face problem in making program but you just make it really simple, thanks a lot and keep making such stuff it really helps us. Thank you one again 😊

[@dmangee2]

Thank you for the great explanation, these are the best Data Structure & Algorithm videos available on the internet.

[@ruturajpawar]

1 month before exam 😎

[@1neyt167]

@@ruturajpawar 1 day before exam

[@GreenPanther-hn5qe]

@@ruturajpawar 12 hrs before exam

[@gg-uzi]

23:06 before the exam

[@muchhadiyakaushik5163]

1 hours before exam

[@JNM_7.7]

On exam 😂❤

[@cyanider069]

Note : This code worked for me. if there is any mistake, please let me know. CODE: #include using namespace std; #define N 5 int queue[N]; int front = -1; int rear = -1; void display() { if (front == -1 && rear == -1) { cout

[@lamishajoshi7480]

Declare front and rear as pointer and point them to array naming queue

[@vikrampandey7860]

i dont know why you are in such a hurry to say bye and take care :), jokes apart your videos are really helpful, thanks alot

[@usmanzahid7627]

Happy teacher's day Miss .I like your lecture so much.Thank you🥰 for this simple and great lectures. Love From 🇵🇰 wish you health and long life💞 .Regards to your family😁.

[@user-mx6yi8vi6m]

Mam iam doing mca on correspondence with this videos I learned perfectly

[@pooyataheri8092]

dequeue and peek usually have a return type, not just printing the value of front in a void function.

[@Trueaccount.]

Empty means underflow ,na

[@abhishekchakravorty234]

Very good explanation Ma'am, thank you so much! However, it would benefit us even more if you could explain to us how to integrate all these functions with the main function.

[@siri-ul7gr]

not a teacher gives the eye to eye contact like you

[@veereshtechchannel8762]

U r explanation is superb mam and i like u r teaching skills so much mam, when compare to study classes u r explanation is 99.99%is perfect mam

[@code4vlogger652]

This is one of the best place to learn about DSA .Thank you ma'am

[@princeujjawal829]

Mam seriously ur teaching and explanation is next level 😊♥️ Thank you for the amazing lecture 💯

[@HopeNHopes]

I have a ds exam in 2 days and here i am ;) Studying CE in IUST btw Love and appreciation from iran❤️‍🔥🇮🇷

[@rjhgworrioar9753]

I have exam 2hours later and I'm watching now. 😂

[@Prince-ol5zk]

You’re a great teacher. You clarified my doubts. I was confused why enqueue is O(1) and you used a great visual representation 🎉

[@TechyAyush]

Understood every single bit! Thank you so much mam.

[@shreyabanik6986]

Ma'am your way of explaining is very easy and understandable. Thank you ❤️

[@abhijitzende7292]

Suppose we have declared queue (array) of size 10 and by doing enque we made our queue full now we dequeue an element from queue which will be done from front end ... Now queue is not full because index 0 of queue is empty ... But even though we cannot enque because rear is at MAX-1 and it will show Overflow .... isn't it wastage of memory

[@kalagahemani4933]

Ofcourse it is. Thats the main disadvantage of queues. To overcome that problem circular queues were employed .

[@thecloudterminal]

Thank you for great explanation and putting so much effort mam 🙏

[@vivekpandey794]

Good evening mam, you are really doing good work for cs students. Specially You have a good art of teaching technical concepts.

[@hbpatel1976]

How about making a video on Priority Queue (with array & linked list implementation)?

[@anchalpatel10]

Yeah!!

[@devangmathur5809]

Thank you so much mam. You are doing a lot of hard work for us!!🙏

[@srinivasan6352]

Best guidance for data structures. Really to say i was very much feared of this subject but after seeing ur lectures, data structures became my most interesting subject ma'am. Thank u so much ma'am . U keep rocking:)

[@user-pb7ht8oy9b]

// Online C compiler to run C program online #include #include #define N 5 int a,front=-1,rear=-1; void enqueue(); void dequeue(); void peek(); void display(); int queue[N]; int main() { int choice,ch; while(ch=1){ printf("Enter your choice: 1.Enqueue 2.Dequeue 3.Peek 4.Display: "); scanf("%d",&choice); switch(choice) { case 1: enqueue(); break; case 2: dequeue(); break; case 3: peek(); break; case 4: display(); break; default: printf(" Invalid Choice : "); } printf(" Do you want to continue? "); scanf("%d",&ch); } } void enqueue() { if(front==-1 && rear==-1) { front=rear=0; printf(" Enter the number :"); scanf("%d",&a); queue[rear]=a; } else if(front==N-1) { printf("Queue Overflow"); } else{ printf(" Enter the number :"); scanf("%d",&a); rear++; queue[rear]=a; } } void dequeue() { if(rear==-1 && front==-1) { printf(" Empty "); } else { printf("Deleted item is %d",queue[front]); front++; } } void peek() { int item; item=queue[front]; printf("Top/Peek item is %d",item); } void display(){ int i; for(i=front; i

[@richaatrey]

Superb mam agr aap mujhe btech m pdhate to sach m life bn gyi hoti ab tak bhut awesome pdhate ho mam really love the way you teach💓💓💓💓💓

[@yashwanthm2925]

Empty = mpt

[@priyanshusaini8180]

Mam love your teaching method❤ its great how you teach every topic to the depth and still makes everything clear and simple amazing ❤❤❤

[@dilleshwarip2789]

Mam u r so cute and teaching also ❤ I loved it 😍

[@bhaskarp8326]

Super mam your explanation is too excellent and ur way of explanation is easily understandable thank you mam I understood easily this concept

[@VK_BRANDING]

adv congo for 2M🥰🥰🥰

[@AdityaKumar-tm5mb]

best best best....you made DS really simple :)

[@semrana1986]

Very nicely explained with a fully worked out example

[@anurudhsingh3397]

Thank you so much mam ,you explains every topic very well...❤️

[@rawatmotorsguptakashi1577]

Great way of explaining really hats off to you jenny.

[@fizakhan4517]

Yrrrrr lots of love for you ❤❤❤ you are awesome😍😍 You put sooo much efforts After watching your videos my all confusions just vanishedddd😂 God bless you ma'am❤

[@october3518]

I have a different excuse....I have an assignment to complete this week n I gotta study to complete it lol 😀 thankyou for the wonderful lectures!!

[@mohdtarik4803]

Your teaching style owsome mam Very thankful mam From Kanpur 💕💕💯 But mam I think In dequeue function there should be a temporary variable that can be hold the value of front And then we increament temp variable that's it Thanks 😊 mam

[@himanshugupta2160]

Nice explanation ma'am! Most of the topics being covered and cleared to me as well...

[@RollingTheDepth]

I wish, Hmare college ki madam bhi itni cute hoti so, appreciations for ur beauty(1) Now Point to be noted is that I am not here as a tharki(2) So, I must be thanking you coz u explained sort algorithms very well. I am a beginner in data structures (starting) so, You explained them very well(3) Then I watched some of your other videos and you teach in a very simple language. So, for beginners like us, It's like blessings after going through the jargons on websites like g4g or codeacad. so thanku(4) . Now just 1 request/suggestions: Please organise data structures and algorithms seperately coz It's confusing. Also orgainse ot topicwise. It can help us a lot THANKS FOR SUCH BETTER TEACHING ON KZbin FOR FREE!!(Rare Thing) System.out.println("Happiness and love should be the functions without any arguments 😊");

[@hthree7857]

it's free for us, not her. There is no Sandeep Maheshwari in every alley

[@Understanding_the_world_withme]

Maam you are one of my best teachers.. Thank you very much for these videos. Stay safe and healthy maam. Love from me.

[@surbhisaraf3267]

Mam ur too good In data structure.i would like to thank you first...bcz mam u have make vdo in such easier language which we can understood properly what is the concept.. Thank you so much mam....again

[@ashisharya1536]

Thanku mam for understanding DS&A in the simplest way.

[@anshgupta8860]

in the dequeue operation when front ==rear for the element -1,it will set front and rear as -1 ,so here i think -1(last element) will never be printed

[@ajeetsingh4986]

I believe it is best to shift every element of the array one place to the left in the case of de-queueing rather than moving the front pointer. If I'm mistaken, kindly point it out. Other from this, there's no denying that your videos are excellent ☺

[@sruthimajhi5610]

But that seems so irrelevant

[@adarsh_kr_maurya]

Thank ma'am ,this vedio is very effective for us.. 🙏

[@UdayKumar-ph4xg]

One hour before exam >>>>

[@mohammadshahabeezurrahman6646]

Mam literally awesome thanks for the lecture. Much love to our respected teacher Jenny Aka Jayanti mam.😊😇🙏

[@EnglishwithSudha]

Great ma'am thanks a lot

[@srivanikothavadla4606]

I got the best lecture from KZbin ... Thanks alot

[@isharaperera419]

Your teachings are masterpiece ma'am!

[@code-heads]

Thank you so much, have been struggling to grab the concept since different sources where providing different concepts of queue.

[@PB30K]

Very well explained..really Helped me.. thanks a lot ma’am

[@ShambhuVibe]

Your fan from Nepal.Thank you.I got right platform to learn DSA

[@saurabhsaxena1992]

I have a lot of love for nepali guys. I have two friends in my college. Please remove this dull communist govt, otherwise ur country will get disturbed a lot religiously as well as economically

[@MichaelDouglas-sr5re]

Thanks for making Queue simple and clear...nice job

[@SrinivasRao-ev7pn]

You are such a down to earth person

[@virendramane7818]

the way u teach is very good.....but in delete operation if we still increasing front end then at one time the situation will happen i.e front>rear from this condition we cant enter a single element in list so we remove this problem by shifting....

[@farazkhan496]

It very helpful mam❤

[@chetnadua6783]

Very clear and to the point concepts... This is worth watching ❤️❤️❤️❤️

[@stylingcastle6347]

You are a life saver mam!! Respect to you For such a genius video

[@fgmalang219]

Very helpful videos your just amazing on this field keep it up just try to make videos in urdu also that will help us alot thanks jaan love you❤️🔥

[@krishnachaitanya-md8wl]

jenny mam rocks..pls join in gvp college , AP as a lecturer

[@prathmeshpawar5591]

All the videos are very helpful for us to clearify concepts of data structure, Thank you mam !

[@jaiom83]

Hi Jenny, firstly i would like to thank you for explaining the concept in such a simple words. Here I have problem with your dequeue method because -1 will never gets printed so what about that last element in queue. So last element is unreachable according to your code. Please correct me, if I have misunderstood.

[@codewithdrv7521]

For explanation checkout #codewithdrv

[@atirekmanidiggal5140]

WATCHING BEFORE EXAM

[@sudhirverma4790]

Overflow will be when use try to enque on the 5th position...upto 4 the user can enqueue

[@allhdmoviescene1294]

this algo will save time but not memory because even f and r = -1 there are elements stored in the array which is useless until overwrite

[@EBKCS_MOKSHASHARMA]

ghum fir ke m aapke paas he aajaatu hu KZbin me best vdo bro✨

[@thahauvaiseak2502]

Hai mam...I have a doubt... At the time of enqueue is there need to declare rear=front=-1? bcz we have already checked in if condition...

[@gattineniakhil1990]

Good teaching,your videos are helpful to so many students

[@venkateshrajendran2362]

Let say array length is 3 , rear and front are in index 2 nd now i call enQ() . Technically queue is not full but having one element in it so queue should allow me to add element. Rather it will say overflow. Please correct me if I'm wrong. And your lectures are very clear. Thanks for making videos, Jenny. And your smile at end is so cute. 😅

[@pranaychoubey9706]

u can modify the if condition for that.

[@akanshagupta4493]

Reallly mammm i like ur teaching way , u make every concept too much easy and interesting 😍😍😍

[@pappujha9357]

Thanks a lot, Ma'am...You are my saviour

[@amanchoudhary276]

Mam there is a issue in dequeue function, suppose we define an array of size 3, and we insert only 1 element i.e. first element as 5 (now,front=0&rear=0) and then dequeue but it will give no error but blank space as result but we must get 5 as dequeue elemet. It is beacause during dequeue we give else if condition that if front=rear make front=rear=-1 and in else if only one condition will be executed so, no result will be given in all situation whent rear=front but not at -1

[@aniruthsuresh6749]

thats a nice observation ; prolly to overcome that we can give an extra condition like front !=0 so your if condition will look something like this :: if(front ==rear && front!=0) :: hope that helps

[@dharani.p1884]

really superb mam I understood this concept

[@utfuntv6744]

hello mam mai aap ki vedio kuchh dino se dekh raha hu ,app ki saari concept mujhe achhe se samajh aa raha hai ,thakyou for the content of data stracture . ek aur baat mai aap lagti bahut cute hai mai to kabhi kabhi aap ki vedio ko pose kar ke aap hi dekhta rah jata hu 😘😘😘

[@SR-rd3fw]

Thank you so much for the tutorials Ma'am, they benefit beginners like me.

[@bhargavsaivedrapolu9845]

Thank you for your wonderful teaching maam.It really helped me a lot.Lots of love from NIT Patna❤️😁😇🤗

[@shayanahmed1418]

Excellent explanation. To the point.Thanks a lot.

[@musictone5159]

very useful vedio

[@vakhariyajay2224]

Thank you very much. You are a genius. 👍👍🔝🔝👌👌🙏🙏

[@SAymanShariff]

Plz make a video of how to implement multiple queues in a single array