Advanced Java Concepts Unit 3: Stacks and Queues

Transcription

1 Advanced Java Concepts Unit 3: Stacks and Queues Stacks are linear collections in which access is completely restricted to just one end, called the top. Stacks adhere to a last-in, first-out protocol (LIFO). Think of a stack of plates; the last plate placed on the stack is the first one you take off. Java does have a Stack Class; here are some of its methods. Method Boolean empty() E peek() E pop() void push( E element) int size() Description Precondition: the stack is not empty Returns the object at the top of the stack (but does not remove it) Precondition: the stack is not empty Removes and returns the object at the top of the stack Adds an element to the top of the stack Note. Java implements the Stack class as a subclass of the Vector class which implements the List interface. You will need an import statement whenever you need to use this class. 1. Why do people criticize Java s stack class? What alternative could have been used? 2. What does this code snippet display? 3. This code compiles. Will there be a run-time error? If yes, explain. If no error, what is displayed? Stack<Integer> st = new Stack<Integer>(); st.push( 1 ); st.push( 2 ); st.push( 3 ); System.out.println( st.pop() ); System.out.println( st.pop() ); System.out.println( st.pop() ); import java.util.*; public class TryStacks { public static void main(string[] args) { Stack<String> st = new Stack<String>(); st.push( "A" ); st.push( "B" ); System.out.println( st.pop() ); System.out.println( st.peek() ); System.out.println( st.pop() ); Page 1

2 One area where stacks are used is in memory management. The exact details of how computer memory is managed depend on the computer s operating system and the programming language. However, the following simplified description can be useful. Whenever a method is called, an activation record is created. This activation record includes any parameters, local variables, and probably other things I m not aware of. This activation record is placed on the stack an area of program memory reserved for this purpose. When the method is complete, the activation record is popped off the stack. The top most activation record on the stack is the method currently being executed. 4. A program has a main method and two other methods: method A and method B. The figure to the right shows the current state of the program s stack. Which statement is TRUE? a) methoda is currently running. b) methodb is currently running. c) The main method is currently running. d) There is not enough information to answer this. 5. Given the current state of the program s stack, what do you know about methoda? Note. While nothing may be technically correct for you, it is not the correct answer for this question. methodb methoda main methoda methoda main top of stack top of stack 6. Program. Here is an algorithm for converting a non-negative base 10 number to a base 2 number. 1. Find the remainder when the number is divided by two. Push the remainder onto a stack. 2. Number = number / 2 3. Go back to step 1. Keep repeating as long as the number is greater than zero. 4. Print out the contents of the stack (i.e. print the topmost first, then the second and so on). Write a program that implements the above algorithm. After you get the basic version working, clean it up as follows: Instruct the user to enter an integer between 0 and Convert the number into base 2. Add leading zeroes (if needed) so that there is a total of 16 zeroes and ones. When you print the result, add a blank space between every four bits. For example, If the user enters 513, your program should display If the user enters 60013, your program should display If the user enters 0, your program should display Your prompt to the user must be: System.out.println( "Integer?" ); Page 2

3 7. Program. Complete the reverse method. It takes a stack and returns a copy that is in reverse order. Postcondition: the state of the parameter matches its state before the method was called. Your solution can only use stacks, no array lists, no linked lists, etc. public static void main( String [] args ){ Stack<Integer> stack = new Stack<Integer>(); stack.push( 4 ); stack.push( 5 ); stack.push( 6 ); stack.push( 7 ); Stack<Integer> new_stack = reverse( stack ); System.out.println( stack ); // [4, 5, 6, 7] System.out.println( new_stack ); // [7, 6, 5, 4] public static Stack<Integer> reverse( Stack<Integer> st ){... Evaluating Arithmetic Expressions. Before we discuss how stacks are used in evaluating arithmetic expressions, we need to discuss the three ways an expression can be written. Form Description Example infix Each operator is located between its operands This is the form you know and love. prefix The operator is placed to the left of the operands. This is also known as Polish notation. postfix The operator is placed to the right of the operands. This is also known as Reverse Polish notation Infix notation sometimes requires the use of parentheses. Prefix and postfix notation do not require (and therefore do not use) parentheses. In fact, in prefix and postfix notation the order of operations is completely determined by the order of the operators. Some early (1970 s and 80 s) handheld calculators required that users enter the expressions in reverse Polish notation. Please read the Wikipedia articles, (prefix) and (postfix) on these topics. To evaluate an expression in prefix notation, you scan the statement from left to right. As soon as you see two adjacent operands, you perform the operation specified by the operator immediately preceding it. Then you replace the operator and two operands with the result. Keep repeating until you have a result. IMPORTANT. If the result of a particular operation is a negative number, then the resulting operand is negative (you are not adding a subtraction operator to the expression). Here are a couple of examples. + * scanning left to right we find the operands 3 and 4 and the operator right before them is * so we multiply them together and replace them with so we add 12 and 5 together 17 is the result Page 3

4 Another example / scanning left to right the first pair of operands we find is 8 and 2 so we divide them and replace / 8 2 with replace with replace with is an operand, add -6 and 3 together -3 is the result Problems 8 to 12. Evaluate the following prefix expressions. 8) / ) / + * ) * ) + 10 / * ) * To evaluate an expression in postfix notation, you scan the statement from left to right. As soon as you see two adjacent operands followed by an operator, you perform the operation specified and replace the operator and two operands with the result. Keep repeating until you have a result For example: * scanning left to right we find the operands 6 and 7 and the operator right after them is + so we add them together and replace them with * multiple 13 by 2 26 is the result Another example * - 2 / scanning left to right the first pair of operands followed by an operator we find so we replace that with * - 2 / replace 6 9 * with / replace with / -51 is an operand, divide -51 by is the result Problems 13 to 17. Evaluate the following postfix expressions. 13) * 14) * 15) / + * 16) 9 2 * 3 5 * + 17) / * * Page 4

