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
prohojiy [21]
4 years ago
14

A plant growing in a pot is more likely to be affected by a shortage of minerals than a plant growing in a garden. Give the reas

on for thin

SAT
1 answer:
Mumz [18]4 years ago
8 0

Because there is a limited amount of compost with a limited amount of minerals. In the garden there is loads of soil and loads of minerals. because of decomposition and absorption minerals can easily be replaced in the garden soil, unlike in a plant pot.

You might be interested in
I need help with this please
Lesechka [4]

Q1- Urgent / Important

Q2- Writing a paper that is due in 3 hours

(others can wait as no serious consequences but you could fail n get bad mark if you don't complete the paper. It's a deadline issue.)
3 0
3 years ago
WILL MARK BRAINLIST!
Westkost [7]
You are so flawless, you are made of the best qualities of all things.

The moment I laid eyes on you, my heart flew to yours, from my heart is to do with whatever you will.

You have to make me your wife, or I’ll pass away as your servant. I am your slave regardless of your choice.
7 0
3 years ago
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>

<em>import sys</em>

<em>class Node:</em>

<em>def __init__(self,key):</em>

<em>self.left = None</em>

<em>self.right = None</em>

<em>self.val = key</em>

<em>self.parent = None</em>

<em>class MinHeap:</em>

<em>def __init__(self, maxsize):</em>

<em>self.maxsize = maxsize</em>

<em>self.size = 0</em>

<em>self.Heap = Node(-1 * sys.maxsize )</em>

<em>self.FRONT = self.Heap</em>

<em># A utility function to do inorder tree traversal</em>

<em>def isLeaf(self, node):</em>

<em>if node.left == None and node.right == Node:</em>

<em>return True</em>

<em>return False</em>

<em># Function to swap two nodes of the heap</em>

<em>def swap(self, node1, node2):</em>

<em>node1.data, node2.data = node2.data, node1.data</em>

<em># Function to heapify the node at pos</em>

<em>def minHeapify(self, node):</em>

<em># If the node is a non-leaf node and greater</em>

<em># than any of its child</em>

<em>if not self.isLeaf(node):</em>

<em>if (node.data > node.left.data or</em>

<em>node.data > node.right.data):</em>

<em># Swap with the left child and heapify</em>

<em># the left child</em>

<em>if node.left.data < node.right.data:</em>

<em>self.swap(node, node.left)</em>

<em>self.minHeapify(node.left)</em>

<em># Swap with the right child and heapify</em>

<em># the right child</em>

<em>else:</em>

<em>self.swap(node, node.right)</em>

<em>self.minHeapify(node.right)</em>

<em># Function to insert a node into the heap</em>

<em>def insert(self, element):</em>

<em>if self.size >= self.maxsize :</em>

<em>return</em>

<em>self.size+= 1</em>

<em>self.bst_insert(FRONT, element)</em>

<em>current = FRONT</em>

<em>while current.parent != None and current.data < current.parent.data:</em>

<em>self.swap(current, current.parent)</em>

<em>current = current.parent</em>

<em># Function to print the contents of the heap</em>

<em>def Print(self):</em>

<em>self.inorder()</em>

<em># Function to build the min heap using</em>

<em># the minHeapify function</em>

<em>def inorder(self, root):</em>

<em>if root:</em>

<em>inorder(root.left)</em>

<em>print(root.val)</em>

<em>inorder(root.right)</em>

<em>def bst_insert(self, root, node):</em>

<em>if root is None:</em>

<em>root = node</em>

<em>else:</em>

<em>root.next = node</em>

<em>self.FRONT = node</em>

<em># Driver Code</em>

<em>if __name__ == "__main__":</em>

<em>r = Node(50)</em>

<em>bst_insert(r,Node(30))</em>

<em>bst_insert(r,Node(20))</em>

<em>bst_insert(r,Node(40))</em>

<em>bst_insert(r,Node(70))</em>

<em>bst_insert(r,Node(60))</em>

<em>bst_insert(r,Node(80))</em>

<em># Print inoder traversal of the BST</em>

<em>inorder(r)</em>

<em>print('The minHeap is ')</em>

<em>minHeap = MinHeap(15)</em>

<em>minHeap.insert(5)</em>

<em>minHeap.insert(3)</em>

<em>minHeap.insert(17)</em>

<em>minHeap.insert(10)</em>

<em>minHeap.insert(84)</em>

<em>minHeap.insert(19)</em>

<em>minHeap.insert(6)</em>

<em>minHeap.insert(22)</em>

<em>minHeap.insert(9)</em>

<em>minHeap.minHeap()</em>

<em>minHeap.Print()</em>

<em>print("The Min val is " + str(minHeap.remove()))</em>

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

#SPJ1

6 0
2 years ago
A group of campers walked at a speed of 4. 5 mph from their campsite to a rest area. Their return trip to the campsite took 15 m
tia_tia [17]

The distance between the campsite and the rest area is 9 miles.

The given parameters:

  • <em>Initial speed of the campers, u = 4.5 mph</em>
  • <em>Final speed of the campers, v = 4 mph</em>

<em />

Let the time of motion from the campsite to rest area = t (hours)

Time for return trip = t hours +  15 mins

                               = (t + 0.25) hours

Let the distance between the campsite and rest area = d

d = 4.5t

d = 4(t + 0.25)

4.5t = 4(t + 0.25)

4.5t = 4t + 1

4.5t - 4t = 1

0.5t = 1

t = 2 hours

The distance between the campsite and the rest area is calculated as follows;

d = 4.5t

d = 4.5 x 2

d = 9 miles

Thus, the distance between the campsite and the rest area is 9 miles.

Learn more about distance and speed here: brainly.com/question/2854969

5 0
3 years ago
i'm just looking at the bottom of this empty bottle asking myself what's the purpose of my life i'm just a waste of space
zavuch27 [327]
Don’t say that. you are not a waste of space
8 0
3 years ago
Other questions:
  • You are a sales specialist at a company that makes copper wire. You use the formula (cost in dollars)= 0.09× (length in feet) to
    14·2 answers
  • State five different ways in which SATourism promote tourism development and growth in south Africa as a destination of promotio
    5·1 answer
  • Em que n?o sei se é de outros tempos da sua opini?o sobre geografia dos maiores informaç?es acerca desse departamento pessoal da
    5·1 answer
  • Who can join my classroom the code is k4qkew5<br> i can brainlest
    10·1 answer
  • Write your fortnite username in the comments if you want to try out for my clan
    11·2 answers
  • A faulty register records only $5 for every $8
    13·1 answer
  • Use the drop-down menus to indicate whether each research question is too broad, too narrow, or effective. What will the economy
    11·2 answers
  • Which use of media is most inappropriate for this scenario a speech honoring
    9·1 answer
  • Algebra structure and method book 1 mcdougal littell answer key
    10·1 answer
  • Molly desperately wants a volkswagen jetta, and this new monthly payment is pretty high again. what suggestions do you have for
    12·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!