All categories

3 years ago

Question 1 of 40

SAT

1 answer:

Rina8888 [55]3 years ago

8 0

<h3>Answer: D) 4</h3>

===========================================================

Explanation:

The width of the confidence interval is 20-12 = 8 units. That cuts in half to get 8/2 = 4 which is the margin of error.

The center of the confidence interval is (12+20)/2 = 32/2 = 16. Add four onto this to get 16+4 = 20, which is the right endpoint. Subtract four from the center to get 16-4 = 12, which is the left endpoint.

Effectively, it's like saying "an archer aims for the value 16 on the number line, and the arrow could land as high as 20 or as low as 12".

You might be interested in

Would anyone like to talk to talk to me? i am lonely :)

lesantik [10]

Answer:

Aren't we all

Explanation:

3 0

2 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>

import sys

class Node:

def __init__(self,key):

self.left = None

self.right = None

self.val = key

self.parent = None

class MinHeap:

def __init__(self, maxsize):

self.maxsize = maxsize

self.size = 0

self.Heap = Node(-1 * sys.maxsize )

self.FRONT = self.Heap

# A utility function to do inorder tree traversal

def isLeaf(self, node):

if node.left == None and node.right == Node:

return True

return False

# Function to swap two nodes of the heap

def swap(self, node1, node2):

node1.data, node2.data = node2.data, node1.data

# Function to heapify the node at pos

def minHeapify(self, node):

# If the node is a non-leaf node and greater

# than any of its child

if not self.isLeaf(node):

if (node.data > node.left.data or

node.data > node.right.data):

# Swap with the left child and heapify

# the left child

if node.left.data < node.right.data:

self.swap(node, node.left)

self.minHeapify(node.left)

# Swap with the right child and heapify

# the right child

else:

self.swap(node, node.right)

self.minHeapify(node.right)

# Function to insert a node into the heap

def insert(self, element):

if self.size >= self.maxsize :

return

self.size+= 1

self.bst_insert(FRONT, element)

current = FRONT

while current.parent != None and current.data < current.parent.data:

self.swap(current, current.parent)

current = current.parent

# Function to print the contents of the heap

def Print(self):

self.inorder()

# Function to build the min heap using

# the minHeapify function

def inorder(self, root):

if root:

inorder(root.left)

print(root.val)

inorder(root.right)

def bst_insert(self, root, node):

if root is None:

root = node

else:

root.next = node

self.FRONT = node

# Driver Code

if __name__ == "__main__":

r = Node(50)

bst_insert(r,Node(30))

bst_insert(r,Node(20))

bst_insert(r,Node(40))

bst_insert(r,Node(70))

bst_insert(r,Node(60))

bst_insert(r,Node(80))

# Print inoder traversal of the BST

inorder(r)

print('The minHeap is ')

minHeap = MinHeap(15)

minHeap.insert(5)

minHeap.insert(3)

minHeap.insert(17)

minHeap.insert(10)

minHeap.insert(84)

minHeap.insert(19)

minHeap.insert(6)

minHeap.insert(22)

minHeap.insert(9)

minHeap.minHeap()

minHeap.Print()

print("The Min val is " + str(minHeap.remove()))

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

#SPJ1

6 0

1 year ago

Which note-taking method is most useful for memorizing a lot of material quickly?

Otrada [13]

Explanation:

conceptual note taking...............

3 0

2 years ago

A researcher is investigating if the medicine “AIDSCURE” is able to reduce the immune system dysfunction and cancer symptoms aff

Alja [10]

See photo attached
Hope this sort of helps ʕ•ᴥ•ʔ

6 0

3 years ago