All categories

3 years ago

(c) 140.75

SAT

1 answer:

Shtirlitz [24]3 years ago

4 0

Answer:

c) 200 additional D.A should be paid.

Explanation:

o calculate D.A first calculate inflation rate between 1980 and 1984.

Inflation Rate = × 100

= 25%

If 800 is the basic salary then D.A should be according to inflation rate 25% of the salary.

D.A = 800 ×

= 200

Read more on Brainly.in - https://brainly.in/question/12473388#readmore

You might be interested in

which detail best describes this map? shows isolines and isobars shows types of precipitation was created for newspapers is prob

uysha [10]

Answer:

Its A

Explanation:

got it right

5 0

2 years ago

Siapakah tokoh seni ragam hias??

Leto [7]

English please and thankyou

4 0

3 years ago

Read 2 more answers

This data gives the length, in inches, of several nails. length (in.): 12, 516, 18, 12, 38, 516, 516, 316, 516, 18 create a line

Tema [17]

Answer:this is what my test looks like

Explanation:

hope this helps pls give me points byee

4 0

1 year ago

What are the requirements in the state of Oregon for emancipation?

Vladimir [108]

To begin with you must be 16 or 17 years old. You have to be able to support yourself , live on your own and manage your own affairs.

4 0

3 years ago

Read 2 more answers

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