It can reasonably be inferred that the author of Passage 2 would

The material in coaching clips will be included in the.

Lina20 [59]

Answer:

Explanation:The material in the coaching clips will be included in the

7 0

3 years ago

The two dynasties whose expansions are illustrated by the images shared which of the following?.

likoan [24]

Answer:

Answer: D . Their rulers claimed power by virtue of protecting Dar al-Islam from European invasion

Explanation:

There is no map attached however, based on a related question, I have reason to believe that the dynasties being described are the Mughal and Ottoman empires.

These empires were both chiefly Muslims and they claimed rulership over vast areas of land and insisted that they were doing so to spread the words of the Prophet Muhammad and to protect the lands of Islam from takeover by the Europeans and other religions.

8 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

Reread the following quotation from paragraph 75: "oh god! to hear the insect on the leaf pronouncing on the too much life among

liraira [26]

There are different kinds of quotes. The option that best state what this quote reveals about the Ghost of Christmas Present’s and Scrooge’s differing points of view is;

It suggests that the spirit believes Scrooge is oblivious to his own suffering, like an insect that does not know what lies beyond its small environment.

The Ghost of Christmas Present is known to be a fictional story about a Christmas Spirits who visited Ebenezer Scrooge in the 1843. The aim was to offer him an opportunity for redemption.

People sometimes do not know what they are passing through. Scrooge wanted a change and as such was visited by three spirits. They made him realize things he had forgotten about himself.

See full question below

Reread the following quotation from paragraph 75: “Oh God! to hear the Insect on the leaf pronouncing on the too much life among his hungry brothers in the dust!” Which of the following best states what this quote reveals about the Ghost of Christmas Present’s and Scrooge’s differing points of view?

A. This reveals the spirit’s low opinion of Scrooge, who has a high opinion of his own status.

B. This reveals the spirit considers Scrooge and other humans to be insects in comparison to his power and wisdom.

C. This quote suggests that the spirit believes Scrooge is oblivious to his own suffering, like an insect that does not know what lies beyond its small

environment.

D. This quote recalls Scrooge’s earlier words in favor of the poor dying off to lower the population; the spirit puts Scrooge in his place, revealing that while Scrooge may consider himself above others, the spirit knows to value the lives of other Beings.

Learn more about this passage from

brainly.com/question/19854953

5 0

3 years ago

Celine has a bottle that contains 20% of milk and the rest water. The bottle has 1 liter of water. Part A: Write an equation in

klasskru [66]

The problem states that only one variable can be used. Let L be the total number of liters of water and milk combined. 20% of the total is Milk. Therefore, Milk = L x 20/100 = 0.2 L The rest of it is Water. So Water = L - 0.2L = 0.8L The problem states the bottle has 1 liter of water. So 0.8L = 1 Answer to a) 0.8L = 1 is the equation where L is the total number of liters of water and milk combined. Milk = 0.2L and Water = 0.8L b) Solve for L in 0.8L = 1 L = 1/0.8 = 1.25 Milk = 0.2L = (0.2)(1.25) = 0.25 liters

6 0

3 years ago