✳flâneur — a map of the web's best reading

CS106B Stacks and Queues

web.stanford.edu · 4,438 words · saved by 1 readers

Today we will discuss use of Stack and Queue. These containers store data in an ordered format and are used to solve many problems. Lecture Video Contents 1. Announcements 2. Attachments 3. Preliminaries: Client-Side Approach to ADTs 4. Passing Containers by Reference 5. Stack Overview 6. Stack Examples in Code 7. Stack Applications 8. Vectors as Stacks (and a Note About the Power of Abstraction!) 9. An Important Interlude: break Statements 10. Queue Overview 11. Queue Examples in Code 12. Mod Operator (%) 13. Queue Applications 14. Range-Based Loops and Output Streams for Vectors, Grids, Stacks, and Queues 15. Supplementary Stack Application: Postfix Notation 16. What's next? 17. Exam Prep Announcements Attachments For ease of access, here are the stack and queue vizualization programs I used in lecture today: Preliminaries: Client-Side Approach to ADTs I mentioned again at the top of class today that we're currently taking a client-side approach to the ADTs we're exploring. That

CS106B Stacks and Queues Stacks and Queues Monday, June 29 Today we will discuss use of Stack and Queue . These containers store data in an ordered format and are used to solve many problems. 📚 Readings: Text 5.1 - 5.3, Class documentation for Stack and Queue 📝 Lecture quiz on Canvas Contents 1. Announcements 2. Attachments 3. Preliminaries: Client-Side Approach to ADTs 4. Passing Containers by Reference 5. Stack Overview 6. Stack Examples in Code 7. Stack Applications 8. Vectors as Stacks (and a Note About the Power of Abstraction!) 9. An Important Interlude: break Statements 10. Queue Over

Explore this link on the map →

related reading