Hello Micheal! I have just stumbled upon your videos from 10 years old and it seems like you have recently started to continue creating videos like this! Those videos always carry an essence of the problem. Please keep uploading!
My guy, you should definitely do some more topics like drawing NFAs => DFAs, LR(1) parsing automatons => LALR(1) parsing automatons. just finished my languages course and had to rely on some random terrible videos to study. :^)
I think it is critical to also mention Peek. My professor also hasn't mentioned it, and in my opinion, it is critical to using a queue. I can hardly imagine a queue that doesn't use it.
Good video, simple and straight to the point. Just one suggestion: deque is pronounced "deck" and not "de-queue". It's a different data structure than queues, but using it in your queue is great for performance, as you say.
Here's some psuedocode for Enqueue and Dequeue if anyone would like it: // IN PSUEDOCODE // DECLARTION OF VARIABLES DECLARE Queue : ARRAY[0:9] OF STRING DECLARE FrontPointer : INTEGER // Start of the queue DECLARE RearPointer : INTEGER // End of the queue DECLARE Length : INTEGER // Current size of the queue CONSTANT MaxLength = 10 // Max no of elements in the queue // Initialisation of variables FrontPointer
