HELP!WILL NAME BRAINLIEST!!

Calista is struggling to balance her home life, part-time job, and school work. Her grades have begun to slip, and she is consid

kakasveta [241]

Calista should not give up on her education and she should set a timetable.

<h3>Advices that Calista can follow </h3>

She should not give up, Calista should not give up on her education since she had already started, but continue to encourage herself.
Set a timetable, Calista should have a timetable of how to run her day to day activities which can better help her have time for her studies.

Therefore, Calista should not give up on her education and she should set a timetable for herself that will work for her.

Learn more on importance of education here,

brainly.com/question/13341331

6 0

2 years ago

Which line from Extremely Loud and Incredibly Close reveals a melancholy tone?

son4ous [18]

Answer:

I wanted to tell her she shouldn't be playing Scrabble yet. Or looking in the mirror. Or turning the stereo any louder than what you needed just to hear it. It wasn't fair to Dad, and it wasn't fair to me.

Explanation:

7 0

3 years ago

A salesman makes both a base salary and also a commission, which is a percentage of what he sells. Each month, if his sales tota

kkurt [141]

Answer:

the 2000 represents the base salary he makes

Explanation:

we know that the salesman makes money from two things the base salary and the commission he takes on his sales.

it is clear that the base salary he takes is a fixed number while the commission varies with the sales he makes.

in this equation the number 2000 is fixed so it is the base salary (it does not change with the sales he makes).

but the 0.1s changes when s, total sales, changes so it is the commission he makes.

hope that was helpful.

3 0

2 years ago

Put the plot events from animal farm in the correct order.

Dovator [93]

Answer:

how can u put more detail please

5 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

1 year ago