1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
slava [35]
2 years ago
7

Which religion is being described in this passage? "This religion, which emphasizes detachment from worldly goods, originated in

India and missionaries spread it to China, Japan, and other parts of Asia." Question 8 options: Buddhism Christianity Hinduism Islam Judaism Shintoism
SAT
1 answer:
MAXImum [283]2 years ago
3 0

Answer:

Buddhism

Explanation:

You might be interested in
The total number of pennies on row 1 is: 1 + 2 + 4 + 8 + 16 + 32 + 64 + 128 =.
Elena-2011 [213]

Answer:

255

Explanation:

trust but only for 1+2+4…

3 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>

<em>import sys</em>

<em>class Node:</em>

<em>def __init__(self,key):</em>

<em>self.left = None</em>

<em>self.right = None</em>

<em>self.val = key</em>

<em>self.parent = None</em>

<em>class MinHeap:</em>

<em>def __init__(self, maxsize):</em>

<em>self.maxsize = maxsize</em>

<em>self.size = 0</em>

<em>self.Heap = Node(-1 * sys.maxsize )</em>

<em>self.FRONT = self.Heap</em>

<em># A utility function to do inorder tree traversal</em>

<em>def isLeaf(self, node):</em>

<em>if node.left == None and node.right == Node:</em>

<em>return True</em>

<em>return False</em>

<em># Function to swap two nodes of the heap</em>

<em>def swap(self, node1, node2):</em>

<em>node1.data, node2.data = node2.data, node1.data</em>

<em># Function to heapify the node at pos</em>

<em>def minHeapify(self, node):</em>

<em># If the node is a non-leaf node and greater</em>

<em># than any of its child</em>

<em>if not self.isLeaf(node):</em>

<em>if (node.data > node.left.data or</em>

<em>node.data > node.right.data):</em>

<em># Swap with the left child and heapify</em>

<em># the left child</em>

<em>if node.left.data < node.right.data:</em>

<em>self.swap(node, node.left)</em>

<em>self.minHeapify(node.left)</em>

<em># Swap with the right child and heapify</em>

<em># the right child</em>

<em>else:</em>

<em>self.swap(node, node.right)</em>

<em>self.minHeapify(node.right)</em>

<em># Function to insert a node into the heap</em>

<em>def insert(self, element):</em>

<em>if self.size >= self.maxsize :</em>

<em>return</em>

<em>self.size+= 1</em>

<em>self.bst_insert(FRONT, element)</em>

<em>current = FRONT</em>

<em>while current.parent != None and current.data < current.parent.data:</em>

<em>self.swap(current, current.parent)</em>

<em>current = current.parent</em>

<em># Function to print the contents of the heap</em>

<em>def Print(self):</em>

<em>self.inorder()</em>

<em># Function to build the min heap using</em>

<em># the minHeapify function</em>

<em>def inorder(self, root):</em>

<em>if root:</em>

<em>inorder(root.left)</em>

<em>print(root.val)</em>

<em>inorder(root.right)</em>

<em>def bst_insert(self, root, node):</em>

<em>if root is None:</em>

<em>root = node</em>

<em>else:</em>

<em>root.next = node</em>

<em>self.FRONT = node</em>

<em># Driver Code</em>

<em>if __name__ == "__main__":</em>

<em>r = Node(50)</em>

<em>bst_insert(r,Node(30))</em>

<em>bst_insert(r,Node(20))</em>

<em>bst_insert(r,Node(40))</em>

<em>bst_insert(r,Node(70))</em>

<em>bst_insert(r,Node(60))</em>

<em>bst_insert(r,Node(80))</em>

<em># Print inoder traversal of the BST</em>

<em>inorder(r)</em>

<em>print('The minHeap is ')</em>

<em>minHeap = MinHeap(15)</em>

<em>minHeap.insert(5)</em>

<em>minHeap.insert(3)</em>

<em>minHeap.insert(17)</em>

<em>minHeap.insert(10)</em>

<em>minHeap.insert(84)</em>

<em>minHeap.insert(19)</em>

<em>minHeap.insert(6)</em>

<em>minHeap.insert(22)</em>

<em>minHeap.insert(9)</em>

<em>minHeap.minHeap()</em>

<em>minHeap.Print()</em>

<em>print("The Min val is " + str(minHeap.remove()))</em>

See more about python at brainly.com/question/13437928

#SPJ1

6 0
1 year ago
What does a “credit” mean in college?
Jet001 [13]
Hello there!

A credit is basically one school year (the amount of time it takes for you to acquire a credit for that class).


Hope I helped!

Let me know if you need anything else!

~ Zoe
6 0
3 years ago
Read 2 more answers
While on exchange in mérida, isaac was reading the local newspaper and had to look up a few words. He found the following defini
Airida [17]

Answer:

the weather forcast

Explanation:

took the same class

4 0
2 years ago
Which food would provide you with the most calcium?
amm1812
The food is Potatoes
3 0
3 years ago
Read 2 more answers
Other questions:
  • What are the requirements in the state of Oregon for emancipation?
    12·2 answers
  • How are high pressure areas created around the poles with cool air?
    7·2 answers
  • What are all the gods from percy jackson
    11·2 answers
  • In the equation above, kkk is a constant. For what value of kkk are there no solutions to the equation?
    10·1 answer
  • Determine the t-value in each of the cases
    11·1 answer
  • Payton collected data to show the relationship between the number of hours he practices and the number of errors he makes when p
    5·2 answers
  • Use synthetic division to solve. What is the quotient?.
    8·1 answer
  • Why did the prisoner choose the bread and not the key brainly.
    15·1 answer
  • Based on the passage, what inference can be made about why president eisenhower supported the civil rights act of 1957? he wante
    15·1 answer
  • As a cell grows, the surface area to volume ratio (sa:v) decreases. in order to maintain homeostasis, the cell must divide or di
    9·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!