All categories

3 years ago

Define a constellation.

SAT

1 answer:

Pachacha [2.7K]3 years ago

8 0

Answer:

1 : the configuration of stars especially at one's birth. 2 : any of 88 arbitrary configurations of stars or an area of the celestial sphere covering one of these configurations the constellation Orion. 3 : an assemblage, collection, or group of usually related persons, qualities, or things …

You might be interested in

Use the above picture to fill in the blanks for the following statement.

JulijaS [17]

Can’t see the picture but I think it’s C

7 0

3 years ago

Read 2 more answers

If a recipe for chocolate chip cookies uses 5 cups of chocolate chips for 3 batches, how many cups of chocolate chips are needed

maxonik [38]

Answer:

5 cups of chocolate chips for 3 batches, then

x cups of chocolate chips for 5 batches.

x/5 = 5/3

=> x = 5 x 5/3 = 25/3 = 8.3

Hope this helps!

3 0

3 years ago

Read 2 more answers

when iron rusts and forms iron oxide, the iron oxide has more mass than the iron. which statement correctly explains this observ

GarryVolchara [31]

The reason why iron oxide has more mass than the iron is because Iron oxide has oxygen atoms, and pure iron does not.

When iron rusts and forms iron oxide, the iron oxide has more mass than the iron. Which statement correctly explains this

observation?

(A)Iron oxide has oxygen atoms, and pure iron does not.

(B)The oxygen atoms in iron oxide have more mass than the iron atoms in pure iron.

(C)The iron atoms in iron oxide have more mass than pure iron.

(D)There are more iron atoms in iron oxide than in pure iron.

When a chemical reaction takes place, other atoms are combined with pure elements to form compounds. This addition of another atom (oxygen) after reaction makes iron oxide formed heavier than pure iron.

Iron oxide is a chemical substance formed when pure iron rusts. The formation of iron oxide is a chemical reaction.

Hence, the correct answer to the question is; the iron is heavier because Iron oxide has oxygen atoms, and pure iron does not.

Learn more: brainly.com/question/6284546

8 0

2 years ago

What evidence from the text best supports the theme that women have an equal right to be free? ""He is legally freed from all ob

lesya692 [45]

Answer:

The right answer is: "There must be a perfect freedom on both sides". beyond the mere symbolism that represents the delivery of a ring, it is assumed in this context that the woman will also enjoy the emancipation that the marriage dissolution represents. In such a way that the independence of the woman must be the same -or even bigger- than the man.

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>

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

2 years ago

Define a constellation.​

Define a constellation.