Embed presentation
Download to read offline


































The document covers lectures 17 and 18 of the CS261 course on data structures and algorithms, focusing on queues, dequeue, circular queues, and priority queues. It is presented by lecturer Azka Aziz. The content aims to provide an introduction and understanding of these data structures.

































