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
MrMuchimi
3 years ago
6

7.5 code practice please I can't get a 100 on it helpppp :/

Computers and Technology
2 answers:
Shtirlitz [24]3 years ago
6 0

Answer:

100-7.5=92.5

Explanation:

jeka57 [31]3 years ago
3 0
I’m not sure of what you mean please elaborate
You might be interested in
Which of the following scenarios might indicate that you have been a victim of identity theft?A)Your credit report displays acco
victus00 [196]

Answer:

Option A is the correct answer for the above question.

Explanation:

A Victim is a person, who faces the problem of a criminal person. Here in the question, the scenario is that a user is a victim of the identity of being theft by some other person. So the user can get known by the help of option a, which suggests that the user's credit card report display something which is not done by him then it can be the scenario, where the user can understand that he is a victim. hence option a is the correct answer where the other option is not because--

  • Option B suggests the user does not pay the bill on time but it is a general case because the bill is paid by the user is in every month not a single time.
  • Option C suggests both options (A and B) are correct, but option b is not the correct.
  • Option D suggests that no option is valid from the above but option A is the correct.
7 0
3 years ago
The birthday paradox says that the probability that two people in a room will have the same birthday is more than half, provided
poizon [28]

Answer:

The Java code is given below with appropriate comments for explanation

Explanation:

// java code to contradict birth day paradox

import java.util.Random;

public class BirthDayParadox

{

public static void main(String[] args)

{

   Random randNum = new Random();

   int people = 5;

   int[] birth_Day = new int[365+1];

   // setting up birthsdays

   for (int i = 0; i < birth_Day.length; i++)

       birth_Day[i] = i + 1;

 

   int iteration;

   // varying number n

   while (people <= 100)

   {

       System.out.println("Number of people: " + people);

       // creating new birth day array

       int[] newbirth_Day = new int[people];

       int count = 0;

       iteration = 100000;

       while(iteration != 0)

       {

           count = 0;

           for (int i = 0; i < newbirth_Day.length; i++)

           {

               // generating random birth day

               int day = randNum.nextInt(365);

               newbirth_Day[i] = birth_Day[day];

           }

           // check for same birthdays

           for (int i = 0; i < newbirth_Day.length; i++)

           {

               int bday = newbirth_Day[i];

               for (int j = i+1; j < newbirth_Day.length; j++)

               {

                   if (bday == newbirth_Day[j])

                   {

                       count++;

                       break;

                   }

               }

           }

           iteration = iteration - 1;

       }

       System.out.println("Probability: " + count + "/" + 100000);

       System.out.println();

       people += 5;

   }

}

}

4 0
3 years ago
Which category best represents: a student sends harassing emails to another student. The receiving student retaliates with a "fl
Dima020 [189]
It is considered C. cyber bullying
3 0
3 years ago
Read 2 more answers
A degree-constrained minimum spanning tree is a minimum spanning tree (MST) where the maximum vertex degree is limited to a cert
Bingel [31]

Answer:

A spanning tree is a subset of Graph G, which has all the vertices covered with minimum possible number of edges. Hence, a spanning tree does not have cycles and it cannot be disconnected..

By this definition, we can draw a conclusion that every connected and undirected Graph G has at least one spanning tree. A disconnected graph does not have any spanning tree, as it cannot be spanned to all its vertices.

Spanning Trees

We found three spanning trees off one complete graph. A complete undirected graph can have maximum nn-2 number of spanning trees, where n is the number of nodes. In the above addressed example, n is 3, hence 33−2 = 3 spanning trees are possible.

General Properties of Spanning Tree

We now understand that one graph can have more than one spanning tree. Following are a few properties of the spanning tree connected to graph G −

A connected graph G can have more than one spanning tree.

All possible spanning trees of graph G, have the same number of edges and vertices.

The spanning tree does not have any cycle (loops).

Removing one edge from the spanning tree will make the graph disconnected, i.e. the spanning tree is minimally connected.

Adding one edge to the spanning tree will create a circuit or loop, i.e. the spanning tree is maximally acyclic.

Explanation:

8 0
3 years ago
What engine component is shown in the above Figure?
astra-53 [7]

send attached file with it


5 0
3 years ago
Read 2 more answers
Other questions:
  • Semiconductor memory is used mainly for primary storage even with its high cost. In another hand, the magnetic tape is the cheap
    6·1 answer
  • A. True
    8·2 answers
  • Plz go sub 2 "Shyy096" he is a 11 y/o boy and makes music fortnite vids, it would rly help him if u subscribe cuz he only has 8.
    10·1 answer
  • Use the arr field and mystery () method below.
    9·1 answer
  • On a rheostat the first terminal is connected to a
    14·1 answer
  • Write a C program that right shifts an integer variable 4 bits. The program should print the integer in bits before and after th
    15·1 answer
  • Visual media that gives the appearance of a movement can be a collection of graphics<br>​
    10·2 answers
  • which program monitors the computer by looking for known trouble makers as well as suspicious behavior​
    11·1 answer
  • Write a program to output the following quote by Edsger W. Dijkstra:
    6·2 answers
  • I WILL GIVE BRAINLIST THING TO WHOEVER GIVES ME THE CORRECT ANSWER
    11·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!