All categories

3 years ago

Which is NOT true of sound waves?

SAT

2 answers:

Sphinxa [80]3 years ago

8 0

Answer:

They can travel through vacuum.

Explanation:

Sound waves are vibration that travel through particles such as solid, liquids, and gas.

zepelin [54]3 years ago

8 0

Pretty sure sound waves can’t travel through vacuums.

You might be interested in

some commenters took pictures of huge piles of snow and added comments such as, "This doesn’t look like global warming." Do thes

andreev551 [17]

Answer:

i disagree

Explanation:

it could be a strong storm and the heat made it look like a normal storm

8 0

3 years ago

Read 2 more answers

Response questions generally focus on

Lady bird [3.3K]

It is either B or D all of the above. It depends on what kind of response. So, probably D

6 0

2 years ago

Read 2 more answers

the graph of f is given. state the numbers at which f is not differentiable. (enter your answers as a comma-separated list.)

artcher [175]

The numbers at which f is not differentiable are; -1, and 2

The reason the above list of numbers at which f is not differentiable are correct are given as follows:

Question; Please find attached a graph that can be used to solve the question

A function is not differentiable at a point where the function has a discontinuity. That is a point on the graph were there is a break in the graph

Therefore, the given graph of f shows that the function is not differentiable at x = -1, the point where the graph has a discontinuity

A function is not differentiable at a point where the graph of the function has a kink or corner.

The graph of f has a kink at x = 2, therefore, the function is also not differentiable at x = 2

Learn more about differentiability of a function here:

brainly.com/question/18187058

6 0

2 years ago

Neurofeedback, a newer type of biofeedback, involves trying to change

frosja888 [35]

Neurofeedback involves trying to change brain wave activity.

<h3>Brain wave</h3>

The human brain is an intricate organ that baffles many scientists today. One design feature of the human brain is its ability to send signals in the form of brain waves when the mind is ar work or in a state of rest. These brain wave activity are braodly categorized into four types, namely;

beta waves
alpha waves
theta waves
delta waves

Neurofeedback thus occurs when an attempt is made to change from one of the above brain wave types to another.

You can learn more about brain wave activity here brainly.com/question/14080098

#SPJ1

8 0

1 year 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