All categories

3 years ago

Can someone please edit this one paragraph that got a grade of 1 get a grade of 2????

SAT

1 answer:

mr Goodwill [35]3 years ago

7 0

Answer:

the process was a little different than it was just the amount you could do not to accomplish the same answer that was in a different

Explanations:

the speaker of speaker and the speaker speaker is the speaker in the process and the senate speaker and senate to the speaker in the speaker of the

You might be interested in

gtnhenbr [62]

Answer:

^^^^^^^^^^^^^^^^^^^

Explanation:

7 0

3 years ago

Students who are awarded_____ for college do not have to pay the money back

just olya [345]

Answer:grants

Explanation:because why would you pay off a grant

4 0

3 years ago

a researcher is studying a group of field mice. the distribution of the weight of field mice is approximately normal with mean 2

yarga [219]

The proportion of field mice weighing more than 33 grams in the distribution will be about 0.2275

Mean, μ = 25 grams
Standard deviation, σ = 4 grams
Score, X = 33 grams

We need to calculate the P(Z > Zscore)

Recall :

Zscore = (X - μ) ÷ σ

For X > 33 :

Zscore = (33 - 25) ÷ 4 = 2

Therefore, the probability would be expressed as :

P(Z > 2) = 1 - P(Z < 2)

From the normal distribution table :

P(Z < 2) = 0.97725

Therefore,

P(Z > 2) = 1 - 0.97725 = 0.02275

Learn more :brainly.com/question/8165716

4 0

2 years ago

Which is NOT done by a realtor? A. Help buyers find a home they like B. Collect a commission of about 3% of the purchase price C

mariarad [96]

Answer:

B collect a commission...

Explanation:

5 0

2 years ago

Read 2 more answers

Once you have your heap structure created, next you must use it as a backing structure to a priority queue. Develop a PriorityQu

saveliy_v [14]

Using the knowledge in computational language in python it is possible to write a code that Develop a PriorityQueue data structure in a file.

<h3>Writting the code in python:</h3>

import sys

class Node:

def __init__(self,key):

self.left = None

self.right = None

self.val = key

self.parent = None

class MinHeap:

def __init__(self, maxsize):

self.maxsize = maxsize

self.size = 0

self.Heap = Node(-1 * sys.maxsize )

self.FRONT = self.Heap

# A utility function to do inorder tree traversal

def isLeaf(self, node):

if node.left == None and node.right == Node:

return True

return False

# Function to swap two nodes of the heap

def swap(self, node1, node2):

node1.data, node2.data = node2.data, node1.data

# Function to heapify the node at pos

def minHeapify(self, node):

# If the node is a non-leaf node and greater

# than any of its child

if not self.isLeaf(node):

if (node.data > node.left.data or

node.data > node.right.data):

# Swap with the left child and heapify

# the left child

if node.left.data < node.right.data:

self.swap(node, node.left)

self.minHeapify(node.left)

# Swap with the right child and heapify

# the right child

else:

self.swap(node, node.right)

self.minHeapify(node.right)

# Function to insert a node into the heap

def insert(self, element):

if self.size >= self.maxsize :

return

self.size+= 1

self.bst_insert(FRONT, element)

current = FRONT

while current.parent != None and current.data < current.parent.data:

self.swap(current, current.parent)

current = current.parent

# Function to print the contents of the heap

def Print(self):

self.inorder()

# Function to build the min heap using

# the minHeapify function

def inorder(self, root):

if root:

inorder(root.left)

print(root.val)

inorder(root.right)

def bst_insert(self, root, node):

if root is None:

root = node

else:

root.next = node

self.FRONT = node

# Driver Code

if __name__ == "__main__":

r = Node(50)

bst_insert(r,Node(30))

bst_insert(r,Node(20))

bst_insert(r,Node(40))

bst_insert(r,Node(70))

bst_insert(r,Node(60))

bst_insert(r,Node(80))

# Print inoder traversal of the BST

inorder(r)

print('The minHeap is ')

minHeap = MinHeap(15)

minHeap.insert(5)

minHeap.insert(3)

minHeap.insert(17)

minHeap.insert(10)

minHeap.insert(84)

minHeap.insert(19)

minHeap.insert(6)

minHeap.insert(22)

minHeap.insert(9)

minHeap.minHeap()

minHeap.Print()

print("The Min val is " + str(minHeap.remove()))

See more about python at brainly.com/question/13437928

#SPJ1

6 0

1 year ago