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
GalinKa [24]
3 years ago
8

GPA Scale:

SAT
1 answer:
marin [14]3 years ago
5 0
Answer: 2.0 points!!
You might be interested in
Why are tsunamis usually harmless in open water away from the shoreline?
iragen [17]
This is because I’d deep ocean,tsunami waves may appear only a foot or so high.But as they approach the shoreline and enter shallower water they slow down and begin to grow in energy and height.Since the tops of the waves move faster than the bottoms so it causes them to rise faster.So...if a tsunami is in deep waters it does not really hit the shore and splash around to hurt anyone or anything or any people.It is fine because it’s in the middle of the ocean and not on the shoreline.I hoped I helped even a little bit :3
6 0
3 years ago
What is the measure of angle x?<br><br><br> X= ?
xeze [42]
Because these are all congruent, and they're all vertical angles, this would show you that what ever you would do to one side, you do also to the other side.

(56+41)= (97).

Then we do, 180-97= (83).

\left[\begin{array}{ccc}\boxed{\bfx=83}}\end{array}\right]
4 0
3 years ago
What observation about baking powder suggests that it is a mixture of substances?
Leya [2.2K]
Baking powder is primarily used as a leavening agent in baked goods and products. It is a combination of cornstarch, cream of tartar and baking soda. The main observation that suggests that it is a mixture of substances is that fact that it produces a gas which facilitates the rising of the baked goods.
3 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
1 year ago
A car travels at a constant speed of 40 miles per hour. The distance, d, the car travels in miles is a function of time, t, in h
motikmotik

Answer:

c i think

Explanation:

4 0
3 years ago
Read 2 more answers
Other questions:
  • How do I answer this question?
    11·1 answer
  • You are the shift supervisor at a local restaurant. You note that 15 employees work on Sundays. This represents 60% of all
    10·1 answer
  • The square of number is 12 more than the number.Find the number.
    14·2 answers
  • 3. How would you multiply?<br> A.<br> C.<br> B.<br> 3-5<br> 1-4<br> 2-5<br> D.<br> 3:5
    6·1 answer
  • I WILL GIVE THE CORRECT PERSON BRAINIEST
    10·2 answers
  • A company that allows you to license software monthly
    6·1 answer
  • Only answer this if you know arabic. Please I am so desperate. And please dont answer i dont know or I am gonna delete your acco
    10·1 answer
  • Where is the group at the chapter's end? Question 4 options: at a shelter with a good view safe in the tunnel in a feasting hall
    11·2 answers
  • Describe how the force of gravity acts upon an object
    7·2 answers
  • It is widely known in kevin's social club that he is the most stubborn and inflexible member. kevin complains that all his frien
    14·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!