Answer:
115200000 bits
Explanation:
Given Data:
Total Time = 3 minute = 3 x 60 sec = 180 sec
Sampling rate = 40,000 bits / sample
Each sample contain bits = 16 bits /sample
Total bits of song = ?
Solution
Total bits of song = Total Time x Sampling rate x Each sample contain bits
= 180 sec x 40,000 bits / sec x 16 bits /sample
= 115200000 bits
= 115200000/8 bits
= 14400000 bytes
= 144 MB
There are total samples in one second are 40000. Total time of the song is 180 seconds and one sample contains 16 bits. so the total bits in the song are 144 MB.
Answer:
program (noun) is executable software that runs on a computer. ... Examples of programs include Web browsers, word processors, e-mail clients, video games, and system utilities. These programs are often called applications, which can be used synonymously with "software programs." On Windows, programs typically have an .
Answer:
If you want to learn coding than get a game and look at the code inside.
Explanation:
I sugest terraria
The correct answer is known as a "query".
When you ask a lot of complex questions , which uses comparison operators, that is called a query. A query refers to the <span>exact request for </span>data retrieval<span> with the use of database and information systems. </span>
Answer:
No you can not tell that recursion is ever required to solve a problem.
Recursion is required when in the problem, the solution of the input depends on the solution of the subsets of the input.
Iteration is also another form of repetitive approach we follow to solve that kind of problems.
But the difference between recursion and iteration is :
- In recursion we call the function repeatedly to return the result to next level.
- In iteration certain bunch of instructions in a loop are executed until certain conditions met.
Explanation:
For example in the Fibonacci sequence problem, to find , we need to compute and before that.
- In case of recursion we just call the method Fibonacci(n) repeatedly only changing the parameter Fibonacci(n-1), that calculates the value and return it.
Fibonacci(n)
1. if(n==0 or n==1)
2. return 1.
3.else
4. return( Fibonacci(n-1)+Fibonacci(n-1) )
- But in case of iteration we run a loop for i=2 to n, within which we add the value of current and to find the value of
Fibonacci(n)
1. if(n<=2)
2. result = 1
3. else
4. result1 =1 and result2=1.
5. { result = result1 +result2.
6. result1= result2.
7. result2 = result.
8. }
9. output result.