All categories

3 years ago

I need y’all to answer this ASAP no rocky.

SAT

2 answers:

Kisachek [45]3 years ago

8 0

Answer:

Decision making

Explanation:

being able to analyze possible outcomes for a decision is the ability to make decisions(thats the best explanation I could think of idk)

RideAnS [48]3 years ago

5 0

Answer:

c maybe im not rlly sure

Explanation:

You might be interested in

Which statement best describes the density of the outer planets

Ugo [173]

Where are the statements?

6 0

3 years ago

Read 2 more answers

What type of energy is associated with food? How is that energy stored? How does food energy change when it is used to do work?

AVprozaik [17]

The energy associated with food is chemical energy.

The food contain carbohydrates, proteins, vitamins and minerals, that are used by chemical reactions in the live organisms (the metabolism) to build the cells that form our tissues (muscles, bones, blood).

The chemical energy is stored as chemical bonds in the cells and is released when the bonds break giving energy that we use to run about, and move and talk (kinetic and sound energy).

3 0

3 years ago

How many types of body of water are there

marta [7]

Answer: 47 Types of Bodies of Water.

Explanation:

pls like

8 0

2 years ago

scientists say that researching genes will help find solutions for diseases that affect humans. is this true? Give reasons for y

Nataliya [291]

When genetic molecules are broken down and deciphered under a large scale then the defects can be magnified and researched and further stopped. Hopefully with the scientific advancements at hand and with enough people to come forward to participate in the study these diseases and genetic defaults will cease.

4 0

3 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