Which method of deleting files can be used in Windows XP and Vista?

If the point (4,-2) is included in a direct variation relationship, which point also belongs in this direct variation?

pashok25 [27]

Answer:there is a vgraph so where it says 4 at the bottom then go under to -2 then ur done.

Explanation:

4 0

2 years ago

Which of the following will be the ratio of the perimeter of the blue triangle to the red triangle.

Kazeer [188]

The ratio (red to blue) of the perimeters of the similar triangles is 12:7

Assuming that the similar triangles are equilateral triangles, then all their sides will be equal.

Perimeter of a triangle = s1 + s2 + s3

For the red triangle;

Perimeter of the red triangle = 12 + 12 + 12

Perimeter of the red triangle = 36

For the blue triangle:

Perimeter of the blue triangle = 7 + 7 + 7

Perimeter of the blue triangle = 21

Taking the ratio of their perimeters;

Ratio of red to blue = 36:21 = 12:7

Hence the ratio (red to blue) of the perimeters of the similar triangles is 12:7

Learn more here: brainly.com/question/15046223

8 0

2 years ago

What occurs in both solar and lunar total eclipses?

tankabanditka [31]

The answer would be A

6 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

More free pts!!!!!! If you need help on an essay I can help!

Yakvenalex [24]

Answer:

<h3>Thank you so much!!</h3>

Explanation:

Have a wonderful day!!

7 0

3 years ago