The rhythmic note that three beats is called a___

Pa help please I need help<br>10 points :'(<br>nonsense report:<br>1 heart

tatuchka [14]

Answer:

√ 1. Cellphone

<h3>Product Description:</h3>

A cellphone is any portable telephone that uses cellular network technology to make and receive calls.

7 0

2 years ago

Predict how digital video will be viewed in the future. Step into the year 2028. How are people viewing digital video? Or have w

frutty [35]

<span>Google Glass was interesting; a personal screen overlaid onto the real world, with 'augmented reality' ideas. The Nintendo 3DS was the first 'no glasses' portable 3D system.

So I predict Google 3D Glasses with built in Dolby 9.1 sound emulation. </span>

6 0

3 years ago

Read 2 more answers

List and briefly explain five activities for which a purchasing department normally has responsibility

melamori03 [73]

<span>Five activities for which a purchasing department normally has responsibility include: issuing their own purchase orders, meeting with different sales representatives, maintaining their own purchase records in accordance with state and federal law, administering contracts with sellers, and coming to a resolution regarding any purchasing problems that might arise.</span>

5 0

3 years ago

We have said that the average number of comparisons need to find a target value in an n-element list using sequential search is

bija089 [108]

Answer:

Part a: If the list contains n elements (where n is odd) the middle term is at index (n-1)/2 and the number of comparisons are (n+1)/2.

Part b: If the list contains n elements (where n is even) the middle terms are at index (n-2)/2 & n/2 and the number of comparisons are (n+2)/2.

Part c: The average number of comparisons for a list bearing n elements is 2n+3/4 comparisons.

Explanation:

Suppose the list is such that the starting index is 0.

Part a

If list has 15 elements, the middle item would be given at 7th index i.e.

there are 7 indices(0,1,2,3,4,5,6) below it and 7 indices(8,9,10,11,12,13,14) above it. It will have to run 8 comparisons to find the middle term.

If list has 17 elements, the middle item would be given at 8th index i.e.

there are 8 indices(0,1,2,3,4,5,6,7) below it and 8 indices(9,10,11,12,13,14,15,16) above it.It will have to run 9 comparisons to find the middle term.

If list has 21 elements, the middle item would be given at 10th index i.e.

there are 10 indices (0,1,2,3,4,5,6,7,8,9) below it and 10 indices (11,12,13,14,15,16,17,18,19,20) above it.It will have to run 11 comparisons to find the middle term.

Now this indicates that if the list contains n elements (where n is odd) the middle term is at index (n-1)/2 and the number of comparisons are (n+1)/2.

Part b

If list has 16 elements, there are two middle terms as one at would be at 7th index and the one at 8th index .There are 7 indices(0,1,2,3,4,5,6) below it and 7 indices(9,10,11,12,13,14,15) above it. It will have to run 9 comparisons to find the middle terms.

If list has 18 elements, there are two middle terms as one at would be at 8th index and the one at 9th index .There are 8 indices(0,1,2,3,4,5,6,7) below it and 8 indices(10,11,12,13,14,15,16,17) above it. It will have to run 10 comparisons to find the middle terms.

If list has 20 elements, there are two middle terms as one at would be at 9th index and the one at 10th index .There are 9 indices(0,1,2,3,4,5,6,7,8) below it and 9 indices(11,12,13,14,15,16,17,18,19) above it. It will have to run 11 comparisons to find the middle terms.

Now this indicates that if the list contains n elements (where n is even) the middle terms are at index (n-2)/2 & n/2 and the number of comparisons are (n+2)/2.

Part c

So the average number of comparisons is given as

((n+1)/2+(n+2)/2)/2=(2n+3)/4

So the average number of comparisons for a list bearing n elements is 2n+3/4 comparisons.

6 0

3 years ago

Construct an algorithm to print the first 20 numbers in the Fibonacci series (in mathematics) thanks

ss7ja [257]

Answer:

0+1=1

1+1=2

1+2=3

2+3=5

3+5=8

5+8=13

Explanation:

// C++ program to print

// first n Fibonacci numbers

#include <bits/stdc++.h>

using namespace std;

// Function to print

// first n Fibonacci Numbers

void printFibonacciNumbers(int n)

{

int f1 = 0, f2 = 1, i;

if (n < 1)

return;

cout << f1 << " ";

for (i = 1; i < n; i++) {

cout << f2 << " ";

int next = f1 + f2;

f1 = f2;

f2 = next;

}

// Driver Code

int main()

{

printFibonacciNumbers(7);

return 0;

}

8 0

3 years ago

The rhythmic note that three beats is called a____half note.