Answer:Here's why it works: Club crackers are engineered to be the perfect amount of buttery and salty, which means that, sometimes, they're all you can taste if paired with the wrong cheese.
Explanation:
Suppose that you are asked to modify the Stack class to add a new operation max() that returns the current maximum of the stack comparable objects. Assume that pop and push operations are currently implemented using array a as follows, where item is a String and n is the size of the stack. Note: if x andy are objects of the same type, use x.compareTo(y) to compare the objects x and y public void push String item ) { [n++] = iten; } public String pop { return al--n]; } Implement the max operation in two ways, by writing a new method using array a (in 8.1), or updating push and pop methods to track max as the stack is changed (in 8.2). Q8.1 Implement method maxi 5 Points Write a method max() using Out) space and Oin) running time. public String max() {...} Enter your answer here Q8.2 Update push() and popo 5 Points Write a method max() using On) space and 011) run time. You may update the push and pop methods as needed public void push {...} public String pop() {...} public String max() {...}
Answer:
Following are the code to the given points:
Explanation:
For point 8.1:
public String max()//defining a method max
{
String maxVal=null;//defining a string variable that holds a value
for(int x=0;x<n;x++)
{
if(maxVal==null || a[i].compareTo(maxVal)>0)//defining if blok to comare the value
{
maxVal=a[i];//holding value in maxVal variable
}
}
return maxVal;//return maxVal variable value
}
For point 8.2:
public void push(String item)//defining a method push that accepts item value in a parameter
{
a[n]=item;//defining an array to hold item value
if(n==0 || item.compareTo(maxVals[n-1])>0)//use if to comare item value
{
maxVals[n]=item;//holding item value in maxVals variable
}
else
{
maxVals[n]=maxVals[n-1];//decreasing the maxVals value
}
n++;//incrementing n value
}
public String pop()//defining a method pop
{
return a[--n];//use return value
}
public String max()//defining a method max
{
return maxVals[n-1];//return max value
}
In the first point, the max method is declared that compares the string and returns its max value.In the second point, the push, pop, and max method are declared that works with their respective names like insert, remove and find max and after that, they return its value.In the following cell, we've loaded the text of Pride and Prejudice by Jane Austen, split it into individual words, and stored these words in an array p_and_p_words. Using a for loop, assign longer_than_five to the number of words in the novel that are more than 5 letters long. Hint: You can find the number of letters in a word with the len function.
Answer:
Explanation:
Since the array is not provided, I created a Python function that takes in the array and loops through it counting all of the words that are longer than 5. Then it returns the variable longer_than_five. To test this function I created an array of words based on the synapse of Pride and Prejudice. The output can be seen in the attached picture below.
def countWords(p_and_p_words):
longer_than_five = 0
for word in p_and_p_words:
if len(word) > 5:
longer_than_five += 1
return longer_than_five
¿sharpness or unbreaking people?
Really hard decision, but ultimately, it depends on your personal prefrence. I would choose un breakin, however, for some people if you want to kill mobs quicker, than sharpness would be the way to go.
what are the events?
Answer:
a thing that happens or takes place, especially one of importance.