Answer: The component that is used for most amplifiers is the transistor. Semiconductors like gold,copper etc. are used although poor semiconductors like silicon are sometimes used as well. There are many electronic circuits that all under the amplifier category. The classification of an amplifier depends on the size of the signal and configuration.
Answer:
<u>for loop code:</u>
int total=0;
for(int i=0;i<10;i++)
{
total + = value[i];
}
Explanation:
By declaration we know that the array is of size 10 which means the index will start from 0.
The variable name to be used to store the sum is given as total
We will initialize total with zero so that no garbage value is used.
For loop will be used to access the elements of array and calculate the sum. The syntax of for loop is given as:
for (initialization; condition; increment/decrement)
{statement}
<u>Code:</u>
int total=0;
for(int i=0;i<10;i++)
{
total + = value[i];
}
Answer:
Check the explanation
Explanation:
A. No. the act of selling customer's data for financial advantages and gain without the permission of customer is illegal and so unethical.
B. No. even though the Grandmother choice by itself but selling out her game data to broker without letting the concerned person know about it is not allowed.
C. Yes. It was Grandmothers' choice to play certain kind of game. As gambling vendor provides a fare game they are not doing any bad.
Answer:
Worst case time of Heapsort is better than worst case time of Quicksort.
Explanation:
Worstcase of Heapsort is nlog(n). Worstcase time of Quicksort is (n^2). Heapsort is comparison based sorting algorithm. Heapsort divides input into sorting. It is a selection sort in which we send maximum inputs for maximum elements at end. Quicksort is divide and conquer algorithm. It is considered as efficient sourcing algorithm.
