Question

Question 16 (6 points) Given an empty Queue q and empty Stacks. Show what Q and will look like after the following instructions are executed." for(int i = 0; i < 6; i++){ qenqueuei-2): s push(i-4). while(! q.isEmpty) iffe peek() %2 == 0){ s pop(); 5 push(q.dequeue): else { s.popO: 9.dequete: } www qenqueue speeko): Format BIU $ Question 17 (6 points) The following code defines an exception myException. It is used in testl (String str) and the testl (String str) method is called in test2(). There are three errors in the following code, correct it public class myException extends Exception public myException super"Don't he silly.") public void test(String str) throw myException if str.compare To "nervous")0) throw mylixception System.out.println("Today is a good day for a good day"); 1 public void test20 try! lea!"hello: catch System.out.println("This is the end.");

JAVA

Answer 1

Q16. Since Queue maintains FIFO order i.e., elements which entered first will be removed first. While Stack follows LIFO order i.e., elements which enter last will come out first .

So the elements present in q: 7

Elements present in s: (Top ---- > Bottom) 7,5,4

Q.17 NOTE: Error are marked in Bold.

Error 1 : public void test1(String str) throws myException{

Error 2:  if(str.compareTo("nervous")==0)
throw new myException();

Error 3:  public void test2(){

try{

test1("hello");

}

catch (myException e){

  System.out.println("This is the end");

}

}