Skip to main content\(
\newcommand{\lt}{<}
\newcommand{\gt}{>}
\newcommand{\amp}{&}
\definecolor{fillinmathshade}{gray}{0.9}
\newcommand{\fillinmath}[1]{\mathchoice{\colorbox{fillinmathshade}{$\displaystyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\textstyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\scriptstyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\scriptscriptstyle\phantom{\,#1\,}$}}}
\)
Section 3.23 Matching
Checkpoint 3.23.1.
Match the term with their corresponding definition
Incorrect
- algorithm
- Generic step-by-step list of instructions for solving a problem
- balanced parentheses
- Each opening symbol has a corresponding closing symbol and the pairs of parentheses are properly nested
- deque
- Ordered collection of items with two ends and the items remain positioned in the collection. New items can be added at either the front or the rear
- first-in first-out (FIFO)
- First item added is also the first removed
- linear data structure
- Data structure with elements that have positions relative to each other
- palindrome
- String that reads the same forward and backward
- simulation
- Replica of a process or operations
- precedence
- Hierarchy on the order things occur
Checkpoint 3.23.2.
Match the term with their corresponding definition
Incorrect
- postfix
- Expression notation in which all operators come after the two operands that they work on
- prefix
- Expression notation in which all operators precede the two operands that they work on
- queue
- Ordered collection of items where the addition of new items happens at one end and the removal of existing items occurs at the other end
- last-in first-out (LIFO)
- Last item added is also the first removed
- stack
- Ordered collection of items where the addition of new items and the removal of existing items always takes place at the same end
- fully parenthesized
- Usage of one pair of parentheses for each operator
- infix
- Expression notation in which the operator is in between the two operands that it is working on
