Complete Queue Data Structure | in One Shot | Java Placement Course

TimeStamps :
Start - 00:00
Introduction - 00:12
Operations - 03:26
Queue using Array - 05:30
Circular Queue using Array - 16:00
Queue using Linked List - 27:00
Queue using Collection Framework - 33:49
Question (Queue using 2 Stacks) - 37:00

[jayant]

ArrayDeque vs LinkedList Implementation:
-In Deque a small number of insertions run in Θ(n) time by doubling the array capacity and copying elements over.
-Accesse time -dynamic arrays are usually faster than linked lists.
-Memory - Linked list usually take O(n) total extra memory due to the storage of an extra pointer in each element.
-Worst CAselinked list versions have better worst-case behavior


Conclusion: If per operation time is not important, Deque implementation is better

[Rahul-ivxm]

13:55 time complexity of peek operation in queue is o(1). btw the lecture was greatt.

[mohdsameer]

If you need efficient random access or require frequent modifications at both ends of the queue, ArrayDeque is a better choice. On the other hand, if fast insertion and removal at the beginning or end of the queue are the main concerns, LinkedList can be a suitable option.

[swapnilkumar]

Just one word 'Thankyou'
Thank you for each and everything you guys are doing for us 😊
I'm in first year and I cannot describe how beneficial the videos are for me. Thank you Shraddha didi, Aman Bhaiya & team for the efforts ❤️

[mahuakundu]

I really liked your teaching style and it is excellent!

However, in this Queue Implementation, a few things need to modify.
1. We should not use the static method while creating Data structures like Stack, array, LinkedList, and queue because we should use static for utility classes in order to check like-string to upper-class and lower-class, etc.
2. In this queue data structure, we need to store some value that is the purpose.

3 .When to use the static class:
Static should use when you give some input and act on that and return something. It never persists in anything.
in your program, you used the static class Queue-it should Non-static Queue class.

Overall, I really enjoyed your every video. you are doing a really great job. Keep it up!!!

[riyamandlikar]

The best page I've ever come across. Thank you, your examples after explaining are the cherry on the cake.💝

[rajatbarthwal]

Great explaination, I was struggling with the topic but now it's clear.
Thanks

[sonuakhtar]

Very nice and informative video, very well explained without creating any confusion.
Thanks to you.

[ABHISHEKKUMAR-ekdl]

plzz maam make video on binary tree, heapmap, graph also ur teaching way is awesome very easy to understand... I m from electrical background and watch every video if I know coding it all because of u .... u r great mentor

[satyamagrahari]

Hi Team, so basically content is too much good and guys are also lovely one thing i would like to inform you that during teaching the concept you speed should be little bit slow then we can understand better with good mindset your every video too much helpful, needful for us. Thanks a lot to you guys for creating such a nice content. A lot of love from my side. :)

[madhusudans]

Mam please make more videos on java placement course I am a third year undergrad student currently in 6th sem companies will be arriving in next 6 months and continously following these placement course series in java.
Requesting @Apna College to upload videos regularly waiting since over a week for next upcoming videos.

[javadotcode]

The removal of the elements from the queue can be done in O(1) by just incrementing the front pointer and when it reaches to rear make front and rear -1
It will never take O(n) to peek and remove from the queue.

[ankitpradhan]

ma'am, tbh u r just an angel for me thanks for the teaching. A most understanding and a teacher with all behaviors of a student just a complete package. Thanks a lot.

[farmanali_]

I was waiting for this video.
Thanks 😊👍

[prachipatil]

Please upload videos frequently ...and complete the course ...please...and thanks for wonderful content

[divyapasreeja]

Shradha,
You explained the queue concept in so easy manner.Thank you so much.
Would you please explain how the complexity of peek method is O(n)?
As far as I think it should be O(1) as we are just printing the 0th element of the array.

[mightyraju]

Thank you very much didi. You are doing great job...I follow this java placement course.

[aashishsinghnagvanshi]

congratulations aman bhaiya shardha didi and all the members of apna college family aaj hamri family 1 million ki ho gyi. ye ham sabhi kabhi glorious moment hai

[gautamrawat]

Thank you mam for your support🙏🙏 i am eagerly waiting for your videos

[OGDEEPAK]

Osm vedio ma'am. It's very helping us ☺
..