Stacks and Queues

What are stacks and queues in computer science? In this random Wednesday episode, we explore the concepts and study their implementation in-depth!

= CREDIT =
NB: Outtro theme was made in-house. All rights reserved.
Intro Theme contains elements from the public domain

= 0612 TV =

Enjoy your stay, and don't hesitate to drop me a comment or a personal message to my inbox =) If you like my work, don't forget to subscribe!

= NERDfirst =
NERDfirst is a project allowing me to go above and beyond YouTube videos into areas like app and game development. It will also contain the official 0612 TV blog and other resources.

-----

Disclaimer: Please note that any information is provided on this channel in good faith, but I cannot guarantee 100% accuracy / correctness on all content. Contributors to this channel are not to be held responsible for any possible outcomes from your use of the information.

[exodusfivesixfivesix]

An entire 60minute class wrapped up into 15min. Nice work man.

[brianmaxx]

dude, you rocked this. best tutorial on a particular subject. A+.

[Nonsense]

only fantastic intro explanation to stacks and queues I could find on YouTube. Thank you so much for putting the content together and doing all the work to get it here so we can enjoy.

[akirawashere]

great explanation man, thanks for your help!

[YungPimp]

I did not understand anything from my Professor, But Thanks to you, made it crystal clear.

[jasonwu]

You are better than the programming profs in university of waterloo, thank you!

[ganapatiavabrath]

Your Lecture is very good quality, informative. Thank you sir

[waterfiend]

This is unbelievably helpful. An amazing, in depth explanation of both data structures!

[Desireable]

Hello there! i just want to say this was the most clearest explanation of stacks and queues that has been explained to me. Thank you.

[mountainkat]

Love this. I actually didn't know about the short cut for using the mod function.

[fantasylla]

Great explantion man, it is clear, concise and short. Very

[arjungurjar]

you're amazing . I really the love the way you explain things, you explained everything in a single video.
thank you very much .

[salthesadmanshark]

still useful in 2021. thanks for the video (from the future) :3

[waldmilsonvilhete]

it's amazing. your explaination is straightforward. cool!

[davidchiumeraable]

Great video. It was long, but if you take it slow you come out with a great understanding. Thanks for the info brother :)

[SamarKhan-pqjc]

hey very nice video!!! i missed my classes on the topic in school and the video was a really big help!! strongly recommended!

[lincolnsand]

For the Queue: You could also store the last instruction as a bool (true for remove and false for add). Then if the pointers are pointing to the same and the last instruction wad remove, it's empty and vice versa for full. Then you don't need to keep around an extra empty wasted slot in the Queue. This is slightly nicer and more efficient imo.

[oldnick]

Man.... You have elaborated pretty nicely!

[SkillUpMobileGaming]

Resize the stack if it is full (which only happens with arrays) – don't throw an error. Just put all of the elements into a larger array.

[bbs-]

great explanation in very details. thanks
Could you do a BigO natation video for new beginner?