CMPSC 24 Chapter Notes - Chapter 8: Array Data Structure, Linked List, Member Variable
Document Summary
Rear = the end of the queue where entries can be inserted. Front = the end of the queue where entries can be removed. First entry = the entry at the front end of the queue. Fifo = entries are removed in exactly the same order that they were added. Queue overflow = occurs if a program attempts to add an entry to a queue that is already at its capacity. Queue underflow = occurs if a program attempts to remove an entry from an empty queue. Buffering the input = when the program asks for input, the operating system provides characters from the front of its queue. Palindrome = string that reads the same forward and backward. Read the line of text into a stack and a queue. Write out (compare) the contents of the stack and the contents of the queue. If the two output lines are the same, then the input string must be a palindrome.
