All categories

3 years ago

Bending of light that happens when light travels throught different mediums (subtance)

1 answer:

7 0

This 'bending of a ray of light' when it passes from one substance into another substance is called refraction. The bending of a ray of light also occurs when the ray comes out of glass or water and passes into air.

You might be interested in

Why does having a high first ionization energy and high electronegativity cause a nonmetal to be very reactive?.

Elena-2011 [213]

There in an increase in reactivity because the nonmetals want to hold on to their electrons.

<h3>Reactivity</h3>

With less electronegativity, there is also less ionization energy. For metals, it is easier to lose the electrons, hence the metal becomes more reactive because it uses less energy.

For nonmetals, they are gain electrons and not lose them. Thus, an increase in electronegativity and ionization energy means an increase in reactivity because the nonmetals want to hold on to their electrons.

Find out more on reactivity at: brainly.com/question/17141109

6 0

2 years ago

Use synthetic division to solve. What is the quotient?.

SpyIntel [72]

Answer:

Need the question

Explanation:

4 0

2 years ago

Im thin but wide long and easily ripped im used to draw i lay around until im in a book but not only new

Alex17521 [72]

I believe the answer is a book... It's thin and long, wide on the sides, easily ripped, etc

7 0

3 years ago

Solve for x in the equation x^2-8x+41=0.

Ilya [14]

X^2-8x+41=0
x-8x+41=0
-7x+41=0
-7x=-41
x=41/7
Hope that helped :D

5 0

3 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