queues can assist in the construction of timing simulations simulations use random number generators to create real-life situation and allow us to answer "what iftypes of questions deques are data structures that allow hybrid behavior like that of stacks and queues the fundamental operations for deque are add_frontadd_rearremove_frontremove_rearand is_empty lists are collections of items where each item holds relative position linked list implementation maintains logical order without requiring physical storage requirements modification to the head of the linked list is special case key terms balanced parentheses first-in first-out (fifoinfix linked list node precedence simulation data field fully parenthesized last-in first-out (lifolinked list traversal palindrome prefix stack deque head linear data structure list postfix queue discussion questions convert the following values to binary using "divide by show the stack of remainders convert the following infix expressions to prefix (use full parentheses)( ( ( (( ( ) * * * + + convert the above infix expressions to postfix (use full parentheses convert the above infix expressions to postfix using the direct conversion algorithm show the stack as the conversion takes place evaluate the following postfix expressions show the stack as each operand and operator is processed basic data structures