This problem has been solved!
see the answer
suppose a java method receives a list and reverses the order of the items it contains by removing each item from the front of

the list, adding each item to a stack, and then removing the items from the stack and inserting each item to the end of the list.

what is the expected big-o running time if:

a. if an arraylist is passed. explain your answer.
b. if a linkedlist is passed. explain your answer.

List a few alternative options and input and output over the standerd keyboard and monitor. explain their functioning in details.

Which of the following statements is false? a. a class can directly inherit from class object. b. if the class you're inheriting from declares instance variables as private, the inherited class can access those instance variables directly. c. a class's instance variables are normally declared private to enforce good software engineering. d. it's often much more efficient to create a class by inheriting from a similar class than to create the class by writing every line of code the new class requires.

Consider the usual algorithm to convert an infix expression to a postfix expression. suppose that you have read 10 input characters during a conversion and that the stack now contains these symbols: (5 points) | | | + | | ( | bottom |_*_| now, suppose that you read and process the 11th symbol of the input. draw the stack for the case where the 11th symbol is