All categories

3 years ago

in one paragraph describe clearly how people in your community and in the country are affected by poverty

SAT

2 answers:

Eddi Din [679]3 years ago

8 0

Answer:

thanks for the points nerd

Explanation:

yan [13]3 years ago

3 0

Answer:

How does poverty affect a country?

Poverty affects a country's economy in ways such as weakening the economy, which occurs when people spend less money, and harming the education of children in poverty, which further hurts the economy by making it difficult for those children to eventually find good jobs.

Explanation:

You might be interested in

The grace period to start repaying a Perkins Loan is _____ after leaving school.

Nonamiya [84]

You have six months to begin repayment on Stafford loans after graduation, or after you leave school or drop below half-time enrollment.

5 0

3 years ago

The latest advance in technology in 2006

Romashka-Z-Leto [24]

Facebook opening to anyone above 13,twitter opening,PlayStation 3,google bought YouTube , widgets, one billionth song was purchased on iTunes ,internet explorer, and Pluto was downgraded

3 0

3 years ago

Which equation represents fertilization? haploid diploid = diploid diploid haploid = haploid haploid haploid = diploid diploid d

Crazy boy [7]

Answer: Haploid + Haploid = Diploid :)

6 0

3 years ago

Mr. Evans called this morning. He is catching a flight ..(1) new work early tomorrow. He needs you to run some errands while he

garik1379 [7]

Him her phone number

3 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

1 year ago