5 I ll leave it up to you to find out how to convert prefix and postfix expression into the corresponding infix expressions and vice versa. Problems 18 to 22. Rewrite each statement from infix form to prefix and postfix forms. YOU MUST KEEP THE OPERANDS IN THE SAME ORDER (sorry for shouting). Infix Prefix Postfix * * * (2 + 3)(4 5) (5 2) 23. Program. Complete the Eval class. Given a valid postfix expression, the evalpostfix method will return the value of that expression. The method should be able to handle: *, /, +, -. and ^ (exponent). You may assume that there is exactly one space between each operator/operand. However, there may be any number of spaces at the start and end. public class Eval{ public static int evalpostfix( String s ){ Call the trim method to remove any leading or trailing spaces Call the split method to create a String array that consists of the numbers and operands in the string. All spaces should be removed. Create a string stack. Iterate through the array. If the element is a number, push it onto a stack. If the element is an operator, pop the last two elements off the stack, evaluate the expression and push the result onto the stack. When you are finished iterating through the array, the size of the stack should be one. Pop that value off the stack, convert it to an int and return it. Some sample test data: String s1 = " * + "; System.out.println( Eval.evalPostfix( s1 ) ); // 22 String s2 = " * "; System.out.println( Eval.evalPostfix( s2 ) ); // 77 String s3 = " / "; System.out.println( Eval.evalPostfix( s3 ) ); // 9 String s4 = " * / "; System.out.println( Eval.evalPostfix( s4 ) ); // -12 Some hints and suggestions are on the next page. Page 5

6 Suggestions for program described on the previous page: trim and split are methods of the String class. Write a helper method that determines if a string is a number. This can be done by using the Character.isDigit method though remember that the number could be positive or negative. Or you could write a method that checks by using a try-catch thingee. Does this sound familiar? Maybe? (Voice getting higher each time.) Write other helper methods as appropriate. Queues are linear collections in which elements can only be added to one end and you can only remove elements from the other end. Think of a line to buy tickets. When people arrive they go to the end of the line; the person at the head of the line is the next person to be served. This is called a first-in, first-out protocol (FIFO). Java has a Queue interface to support this abstract data type. Important Methods of the Queue Interface Method Description boolean add( E element ) Adds element to the rear of the queue and returns true if room is available or returns false otherwise. boolean isempty() Returns true if the queue is empty. E peek() Returns the object at the front of the queue or null if the queue is empty. E remove() Precondition: the queue is not empty. Removes and returns the object at the front of the queue. int size() Returns the number of objects in the queue. The LinkedList class implements the Queue interface. For example: import java.util.*; public class Example { public static void main(string[] args) { Queue<String> q = new LinkedList<String>(); q.add( "B" ); // prints A // prints B Page 6

7 Priority Queues are similar to queues in that items are added to the end of the queue and removed from the head of the queue. They are different in that more important elements go to the head of the line. For example, imagine an emergency room at a hospital. As people arrive they get in line and wait their turn. However, if someone comes in with a life-threatening problem, they go to the head of the line. Java has a PriorityQueue class that implements the Queue interface. The default constructor places objects in the queue according to their natural order which is defined by how they implement the Comparable interface (i.e. the compareto method). The item with the smallest value is removed first. For example, in the String class A is less than B so it will go to the head of the queue. import java.util.*; public class Example { public static void main(string[] args) { PriorityQueue<String> q = new PriorityQueue<String>(); q.add( "B" ); q.add( "H" ); q.add( "C" ); // prints A // prints B // prints C // prints H Note. Suppose you have a class named Dog that does not implement Comparable. The following code will compile: PriorityQueue<Dog> q = new PriorityQueue<Dog>(); Dog d1 = new Dog( "hank" ); Dog d2 = new Dog( "bob" ); q.add( d1 ); q.add( d2 ); However, when you try to run it you will get the following runtime error: java.lang.classcastexception: Dog cannot be cast to java.lang.comparable Page 7

8 Queues and Priority Queues 24. What is displayed? Queue<Integer> q = new LinkedList<Integer>(); q.add( 14 ); q.add( 5 ); q.add( 12 ); 25. What is displayed? PriorityQueue<Integer> q = new PriorityQueue<Integer>(); q.add( 14 ); q.add( 5 ); q.add( 12 ); 26. What is displayed? Queue<String> q = new LinkedList<String>(); q.add( "M" ); q.add( "G" ); q.add( "K" ); while (! q.isempty() ) 27. What is displayed? PriorityQueue<String> q = new PriorityQueue<String>(); q.add( "M" ); q.add( "G" ); q.add( "K" ); while (! q.isempty() ) 28. What is displayed? PriorityQueue<String> q = new PriorityQueue<String>(); q.add( "apple" ); q.add( "a" ); q.add( "xray" ); The ASCII code for A is 65. q.add( "Adam" ); The ASCII code for a is 97. q.add( "ZOO!" ); while (! q.isempty() ) Page 8

9 29. Program. Complete the removethis method. It should remove every occurrence of s from the queue but leave all the other elements in their original locations. In the method make one pass through the queue, removing elements as you go. If the element does not match s, then add it back to the queue. import java.util.*; public class RemoveQueue { public static void main(string[] args) { Queue<String> q = new LinkedList<String>(); q.add( "C" ); q.add( "B" ); q.add( "B" ); System.out.println( q ); // [A, A, C, A, B, B, A] removethis( q, "A" ); // [C, B, B] System.out.println( q ); s){ public static void removethis( Queue<String> qe, String Program. This program models an emergency room and it has three classes. The Patient class obviously represents a patient at a hospital. public class Patient implements Comparable<Patient>{ private String name; private int condition; // 1 = worst, 10 = not too bad public Patient( String n, int c ){ name = n; condition = c; public String tostring(){ return name; public int compareto( Patient other ){ /* patients are compared based on their condition. Return a negative number if this patient s condition is more severe than the other patient. Return a zero if the conditions are the same. Return a positive number if the other guy is hurting more. */ Page 9

10 The second class models the line at the emergency room. Patients with more life-threatening ailments go to the head of the line. Please complete the class. import java.util.*; public class ERqueue { private PriorityQueue<Patient> q; public ERqueue(){ q = new PriorityQueue<Patient>(); public void schedule( Patient p ){ // add the patient to the priority queue public String treatnext(){ // remove the next patient from the priority queue // return a string like has been healed and replace with the patient s name public String getplaceinline( Patient pat ){ // returns a string like "(name) is #1 out of 3 patients" // assume that each patient has a different name // the state of the queue is unchanged Here s some sample test code. ERqueue er = new ERqueue(); Patient p1 = new Patient( "Sarah", 5 ); Patient p2 = new Patient( "Johnny", 10 ); Patient p3 = new Patient( "Mike", 3 ); Patient p4 = new Patient( "Alex", 8 ); Patient p5 = new Patient( "Shelley", 1 ); Patient p6 = new Patient( "Pat", 2 ); er.schedule( p1 ); er.schedule( p2 ); er.schedule( p3 ); er.schedule( p4 ); er.schedule( p5 ); er.schedule( p6 ); System.out.println( er.getplaceinline( p1 ) ); System.out.println( er.getplaceinline( p3 ) ); System.out.println( " " ); System.out.println( er.treatnext() ); System.out.println( er.treatnext() ); System.out.println( " " ); System.out.println( er.getplaceinline( p3 ) ); // Sarah is #4 out of 6 patients. // Mike is #3 out of 6 patients. // Shelley has been healed // Pat has been healed // Mike is #1 out of 4 patients. Page 10