CSE 100 Lecture Notes - Lecture 41: Selection Sort

17. What does the following piece of code print? public class Test public static void main(String[] args) int[] a = {2,4,6,8); for(int i = 0; i < a.length; i++) int() b = foo (a); System.out.print( b[i] + " "); public static int[] foo (int[] array) for (int i = 0; i < array.length; i++) array[i]++; return array; (A) 3 579 (B) It would give compile-time error. (C) 3 6 9 12 (D) It would give run-time error. (E) 2468

COMP 2021Winter 2010 - Final Examination Pape 11 110 6 . The two classes low compile without me. What is displayed when the main() method of class Nightmareix is executed? Clearly indicate the program output in the appropriate space ca pe You may use the other lank space as a scratch pad to track the state of memesy as the program escoles, but the contents of this other space will not he graded The definition of the Pair claw public cla Pair private int left: private int right publie Pairintit T left- right - public void nix (Pair pl loft - P.left public string toitring) return "IL... lort R right "1" The definition of the NightmareMix class public class Nightmareix public static void mix Inta (int il, int 12) public static void mixArraywithint fint 11 a, int i, int v) 11 - V public static void mixArrayaor Int(int il al, intl a2) public static void mixMatrixWithint fint 11111121 - m int 11, int 12, int v public static void mixMatrix WithArray (int 11 11- , int i, intila) public static void mixlar Addresses Pair pl, Pair 2) pl - p2 public static void mixArrayWithPairState (Pair) a, int i, Pair pl public static void mixArrayWithPairAddress (Pairla, int i, Pair p) ali - P; public static void mixArrayaoraira (Pairil al, Pairil a2) public static void main(Stringil arga) int myV1 - 1; int myV2 - 2; int my = (3, 4) int my2 = 5, 6) into myM1 , 8 9, 10}} Pair myP1 = new Pair (11, 12) Pair myP2 = new Pair (13, 14) Pair myPA (neu Pair (15, 16), new pair(17, 18) Pair myPA2 = (neu Pair (19, 20), new pair (21, 22) mixInita (myvi, myV2); mixArrayWith Int (myal, 0, myv2); mixArraysOfIntinyal, myA2); MixMatrixWithint (myM, 0, 0, myV2); mixArrayaofTnt (HyMIO, myM[1); mixMatrixWithArray (wy, , WyA2); mixArraywithint nyA2, 0, myV2); mixPair Addresses (wypi, myP2); RixPairAddren (HyPALIO), WPAI[1]); mixArraywithPairstate (myPA2, 0, 1); mixArraywithPairAddresa (myPA2, 1, WP2); mixArray Paira (wyPal, myPAZ) System.out.println("1.. myvi) System.out.println("2: ( +WA110 A11] + " ") System.out.println("3: ( + myA2[0] + + m 2 (1) + " ); System.out.println("4: ( myM[0][0] + "," myM[0][1] + " myM[1][0] + " " + myM[1][1] + "} ") System.out.println('5: ( + myPA10) + myPA [1] + " "); System.out.println("6: ( myPA2[0 PA21] + " ); 1"

1. Complete the following problem using concepts of STACK.
2. If you are using JAVA, you must include the main method as well which should test your other methods and print the outputs according to the tasks.
3. If you are using PYTHON, make sure your code has the methods invoked and proper printing statements according to the tasks.
4. Your program will take an arithmetic expression as a string input. For Example:

    

   • “1+2*(3/4)”

    

   • “1+2*[3*3+{4–5(6(7/8/9)+10)–11+(12*8)]+14”

    

   • “1+2*[3*3+{4–5(6(7/8/9)+10)}–11+(12*8)/{13+13}]+14”

    

   Program

    

   Your program will determine whether the open brackets (the square brackets, curly braces, and the parentheses) are closed in the correct order.

    

   Outputs:

    

   Output 1

    

   1+2*(3/4)

   This expression is correct.

    

   Output 2

    

   1+2*[3*3+{4–5(6(7/8/9)+10)–11+(12*8)]+14

   This expression is NOT correct.

   Error at character # 10. ‘{‘- not closed.

    

   Output 3

    

   1+2*[3*3+{4–5(6(7/8/9)+10)}–11+(12*8)/{13+13}]+14

   This expression is correct.

   
   

   Output 4

    

   1+2]*[3*3+{4–5(6(7/8/9)+10)–11+(12*8)]+14

   This expression is NOT correct.

   Error at character # 4. ‘]‘- not opened.

   Task 1

   Solve the above problem using an array-based stack.

    

   Task 2

   Solve the above problem using a linked list-based stack.