CMPT 115 Lecture Notes - Lecture 12: Process Control Block, The Queue, Multiprocessing
Document Summary
Notes written by michael horsch, mark eramian, ian mcquillan, lingling jin, and dmytro dyachuk. A queue: a queue is another type of ordered, linear list, like stacks, they are restricted in the way that we can insert and delete from them, a familiar concept: a rst-come rst-serve lineup. Anybody who joins the lineup, joins at the end. Queues: deleting from the front of the queue is known as a dequeue. We can dequeue the front element from the queue: adding to the back of the queue is known as an enqueue. We can enqueue some new element onto the back of the queue: these are the only ways in which we can insert and delete from the queue. 2 applications of queues: bu ering, process scheduling. This is another video about cats because cats. 0:00 / 4:59: youtube sends video data (producer); video player displays data (consumer, variables that a ect video experience:
