Section 3.1 Objectives
-
To understand the abstract data types: stack, queue, and deque.
-
To be able to use the ADTs (stack, queue, and deque) using Standard Template Library of C++.
-
To understand the performance of the implementations of basic linear data structures.
-
To understand prefix, infix, and postfix expression formats.
-
To use stacks to evaluate postfix expressions.
-
To use stacks to convert expressions from infix to postfix.
-
To use queues for basic timing simulations.
-
To be able to recognize problem properties where stacks, queues, and deques are appropriate data structures.
You have attempted 1 of 1 activities on this page.