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
vekshin1
3 years ago
10

Need to know length of x

SAT
1 answer:
Afina-wow [57]3 years ago
5 0

Answer:

12 may be the answer also there is a possibility od 15 but more likeltly its going to be 12

You might be interested in
Anyone available to do this?
Mrac [35]
We are made of our dreams, our small lives are filled with sleep

I hope this helps, let me know if you need something different.
8 0
3 years ago
In addition to gold and silver, what did the london company hope to find at jamestown? new crops and products the northwest pass
Galina-37 [17]

Answer:

The correct answer of the given question above would be THE NORTHWEST PASSAGE. London Company hoped to find at Jamestown in addition to gold and silver, is the Northwest Passage. The Northwest Passage is a sea route that links the Northern Atlantic and Pacific Oceans through the Arctic Ocean.

Explanation:

6 0
1 year ago
SOME ONE HELP WITH THIS 5 QUESTIONS !!!!!!!!!!!! Packet economics
Solnce55 [7]
I don't know if I'm right but I think is:

1- D
2-A
3-C
4-A
3 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>

<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
(︶^︶)<br> 10 points TAKE IT
joja [24]

Answer:

ayee yooo ayyeee yoo

Explanation:

4 0
2 years ago
Other questions:
  • What is the teacher's purpose behind giving short answer tests? (site 1)
    10·2 answers
  • Why are the media more influential on public opinion today than in the past?
    9·2 answers
  • Who can help me create a song with hand or body movements using a nursery rhyme or any tune of your choice?
    14·1 answer
  • A study of the amount of time it takes a mechanic to rebuild the transmission for a 2010 Chevrolet Colorado shows that the mean
    12·2 answers
  • If you could have an item, what would you get?
    10·2 answers
  • What did people place on the altars? a. a picture of the patron saint b. relics of the church’s patron saint c. triptychs of the
    12·1 answer
  • A current of 15 amps flows through a circuit with a resistance of 0. 10 ohms. What is the voltage?.
    14·1 answer
  • Match the following regulations to their appropriate categories.
    9·1 answer
  • When the 0.10 m solution of hclo2 is allowed to come to equilibrium, what percent of the acid molecules are ionized?
    14·1 answer
  • Which of these hormones causes elevation of the level of glucose in human blood?
    7·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!