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
AURORKA [14]
2 years ago
9

A bag contains 6 red marbles, 4 blue marbles, 7 green marbles, and 3 yellow marbles

SAT
1 answer:
krok68 [10]2 years ago
5 0

Answer:

20 marbles

Explanation:

6 red marbles

4 blue marbles

7 green marbles

3 yellow marbles

<h3>6+4+7+3=20</h3>

You might be interested in
Fill in the blank with the spanish word that best completes the following sentence. Mi padre está en el hospital. Tuvo un ataque
solmaris [256]

Answer:

corazón

Explanation:

not sure but i am pretty sure at the same time

4 0
2 years ago
Read 2 more answers
In her article "Why Should I Vote?" Stephanie Goggin crafts a well-organized and coherent argument. She states that every person
Alexeev081 [22]

The Answer Is evaluation of evidence

5 0
3 years ago
Read 2 more answers
X+y=0
musickatia [10]
The correct answer is d hope i could help
6 0
3 years ago
True or false: f(x) is a function. a. false b. true
Leno4ka [110]

Answer:

False

Explanation:

6 0
2 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
Other questions:
  • If (4^a^-2)(4^3) = 64^2 , what is the value of a? a. 0 b. 4 c. 5 d. 7 e. 8
    6·1 answer
  • History has decided that all people are completely determined by their genetics. True False
    8·2 answers
  • The authors use the phrase "ground "Truth" with a capital "T"" (lines
    7·1 answer
  • The fathers age is the sum of the son and the mother ​
    8·2 answers
  • just to let yall kn0w im goblin gang ghost boy k ya feel me any ghost slide on me its over no vampires either I got garlic on de
    14·2 answers
  • F R E E P O I N T S A N D C R O W N F O R B E S T H U M O R B T W A D D M E O N R O B L O X : SnugglyMonster
    9·2 answers
  • In a paragraph, define the following concepts.
    11·1 answer
  • _________ people were used as indentured servants and/or slaves in the Caribbean. Question 12 options: Chinese Indian Native Ame
    14·1 answer
  • Helena needs 3. 5 cups of flour per loaf of bread and 2. 5 cups of flour per batch of muffins. She also needs 0. 75 cup of sugar
    15·1 answer
  • Please select the word from the list that best fits the definition Emilio put on the shirt.
    11·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!