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
allochka39001 [22]
3 years ago
7

What are the functions of super computer? ​

Computers and Technology
2 answers:
iogann1982 [59]3 years ago
3 0

Answer:

Supercomputers play an important role in the field of computational science, and are used for a wide range of computationally intensive tasks in various fields, including quantum mechanics, weather forecasting, climate research, oil and gas exploration, molecular modeling .

Explanation:

Hope it helps you

Zanzabum3 years ago
3 0

Answer:

<em>Supercomputers play an important role in the field of computational science, and are used for a wide range of computationally intensive tasks in various fields, including quantum mechanics, weather forecasting, climate research, oil and gas exploration, molecular modelling, etc.</em>

<em />

<em />

You might be interested in
Match the description to the step in troubleshooting.
Digiron [165]
It should go 4 5 3 2 1
5 0
3 years ago
Let's implement a classic algorithm: binary search on an array. Implement a class named BinarySearcher that provides one static
yKpoI14uk [10]

Answer:

Hope this helped you, and if it did , do consider giving brainliest.

Explanation:

import java.util.ArrayList;

import java.util.List;

//classs named BinarySearcher

public class BinarySearcher {

 

//   main method

  public static void main(String[] args) {

     

//   create a list of Comparable type

     

      List<Comparable> list = new ArrayList<>();

     

//       add elements

     

      list.add(1);

      list.add(2);

      list.add(3);

      list.add(4);

      list.add(5);

      list.add(6);

      list.add(7);

     

//       print list

     

      System.out.println("\nList : "+list);

     

//       test search method

     

      Comparable a = 7;

      System.out.println("\nSearch for 7 : "+search(list,a));

     

      Comparable b = 3;

      System.out.println("\nSearch for 3 : "+search(list,b));

     

      Comparable c = 9;

      System.out.println("\nSearch for 9 : "+search(list,c));

     

      Comparable d = 1;

      System.out.println("\nSearch for 1 : "+search(list,d));

     

      Comparable e = 12;

      System.out.println("\nSearch for 12 : "+search(list,e));

     

      Comparable f = 0;

      System.out.println("\nSearch for 0 : "+search(list,f));

     

  }

 

 

 

//   static method named search takes arguments Comparable list and Comparable parameter

  public static boolean search(List<Comparable> list, Comparable par) {

     

//       if list is empty or parameter is null the throw IllegalArgumentException

     

      if(list.isEmpty() || par == null ) {

         

          throw new IllegalArgumentException();

         

      }

     

//       binary search

     

//       declare variables

     

      int start=0;

     

      int end =list.size()-1;

     

//       using while loop

     

      while(start<=end) {

         

//           mid element

         

          int mid =(start+end)/2;

         

//           if par equal to mid element then return

         

          if(list.get(mid).equals(par) )

          {

              return true ;

             

          }  

         

//           if mid is less than parameter

         

          else if (list.get(mid).compareTo(par) < 0 ) {

                 

              start=mid+1;

          }

         

//           if mid is greater than parameter

         

          else {

              end=mid-1;

          }

      }

     

//       if not found then retuen false

     

      return false;

     

  }

 

 

}import java.util.ArrayList;

import java.util.List;

//classs named BinarySearcher

public class BinarySearcher {

 

//   main method

  public static void main(String[] args) {

     

//   create a list of Comparable type

     

      List<Comparable> list = new ArrayList<>();

     

//       add elements

     

      list.add(1);

      list.add(2);

      list.add(3);

      list.add(4);

      list.add(5);

      list.add(6);

      list.add(7);

     

//       print list

     

      System.out.println("\nList : "+list);

     

//       test search method

     

      Comparable a = 7;

      System.out.println("\nSearch for 7 : "+search(list,a));

     

      Comparable b = 3;

      System.out.println("\nSearch for 3 : "+search(list,b));

     

      Comparable c = 9;

      System.out.println("\nSearch for 9 : "+search(list,c));

     

      Comparable d = 1;

      System.out.println("\nSearch for 1 : "+search(list,d));

     

      Comparable e = 12;

      System.out.println("\nSearch for 12 : "+search(list,e));

     

      Comparable f = 0;

      System.out.println("\nSearch for 0 : "+search(list,f));

     

  }

 

 

 

//   static method named search takes arguments Comparable list and Comparable parameter

