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

Jennys Lectures DSA with Java Course Enrollment link: www.jennyslect...
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 😳

[@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!

[@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

[@JAYPATEL-ih2qm]

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

[@zulfiqaraliahmed6667]

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

[@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.

[@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.

[@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 😊

[@lonewolf16916]

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

[@dmangee2]

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

[@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.

[@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😁.

[@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

[@pooyataheri8092]

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

[@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

[@YmounikaReddy-i4x]

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

[@princeujjawal829]

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

[@shreyabanik6986]

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

[@vivekpandey794]

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

[@thecloudterminal]

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

[@devangmathur5809]

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

[@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 🎉

[@priyanshusaini8180]

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

[@TechyAyush]

Understood every single bit! Thank you so much mam.

[@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

[@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

[@bhaskarp8326]

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

[@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💓💓💓💓💓

[@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

[@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 😂❤

[@siri-ul7gr]

not a teacher gives the eye to eye contact like 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 .

[@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

[@meenakship993]

can i know which compiler u used

[@cyanider069]

@@meenakship993 I forget the version but any gcc cpp compiler will do the work.

[@PRACHIIKHAR]

// 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

[@DakshGolchha]

❤

[@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....

[@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

[@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.

[@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❤

[@dilleshwarip2789]

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

[@ashisharya1536]

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

[@adarsh_kr_maurya]

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

[@rawatmotorsguptakashi1577]

Great way of explaining really hats off to you jenny.

[@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❤️🔥

[@code-heads]

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

[@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

[@Hamzahameed-ht6jv]

Mam thanks a lot your lecture very helpful for me 🥰😍

[@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!!

[@baikannikitha1897]

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

[@PB30K]

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

[@srivanikothavadla4606]

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

[@bhargavsaivedrapolu9845]

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

[@SAymanShariff]

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

[@isharaperera419]

Your teachings are masterpiece ma'am!

[@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...

[@stylingcastle6347]

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

[@prathmeshpawar5591]

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

[@gattineniakhil1990]

Good teaching,your videos are helpful to so many students

[@vakhariyajay2224]

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

[@atharvkumbhar1463]

23:06 min successfully invested. ....❤

[@SrinivasRao-ev7pn]

You are such a down to earth person

[@farazkhan496]

It very helpful mam❤

[@harishr3153]

Thank you so much mam your teaching was great mam and useful to me for tomorrow exam mam

[@sudhirverma4790]

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

[@dharani.p1884]

really superb mam I understood this concept

[@dhrubajyotighosh4646]

Mam in the void enqueue function can I write Queue front= max-1 it instead of queue rear=max-1

[@VK_BRANDING]

adv congo for 2M🥰🥰🥰

[@pravinbudage1830]

if you would have meet us in the college, then it would have been great. Good way of explaining the things on whiteboard.

[@harikaburagapu]

Thank mam for your great efforts.....really this lecture was great helpful to us...

[@nallayahanushan7906]

Thank you and I love you a lot for your help mam💝💖

[@AdityaSingh-in6ce]

do we have to write #include at beginning of programs in stacks , linked list or queues or just #define N

[@AjayYadav-dr5us]

Osm mam ,, your teaching mechanism is so glamorous,Anxom , love you mam

[@aadinarayana6385]

Its really ossum it helped me a lot this is one of the easiest way of explaination

[@wahidegulzar9705]

In for loop can we use .... for (i=front; i

[@Trueaccount.]

Empty means underflow ,na

[@syzygy5998]

Mam I think that last code is N%(rear+1)

[@yathisharadhya9789]

If rear is intialzed with -1 then both front and rear are pointing to same end of queue. Kindly check insertion happens along same side and deletion too.

[@BinaryBazaar501]

super method of teaching

[@yashwanthm2925]

Empty = mpt

[@shayanahmed1418]

Excellent explanation. To the point.Thanks a lot.

[@mitgenius]

So great !! Thanks for this

[@ronatkumarmuni4076]

Board mein samjha ne ke baad Program ko C compiler mein run karke dikhana tha na

[@harshil8784]

You did a great job

[@9893011111]

Last vdo you said that enqueue, dequeue should be done in O(1) complexity, Why ? why after dequeue, we are not shifting items towards front being 0th position. this way CAPACITY will be utilized !? (As happens in movie booking window -- real life example) saw some other videos they are saying moving front to front++ should not be done, is wrong. appreciate your work.

[@YusufKhan-vn8ur]

Great job👍👍.....and i like the way you look into the camera 😍

[@-AshwithaAlladi]

Thank u so much mam 🙏🙏 ur way of explanation is awesome

[@jatinhirani5888]

hello,mam in display function you add a variable int i int the beginning then we can also define in for loop just like for(int i= front; i

[@RoamingRabindra]

Thank you Maam🥰🥰from Nepal😊

[@UniqueBansal44]

Nice video mam .

[@carrompoolgames1997]

Mam your subject is sooo good mam. Keep going on mam. 👍🤗🥳🙏👌🥰👏👏👏

[@divyanshusinghrajput3159]

what a nice teaching skill ma'am

[@BhumiKumari-j8u]

You are amazing 🙏

[@kundu6158]

very very very helpful videos mam 👍🏻👍🏻👍🏻 thanku mam 🙏🙏🙏

[@usmanshabbir8516]

Thanks mam you have solved my problem keep it up....

[@ravalsinhal8078]

Best Quality learning thanks mam

[@aayushverma9476]

very helpful videos mam keep doing it.

[@Advancedmathematics333]

You're genius really