! A data type for which: ! An ADT may be implemented using various. ! Examples:

Size: px

Start display at page:

Download "! A data type for which: ! An ADT may be implemented using various. ! Examples:"

Jocelyn Stella Osborne
5 years ago
Views:

1 Stacks and Queues Unit 6 Chapter ,4-5 CS 2308 Fall 2018 Jill Seaman 1 Abstract Data Type A data type for which: - only the properties of the data and the operations to be performed on the data are specific, - how the data will be represented or how the operations will be implemented is unspecified. An ADT may be implemented using various specific data types or data structures, in many ways and in many programming languages. Examples: - NumberList (implemented using linked list or array) - string class (not sure how it s implemented) Introduction to the Stack Stack: an abstract data type that holds a collection of elements of the same type. - The elements are accessed according to LIFO order: last in, first out - No random access to other elements Operations: Stack Operations - push: add a value onto the top of the stack make sure it s not full first. - pop: remove a value from the top of the stack make sure it s not empty first. Examples: - plates or trays in a cafeteria - bangles isfull: true if the stack is currently full, i.e.,has no more space to hold additional elements - isempty: true if the stack currently contains no elements 4

2 Stack illustrated Implementing a Stack Class int item; stack.push(2); stack.push(3); stack.push(5); item = stack.pop(); //item is 5 item = stack.pop(); //item is 3 stack.push(10); item = stack.pop() item = stack.pop() 5 Array implementations: - fixed size (static) arrays: size doesn t change - dynamic arrays: can resize as needed in push Linked List - grow and shrink in size as needed 6 IntStack: A stack class IntStack: push class IntStack private: static const int STACK_SIZE = 100; // The stack size int stackarray[stack_size]; // The stack array int top; // Index to the top of the stack public: // Constructor IntStack() top = -1; // empty stack ; // Stack operations void push(int); int pop(); bool isfull() const; bool isempty() const; 7 //************************************************* // Member function push pushes the argument onto * // the stack. * //************************************************* void IntStack::push(int num) assert (isfull()); top++; stackarray[top] = num; Stack Overflow: attempting to push onto a full stack. assert will abort the program if its argument evaluates to false. it requires #include <cassert> The driver should ensure that the assert condition is always true before push is called. 8

3 IntStack: pop IntStack: test functions // Member function pop pops the value at the top * // of the stack off, and returns it as the result. * int IntStack::pop() assert (isempty()); int num = stackarray[top]; top--; return num; Stack Underflow: attempting to pop from an empty stack. The driver should ensure that the assert condition is always true before pop is called. //*************************************************** // Member function isfull returns true if the stack * // is full, or false otherwise. * //*************************************************** bool IntStack::isFull() const return (top == STACK_SIZE - 1); // Member function isempty returns true if the stack * // is empty, or false otherwise. * 9 bool IntStack::isEmpty() const return (top == -1); 10 IntStack: driver 19.4 Introduction to the Queue #include<iostream> using namespace std; #include "IntStack.h" int main() // set up the stack IntStack stack; stack.push(2); stack.push(3); stack.push(5); int x; x = stack.pop(); x = stack.pop(); stack.push(10); cout << x << endl; What is output? What is left on the stack when the driver is done? 11 Queue: an abstract data type that holds a collection of elements of the same type. - The elements are accessed according to FIFO order: first in, first out - No random access to other elements Examples: - people in line at a theatre box office - print jobs sent to a (shared) printer 12

4 Operations: Queue Operations q.enqueue(2); Queue illustrated q.enqueue(3); q.enqueue(5); item = q.dequeue(); item = q.dequeue(); q.enqueue(10); - enqueue: add a value onto the of the queue (the end of the line) make sure it s not full first. - dequeue: remove a value from the of the queue (the of the line) Next make sure it s not empty first. Note: and are variables used by the implementation to carry out the operations - isfull: true if the queue is currently full, i.e.,has no more space to hold additional elements - isempty: true if the queue currently contains no 13 elements int item; q.enqueue(2): q.enqueue(3); q.enqueue(5); item = q.dequeue(); //item is 2 item = q.dequeue(); //item is 3 q.enqueue(10); 14 Implementing a Queue Class Same as for Stacks: Array implementations: - fixed size (static) arrays: size doesn t change - dynamic arrays: can resize as needed in enqueue Linked List - grow and shrink in size as needed Implementing a Queue class issues using a fixed length array The previous illustration assumed we were using an array to implement the queue When an item was dequeued, the items were NOT shifted up to fill the slot vacated by dequeued item why not? Instead, both and indices move through the array