  public static boolean search(List<Comparable> list, Comparable par) {

     

//       if list is empty or parameter is null the throw IllegalArgumentException

     

      if(list.isEmpty() || par == null ) {

         

          throw new IllegalArgumentException();

         

      }

     

//       binary search

     

//       declare variables

     

      int start=0;

     

      int end =list.size()-1;

     

//       using while loop

     

      while(start<=end) {

         

//           mid element

         

          int mid =(start+end)/2;

         

//           if par equal to mid element then return

         

          if(list.get(mid).equals(par) )

          {

              return true ;

             

          }  

         

//           if mid is less than parameter

         

          else if (list.get(mid).compareTo(par) < 0 ) {

                 

              start=mid+1;

          }

         

//           if mid is greater than parameter

         

          else {

              end=mid-1;

          }

      }

     

//       if not found then retuen false

     

      return false;

     

  }

 

 

}

7 0
3 years ago
Find the number of ideal integers within the given segment [low,high] inclusive. An ideal number is a positive integer that has
Alex Ar [27]

Answer:

  1. low = 10
  2. high = 50
  3. count = 0
  4. for i in range(low, high + 1):
  5.    if(i % 3 == 0 and i % 5 == 0):
  6.        count += 1
  7. print(count)

Explanation:

The solution code is written in Python.

We can create low and high variables to store the lower bound and upper bound in the range (Line 1-2)

Next create a counter variable, count (Line 3).

Use a for loop to traverse through the number between lower bound and upper bound and check if the current number-i is divisible by 3 and by 5, increment the count by one.

After the loop, print the count and we can get the number of ideal integers within the range (Line 8).

6 0
3 years ago
Why is it important to stand clear and not touch the person while the AED is analyzing or defibrillating?
galben [10]

Answer:

Because you could also receive shock

Explanation:

Automatic external defibrillators can help save lives during sudden cardiac arrest.

Do not touch the person while the AED is analyzing; touching or moving the person can affect the analysis. You or another person could be injured by shock. And you could prevent the AED from analyzing your heart rate correctly.

5 0
3 years ago
4. How many times will the print statement be executed within the following nested for loops? Briefly explain how or show the ma
HACTEHA [7]

Print statements are used to display outputs

The number of times the nested loop will be executed is 43200

<h3>What are nested for loops?</h3>

Nested for loops are loops that are placed within another loop or loops

From the statement, we have the following loop conditions:

h = 1; h <= 12, m = 0; m <= 59 and s = 0; s <= 59

The above means that:

  • h = 12 --- the outer loop will be executed 12 times
  • m = 60 --- the middle loop will be executed 60 times
  • s = 60 --- the inner loop will be executed 60 times

So, the number of times the nested loop will be executed is:

Count = 12*60 *60

Count = 43200

Hence, the number of times the nested loop will be executed is 43200

Read more about loops at:

brainly.com/question/14284157

8 0
2 years ago
Other questions:
  • Decisions 1 and 3 are both ____________ decisions because ____________________.
    9·1 answer
  • Write a program that will predict the size of a population of organisms. The program // should ask the user for the starting num
    6·1 answer
  • Write any 2 differences between implicit variables and explicit variables.​Plz tell :' (
    10·1 answer
  • Which of the following is true concerning science?
    8·1 answer
  • When a security administrator wants to conduct regular test on the strength of user passwords, what may be the best setup for th
    15·1 answer
  • Window frame will expand to fill the entire desktop when you
    12·1 answer
  • Name all the keys of the home row.
    13·1 answer
  • Hey plz help me with this<br>What is malware short for?​
    13·1 answer
  • Write a method that takes two circles, and returns the sum of the areas of the circles.
    10·1 answer
  • Compare and contrast the advantages and disadvantages of a LAN to a WLAN.
    8·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!