1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
Alika [10]
2 years ago
8

The…..executed simple

Computers and Technology
2 answers:
Lina20 [59]2 years ago
7 0

Answer:

ok ok

Explanation:

Orlov [11]2 years ago
6 0
What is your question?
You might be interested in
Place Letter or word in correct section where it says labels bellow
love history [14]
A beauty its not b c or d
3 0
3 years ago
Read 2 more answers
What is the Best decent priced Laptop/PC
luda_lava [24]

I'm on a brand new Lenovo and it was only like $500. Its great, especially if you are looking for a gaming Laptop. Otherwise, HP and Lenovo's older stuff is fairly decent in price

6 0
3 years ago
Which feature of a router provides traffic flow and enhances network security?
Vika [28.1K]
The answer would be...<span>ACLs</span>
6 0
3 years ago
Suppose that you are asked to modify the Stack class to add a new operation max() that returns the current maximum of the stack
Advocard [28]

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.
7 0
3 years ago
For all of you who listen to podcasts, when do you usually find time to do so?​
ss7ja [257]
Morning and afternoon commute times are obvious blocks of time that you can assume are used for listening to podcasts, but the answer will obviously vary widely based on individual habits and schedules.

Hope this helps
7 0
3 years ago
Other questions:
  • What possible effects could cyber attack have on Johannesburg stock exchange
    6·1 answer
  • Can using interior light help improve a drivers visibility at night
    9·1 answer
  • How to write an shortened if statement?
    6·1 answer
  • How would this requirement be implemented?
    12·1 answer
  • Splunk uses ________ to categorize the type of data being indexed..
    11·2 answers
  • Use BlueJ to write a program that reads a sequence of data for several car objects from an input file. It stores the data in an
    5·1 answer
  • Lester has to create an app that can support offline data and rich media content such as audio and video. In which programming l
    15·1 answer
  • Write a test program that prompts the user to enter three sides of the triangle (make sure they define an actual triangle), a co
    5·1 answer
  • Hide Time Remaining A
    11·1 answer
  • My sister told me an extremely funny joke. what is the direct object for this sentence ?
    6·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!