Part I: Stack and Queue Given the Calculator.java from the tenth Class Activity, update this program so that it accepts
Posted: Thu Jul 14, 2022 2:17 pm
Part I: Stack and Queue
Given the Calculator.java from the tenth ClassActivity, update this program so that it accepts brackets [] andcurly braces {} as well as parentheses.
Part II: Hash Set
Using java.util.HashSet, write a Java method with the followingsignature that gets the names of two files and writes the set ofall words that are in the first file, but not in the second file ina file called "out.txt". Please assume that two words are separatedby white-space, tab, or new line characters. Also, when comparingthe content of two files, ignore the case-sensitivity of words.Finally, assume that there are no punctuations used in any of theinput files.
public static void diff(String filename1, String filename2){
//your code...
}
Part III: Recursion
Given the classes Node and SinglyLinkedList inthis util.zip package, do the following changes:
Given the Calculator.java from the tenth ClassActivity, update this program so that it accepts brackets [] andcurly braces {} as well as parentheses.
Part II: Hash Set
Using java.util.HashSet, write a Java method with the followingsignature that gets the names of two files and writes the set ofall words that are in the first file, but not in the second file ina file called "out.txt". Please assume that two words are separatedby white-space, tab, or new line characters. Also, when comparingthe content of two files, ignore the case-sensitivity of words.Finally, assume that there are no punctuations used in any of theinput files.
public static void diff(String filename1, String filename2){
//your code...
}
Part III: Recursion
Given the classes Node and SinglyLinkedList inthis util.zip package, do the following changes: