• Unit 2: Introduction to Stacks and Queues

    This unit will introduce you to two basic Data Structures--Stacks and Queues--and identify the operations that must be provided with each Stack and Queue implementation. Students will also learn how arrays and circular arrays can be used to implement a Stack and a Queue and discuss the advantages and disadvantages of their use.

    Completing this unit should take approximately 3 hours.

    • 2.1: Introduction to Lists

    • 2.2: Implementing Lists with Arrays

    • 2.3: Overview of Stacks and Queues

    • Unit 2 Assessment

      • Unit 2 Assessment Quiz

        Take this assessment to check your understanding of the materials presented in this unit.

        Notes:

        • There is no minimum required score to pass this assessment, and your score on this assessment will not factor into your overall course grade.
        • This assessment is designed to prepare you for the Final Exam that will determine your course grade. Upon submission of your assessment you will be provided with the correct answers and/or other feedback meant to help in your understanding of the topics being assessed.
        • You may attempt this assessment as many times as needed, whenever you would like.