What evidence supports a scientist's conclusion that fossil B is older than fossil A?

8_murik_8 [283]

Answer:

Explanation:

Yellow is energizing without being noisy or irate." "It is a warm, delicate tone, similar to an infant chick, or the glow of daylight in springtime gushing through a window heating up a fix on the rug."

3 0

2 years ago

Which of the following would be a personal responsiblity in the united states ?

Nezavi [6.7K]

Paying rent is a personal responsibility

4 0

3 years ago

For which of the following will an employment application most likely ask?

My name is Ann [436]

Answer: A. Education history

Explanation: Parental employment history and loan history are not things they are not supposed to ask about and financial history is generally considered private. Education history makes the most sense because they would want to know if their applicants have the education needed for the job.

Hope this helps! :)

3 0

3 years ago

Read 2 more answers

What viewpoint is conveyed by sophocles through the following lines spoken by antigone to creon regarding his decree that she di

Lana71 [14]

Answer:

The Gods cannot help save someone from poor decisions he/she has made.

Explanation:

Creon has committed a grave sin by the killing of his own kin partly because he wanted the throne and thus has brought ruin to his own people after the unknowing act of Oedipus and now his willingly killing of his own kin.

When he is repenting and praying to the god for forgiveness, it is through the character of Charagos that the authorial voice speaks and tells him something.

That is being told to him that he must pay for what he has done and he will not be forgiven

4 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

1 year ago