Teaching stacks and queues in grades 11-12 (level 2) does not have to be complicated. Picture a backend engineer choosing a queue to fairly process thousands of incoming server requests without dropping any. That kind of thinking is exactly what Oklahoma's grades 11-12 (level 2) computer science standard L2.AP.V.01 asks students to practice \u2014 and it is very teachable with the right materials. This post walks through what the standard means, the misconceptions students bring to it, and discussion starters you can use tomorrow, whether you teach in a classroom or at your kitchen table.<\/p>\n
\nCompare and contrast data structures and their uses (e.g., lists, stacks, queues).\n\u2014 Oklahoma Academic Standards for Computer Science (February 2023)<\/em><\/p>\n<\/blockquote>\n
In plain language: This standard asks students to compare different ways a program can store a group of items, and to explain which way fits best for a given situation \u2014 whether the program needs to grab any item directly, grab the newest item first, or grab the oldest waiting item first.<\/p>\n
In student-friendly terms, the learning target is: "I can compare and contrast lists, stacks, and queues by describing how each one controls access to its data, and I can choose and justify the best-fit structure for a given real-world scenario."<\/strong><\/p>\n
What Students Should Be Able to Do<\/h2>\n
\n
- I can describe how a list, a stack, and a queue each control access to their elements, using index, LIFO, and FIFO correctly.<\/li>\n
- I can trace push\/pop operations on a stack and enqueue\/dequeue operations on a queue, showing the contents change accurately at each step.<\/li>\n
- I can identify which structure best fits a described scenario and explain why, referencing its access order.<\/li>\n
- I can explain what overflow and underflow errors are and why professional code checks for them.<\/li>\n<\/ul>\n
Along the way, students pick up the working vocabulary of the topic: list, array, stack, queue, index, element, push, enqueue, dequeue, traversal, capacity, overflow, underflow.<\/p>\n
Stacks And Queues: Misconceptions to Watch For<\/h2>\n
These are the wrong turns students reliably take with this standard \u2014 knowing them ahead of time is half the lesson plan. Each correction strategy below comes straight from the unit's teacher guide (the paragraph and activity references point into the unit itself).<\/p>\n
1. "A stack and a queue are basically the same thing, just with different names."<\/strong><\/p>\n
Return to paragraph 6's side-by-side comparison. Have students trace the same sequence of adds and removes on both a stack and a queue and compare the resulting order to see the LIFO\/FIFO difference directly.<\/p>\n
2. "A list is always the best choice because it lets you access anything."<\/strong><\/p>\n
Use the undo-feature example from paragraph 4. Ask students what would happen if undo used a list instead of a stack \u2014 the program would have to search for the most recent action instead of simply popping it, which is slower and more complex.<\/p>\n
3. "Overflow only happens with stacks, and underflow only happens with queues."<\/strong><\/p>\n
Point back to paragraph 8, which defines both errors for any structure with a boundary. Have students identify an overflow and an underflow scenario for a list, a stack, and a queue to see the errors apply to all three.<\/p>\n
4. "Index 1 refers to the first element in a list."<\/strong><\/p>\n
Model a small example together, such as a 3-item list, and have students state what element sits at index 0. Reinforce that most programming languages start counting positions at 0, so index 1 is actually the second element.<\/p>\n
Discussion Starters You Can Use Tomorrow<\/h2>\n
\n
- Why might a programmer choose a stack over a list even though a list allows access to more positions?<\/li>\n
- Describe a real-world process (not a computer program) that behaves like a queue, and one that behaves like a stack. What makes each one fit its label?<\/li>\n
- If overflow means a structure is too full and underflow means it is too empty, why do professional programmers check for both before performing an operation?<\/li>\n<\/ul>\n
Bringing It Home<\/h2>\n
This topic is a natural one for families. One ten-minute activity to try: Together, look around your home for an example of each: something organized like a stack (a pile of folded towels, mail on a desk) and something organized like a queue (a waiting list, a line for the bathroom). Have your student explain out loud which item would come off first in each case and why. There are no wrong answers \u2014 the goal is hearing their reasoning about access order.<\/p>\n
Where This Leads<\/h2>\n
Students who can compare and contrast lists, stacks, and queues by describing how each one controls access to its data, and choose and justify the best-fit structure for a given real-world scenario are building skills used every day in software engineering, backend \/ systems engineering, data engineering, compiler \/ language engineering, and computer science education.<\/p>\n\n
See the Unit in Action<\/h2>\n\n