5 Implementing a Queue Class Implementing a Queue Class When and indices move in the array: - problem: hits end of array quickly - solution: circular array : wrap index around to of array q.enqueue(3): q.enqueue(4): To wrap the index back to the of the array, you can use this code to increment during enqueue: if ( == queuesize-1) = 0; else = +1; The following code is equivalent, but shorter (assuming 0 <= < queuesize): = ( + 1) % queuesize; Do the same for advancing the index. 18 Implementing a Queue Class Implementing a Queue Class When is it full? When is it empty? : q.enqueue(5); q.enqueue(2); q.enqueue(1); Note: enqueue increments : int x; for (int i=0; i<queuesize;i++) x = q.dequeue(); after the first one: one element left: no elements left, passes : 1 Note: dequeue increments It s full: (+1)%queueSize== 19 It s empty: (+1)%queueSize== 20

6 Implementing a Queue Class IntQueue: a queue class When is it full? (+1)%queueSize== When is it empty? (+1)%queueSize== How do we define isfull and isempty? - Use a counter variable, numitems, to keep track of the total number of items in the queue. enqueue: numitems++ dequeue: numitems-- class IntQueue private: static const int QUEUE_SIZE = 100; //The queue size int queuearray[queue_size]; // The queue array int ; // Subscript of the elem int ; // Subscript of the elem int numitems; // Number of items in the queue public: // Constructor IntQueue() = 0; = -1; numitems = 0; // Queue operations void enqueue(int); int dequeue(); bool isempty(); bool isfull(); ; Why =0; =-1;? isempty is true when numitems == 0 The first enqueue increments and puts element at position 0 (now ====0). The first dequeue removes element at isfull is true when numitems == queuesize ( position 0) A static queue: enqueue/dequeue // Enqueue inserts a value at the of the queue. * void IntQueue::enqueue(int num) assert(isfull()); = ( + 1) % QUEUESIZE; //calc new position queuearray[] = num; //insert new item numitems++; //update count // Dequeue removes the value at the of the * // queue and returns the value. * int IntQueue::dequeue() assert(isempty()); int result = queuearray[]; //retrieve item = ( + 1) % QUEUESIZE; //calc new position numitems ; //update count 23 return result; IntQueue: test functions // isempty returns true if the queue is empty, * // otherwise false. * bool IntQueue::isEmpty() return (numitems == 0); // isfull returns true if the queue is full, otherwise * // false. * bool IntQueue::isFull() return (numitems == QUEUE_SIZE); 24

7 IntQueue: driver 19.2 A Dynamic Stack Class: #include<iostream> using namespace std; #include "IntQueue.h" int main() // set up the queue IntQueue q; int item; q.enqueue(2); q.enqueue(3); q.enqueue(5); item = q.dequeue(); item = q.dequeue(); q.enqueue(10); cout << item << endl; What is output? What is left on the queue when the driver is done? 25 class DynIntStack private: struct Node int data; Node* next; ; Node* head; // ptr to top public: // Constructor DynIntStack() head = NULL; // empty stack ; head points to top element. add and remove at of list // Stack operations void push(int); int pop(); bool isfull() const return false; bool isempty() const return head == NULL; 26 A Dynamic Stack Class: Push and pop from the head of the list: A Dynamic Stack Class: Push and pop from the head of the list: //************************************************* // Member function push pushes the argument onto * // the stack. * //************************************************* void DynIntStack::push(int num) assert(isfull()); Node *temp = new Node; temp->data = num; temp->next = head; head = temp; //allocate new node //insert at head of list 27 // Member function pop pops the value at the top * // of the stack off, and returns it. * int DynIntStack::pop() assert(isempty()); int result = head->data; //retrieve item Node * temp = head; head = head->next; //head points to second item delete temp; //deallocate item return result; 28

8 19.5 A Dynamic Queue Class: Use pointers and to point to first and last elements of the list: NULL A Dynamic Queue Class: class DynIntQueue private: struct Node int data; Node* next; ; Node* ; // ptr to first Node* ; // ptr to last public: // Constructor DynIntQueue() = NULL; = NULL; // Queue operations void enqueue(int); int dequeue(); bool isfull() const return false; bool isempty() const return == NULL; ; A Dynamic Queue Class: Enqueue at the, dequeue from the : A Dynamic Queue Class: Enqueue at the, dequeue from the : // Enqueue inserts a value at the of the queue. * void DynIntQueue::enqueue(int num) assert(isfull()); Node *temp=new Node; temp->data = num; temp->next = NULL; //allocate new node if (isempty()) = = temp; //set AND to node else ->next = temp; //append to of list = temp; //reset 31 // Dequeue removes the value at the of the * // queue and returns the value. * int DynIntQueue::dequeue() assert(isempty()); int value = ->data; Node *temp = ; = ->next; delete temp; return value; //retrieve item // points to 2nd item //deallocate removed item 32

Introduction to the Stack. Stacks and Queues. Stack Operations. Stack illustrated. Week 9. elements of the same type.

Introduction to the Stack. Stacks and Queues. Stack Operations. Stack illustrated. Week 9. elements of the same type. Stacks and Queues Week 9 Gaddis: Chapter 18 (8th ed.) Gaddis: Chapter 19 (9th ed.) CS 5301 Fall 2018 Jill Seaman Introduction to the Stack Stack: a data structure that holds a collection of elements of