Identify which parts of the sentence belong in the "noun" column and which belong in the "not a noun" column.

How does the amount, or magnitude, of charge on an object affect its attraction or repulsion of another object?

lubasha [3.4K]

The magnitude of an object's charge can either increase or decrease the attraction/ repulsion between another object. The larger the difference of the two object's charges, the stronger opposite charges attract, and the stronger like charges repel.

5 0

4 years ago

the reduction of carbon dioxide emissions poses few threats to sustaining economic growth in developing countries.

Oksi-84 [34.3K]

It is false that the reduction of carbon dioxide emissions poses few threats to sustaining economic growth in developing countries.

Given that the reduction of carbon dioxide emissions poses few threats to sustaining economic growth in developing countries.

We are required to say whether the statement is true or false.

Economic growth basically defined as the increase or improvement in the inflation-adjusted market value of the goods and services produced by an economy over a certain period of time.

The reduction of carbon dioxide emissions does not poses threats but benefits our country and in result lead to increase in economic growth of the countries.

Hence it is false that the reduction of carbon dioxide emissions poses few threats to sustaining economic growth in developing countries.

Learn more about economic growth at brainly.com/question/1690575

#SPJ4

3 0

2 years ago

Which are steps that could be used to solve 0 = 9(x2 6x) – 18 by completing the square? Check all that apply. 18 81 = 9(x2 6x 9)

Marina CMI [18]

Answer:

18 + 81 = 9(x² + 6x + 9) 11 = (x + 3)²

Explanation:

because This is the value that completes the square. However, since the entire square is multiplied by 9, this value must be multiplied by 9 before we can add it across the equals:

18 + 9 (9) = 9 (x² + 6x + 9)

18 + 81 = 9 (x² + 6x + 9)

99 = 9 (x² + 6x + 9)

Dividing both sides by 9, we have:

11 = x² + 6x + 9

11 = (x + 3) ²

4 0

3 years ago

1. The electric field at the point of charge!

Tju [1.3M]

Answer:so what is your question

Explanation:

6 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