Ask question

Ask question

All categories

3 years ago

9

These graphs show production rates for a non-specialized lamp factory and a specialized lamp factory. Which is the GREATEST diff

erence between these factories?

1 answer:

stellarik [79]3 years ago

3 0

The specialized factory had the largest gains in production. Is your answer

You might be interested in

A North American Hummingbird's wings beat. approximately 53 beats per second. How many beals will the hummingbird's wings beat i

Butoxors [25]

Answer:

3,180 beats per minute

Explanation:

4 0

3 years ago

Read 2 more answers

Finish the song Ra Ra Rasputin there was a

Ainat [17]

Answer:

This is the lyrics to Rasputin:

There lived a certain man in Russia long ago

He was big and strong, in his eyes a flaming glow

Most people looked at him with terror and with fear

But to Moscow chicks he was such a lovely dear

He could preach the bible like a preacher

Full of ecstasy and fire

But he also was the kind of teacher

Women would desire

Ra ra Rasputin

Lover of the Russian queen

There was a cat that really was gone

Ra ra Rasputin

Russia's greatest love machine

It was a shame how he carried on

He ruled the Russian land and never mind the czar

But the cassock he danced really wunderbar

In all affairs of state he was the man to please

But he was real great when he had a girl to squeeze

For the queen he was no wheeler dealer

Though she'd heard the things he'd done

She believed he was a holy healer

Who would heal her son

Ra ra Rasputin

Lover of the Russian queen

There was a cat that really was gone

Ra ra Rasputin

Russia's greatest love machine

It was a shame how he carried on

But when his drinking and lusting and his hunger

For power became known to more and more people

The demands to do something about this outrageous

Man became louder and louder

This man's just got to go, declared his enemies

But the ladies begged, don't you try to do it, please

No doubt this Rasputin had lots of hidden charms

Though he was a brute they just fell into his arms

Then one night some men of higher standing

Set a trap, they're not to blame

Come to visit us they kept demanding

And he really came

Ra ra Rasputin

Lover of the Russian queen

They put some poison into his wine

Ra ra Rasputin

Russia's greatest love machine

He drank it all and said, I feel fine

Ra ra Rasputin

Lover of the Russian queen

They didn't quit, they wanted his head

Ra ra Rasputin

Russia's greatest love machine

And so they shot him 'til he was dead

Oh, those Russians

3 0

3 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

The authors most likely use the examples in lines 1–7

marishachu [46]

Answer:

I need you to elaborate further

3 0

3 years ago

Which of these most helps in absorbing and retaining information?

asambeis [7]

What are the options ?

3 0

3 years ago