Write an exercise driver program that uses the methods in our ordered symbol-table API on difficult or pathological cases that might turn up in practical applications. Simple examples include key sequences that are already in order, key sequences in reverse order, key sequences where all keys are the same, and keys consisting of only two distinct values

VariableReferenceNode.java, OperationNode.java, ConstantNode.java, and PatternNode.java must have their own java classes with the correct methods implemented:  OperationNode: Has enum, left and Optional right members, good constructors and ToString is good  VariableReferenceNode: Has name and Optional index, good constructors and ToString is good  Constant & Node Pattern: Have name, good constructor and ToString is good    Make sure to include the screenshot of the output of Parser.java as well.

Specify and implement an iterator method called sortedElements for IntSet. The iterator method sortedElements returns an iterator that will produce each element of the intset in ascending order. The intset cannot be mutated when the iterator is in use.      Be sure to specify the iterator method before implementation. Do not forget to give the rep invariant and abstraction function for your implementation.   Note: IntSet.java has been provided.  You can directly add in the code the specification, the implementation of the iterator method sortedElements, and the inner iterator class.      There is a segment of simple testing code for sortedElements in main() close to the end in the provided IntSet.java.  The program will not compile until you have properly implemented sortedElements. find the provided code below: https://drive.google.com/open?id=1hANO8kVigGXwFLLJDJQLE5joM1BBeCCn

When each object in a collection has a priority, how should you organize several objects that have the same priority? One way is to order the objects with the same priority in chronological order. Thus, you can create a priority queue of queues. Design such an ADT.

Exercise 2.3. What is wrong with this procedure, which is supposed to return True if the element x occurs in the list items, and False otherwise? def member (x, items): for i in items: if x == 1: return True else: return False

In writing a general-purpose sort method in Java, the sort method needs to compareobjects. There are two ways to give the sort method the code to compare objects,implementing the interfaces Comparable and Comparator respectively. Extend Article class toimplement Comparable interface so that the default sorting of the Articles is by its volume

Given the linked list data structure, implement a sub-class TSortedList that makes sure that elements are inserted and maintained in an ascending order in the list. So, given the input sequence {1,7,3,11,5}, when printing the list after inserting the last element it should print like 1, 3, 5, 7, 11. Note that with inheritance, you have to only care about the insertion situation as deletion should still be handled by the parent class.

Complete and submit LinkedStack2.java with following: Inherit LinkedStack.java, implement StackInterface2.java Add String toString()method as specified in page 153, problem 28(a) Add int size()method as specified in page 153, problem 28(b) Add void popSome(int count)method as specified in page 153, problem 28(c) Add boolean swapStart()method as specified in page 153, problem 28(d) Add T poptop() method as specified in page 153, problem 28(e)

Write a java GUI program stacking Student objects of a class. Your program should have buttons for push, pop, and peek. Create a student class with these fields: name (type: String), age (type : int), major ( type: String), gpa (type: double) and gender (type:char). Use Java Stack class for implementation and use the GUI for user interaction. At run time books stored in stack should follow the last in First out (LIFO) of a stack.

In Java, give an example of a class that implements the Comparable interface, and explain how the implementation of the compareTo method determines its return value.