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
kicyunya [14]
3 years ago
13

Saujani describes that women are highly underrepresented in STEM careersShe attributes this to women needing more confidence. Wh

at study does she describe to back up this idea of women needing more confidence ?
Computers and Technology
1 answer:
Sedbober [7]3 years ago
5 0

Answer:

have a nice day! ❤❤

Explanation:

You might be interested in
There are n poor college students who are renting two houses. For every pair of students pi and pj , the function d(pi , pj ) ou
Nuetrik [128]

Answer:

Here the given problem is modeled as a Graph problem.

Explanation:

Input:-  n, k and the function d(pi,pj) which outputs an integer between 1 and n2

Algorithm:-We model each student as a node. So, there would be n nodes. We make a foothold between two nodes u and v (where u and v denote the scholars pu and pv respectively) iff d(pu,pv) > k. Now, Let's call the graph G(V, E) where V is that the vertex set of the graph ( total vertices = n which is that the number of students), and E is that the edge set of the graph ( where two nodes have edges between them if and only the drama between them is bigger than k).

We now need to partition the nodes of the graph into two sets S1 and S2 such each node belongs to precisely one set and there's no edge between the nodes within the same set (if there's a foothold between any two nodes within the same set then meaning that the drama between them exceeds k which isn't allowed). S1 and S2 correspond to the partition of scholars into two buses.

The above formulation is akin to finding out if the graph G(V,E) is a bipartite graph. If the Graph G(V, E) is bipartite then we have a partition of the students into sets such that the total drama <= k else such a partition doesn't exist.

Now, finding whether a graph is bipartite or not is often found using BFS (Breadth First algorithm) in O(V+E) time. Since V = n and E = O(n2) , the worst-case time complexity of the BFS algorithm is O(n2). The pseudo-code is given as

PseudoCode:

// Input = n,k and a function d(pi,pj)

// Edges of a graph are represented as an adjacency list

1. Make V as a vertex set of n nodes.

2. for each vertex  u ∈ V

\rightarrow  for each vertex v ∈ V

\rightarrow\rightarrowif( d(pu, pj) > k )

\rightarrow\rightarrow\rightarrow add vertex u to Adj[v]   // Adj[v] represents adjacency list of v

\rightarrow\rightarrow\rightarrow add vertex v to Adj[u] // Adj[u] represents adjacency list of u

3.  bool visited[n] // visited[i] = true if the vertex i has been visited during BFS else false

4. for each vertex u ∈ V

\rightarrowvisited[u] = false

5. color[n] // color[i] is binary number used for 2-coloring the graph  

6. for each vertex u ∈ V  

\rightarrow if ( visited[u] == false)

\rightarrow\rightarrow color[u] = 0;

\rightarrow\rightarrow isbipartite = BFS(G,u,color,visited)  // if the vertices reachable from u form a bipartite graph, it returns true

\rightarrow\rightarrow if (isbipartite == false)

\rightarrow\rightarrow\rightarrow print " No solution exists "

\rightarrow\rightarrow\rightarrow exit(0)

7.  for each vertex u ∈V

\rightarrow if (color[u] == 0 )

\rightarrow\rightarrow print " Student u is assigned Bus 1"

\rightarrowelse

\rightarrow\rightarrow print " Student v is assigned Bus 2"

BFS(G,s,color,visited)  

1. color[s] = 0

2. visited[s] = true

3. Q = Ф // Q is a priority Queue

4. Q.push(s)

5. while Q != Ф {

\rightarrow u = Q.pop()

\rightarrow for each vertex v ∈ Adj[u]

\rightarrow\rightarrow if (visited[v] == false)

\rightarrow\rightarrow\rightarrow color[v] = (color[u] + 1) % 2

\rightarrow\rightarrow\rightarrow visited[v] = true

\rightarrow\rightarrow\rightarrow Q.push(v)

\rightarrow\rightarrow else

\rightarrow\rightarrow\rightarrow if (color[u] == color[v])

\rightarrow\rightarrow\rightarrow\rightarrow return false // vertex u and v had been assigned the same color so the graph is not bipartite

}

6. return true

3 0
3 years ago
True or false? because you have made it a practice to never access the
Flauer [41]

Answer: False

Explanation: Even if the internet service is not connected with the operating system while accessing the database, it is still on risk and can be vulnerable to get attacked. Devices of the system like USB drive can happen to have the malware which creates the risk towards database.

The computer system can get invoked with the virus or other attack while the user connects the internet afterwards when he/she is not accessing the database, these malware get stored in system once they get invoked and corrupt the system and its database even when the internet connection is not present .Thus, the statement given is false.

6 0
3 years ago
What type of gloves protects your hands from hazardous chemicals?
zepelin [54]
Gloves from the People that have gas masks
3 0
3 years ago
Read 2 more answers
D. The 7-bit ASCII code for the character '&amp;' is:
insens350 [35]

Answer:

00100110

a and d are invalid sequences because they contain an even number of 1's.

Explanation:

Odd parity means that you want an odd number of 1's in the resulting set of bits. Since there are 3 (=odd) bits in the set, a zero must be added to keep the total odd.

6 0
3 years ago
Bill graduated with an electrical engineering technology degree. George graduated with a mechanical engineering degree. Which of
nlexa [21]
{C} 
because the electrical engineering degree takes forever to get and if i'm not mistaken, mechanical engineering degree is pretty easy to get its like 2 years of college or something like that.
Hope i helped 0-0 ;p
plz make blainly

4 0
3 years ago
Other questions:
  • Having reviewed dod wireless stig (ver6, release 1), sarah learns she may only utilize secnet 54 and ______________ for transmit
    13·1 answer
  • While designing web pages for mobiles, the page content should be extensive such that the readers get the opportunity to explore
    5·2 answers
  • Which of the following is the best definition of a workplace policy?
    13·2 answers
  • DLucy is planning to launch her podcast on career guidance for college students and has already recorded a few videos for market
    10·1 answer
  • In a block-style business letter, the paragraphs are double-spaced and indented. <br> True or False
    15·2 answers
  • For an external usb hard drive attached to a computer, which is more suitable: a writethrough cache or a block cache
    14·2 answers
  • 2. Which one of the following is not a feature of technology?
    10·1 answer
  • Consider the program below: public class Test { public static void main( String[] args ) { int[] a; a = new int[ 10 ]; for ( int
    5·1 answer
  • Can someone please do this java lab for me (100 point version)? Heres the link: https://www.dropbox.com/sh/a639urhsggss051/AADdn
    12·1 answer
  • Help me asap ill give brainliest
    8·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!