CSC 217 Lab 09 - Stacks and Queues

CSC 217 Lab 09 - Evaluate Runtime Efficiency

CSC 217 Lab 09 Evaluate Runtime Efficiency

Creating specialized data structures means that we can gain efficiencies in our add and remove operations. Let’s explore the runtime complexities of each of our current stack and queue implementations.

Runtime Efficiencies

Consider the underlying data structure and determine the runtime efficiency of the following methods:

  • push()/enqueue()
  • pop()/dequeue()
  • isEmpty()
  • size()

Fill out the Runtime Efficiency Google Form with your answers!