Answer:
The correct program to this question can be given as:
Program:
//header file
#include<iostream> //include header file
using namespace std;
//main
int main() //defining method main
{
double radius,area=0; //defining variables
double PI=3.14; //defining variable PI and assign value
cout <<"Enter the radius: "; //message
cin >> radius; //input value by user
area = PI * radius * radius; //formula to calculate area
cout << "Area: "<< area << endl; //print area
return 0;
}
Output:
Enter the radius: 3.0
Area: 28.26
Explanation:
In the above program code, a header file is included. In the next line, the main method is defined, which contain three double type variable that is "radius, area, and PI".
- The radius variable is used to take input by the user, and the area variable is to calculate the area of the circle, and the PI is used to hold a constant value, which is "3.14".
- After taking user input in radius variable the area variable has used the formula of the circle, which calculates a value and in the last print, the function uses "cout", that prints area variable value.
R₂ and R₃ can be replaced by:
The total R of the circuit is R₁+R₅+R₄ = 706 2/3
So the current in the circuit I=V/R is 100/(706 2/3) = 15/106 A
(I'm deliberately not trying to round the result)
The voltage drop over R₄ is V=I*R = 15/106 * 500 ≈ 70
So answer C would be my choice.
Linear probing
It does a linear search for an empty slot when a collision is identified
Advantages
Easy to implement
It always finds a location if there is one
Disadvantages
When clusters and keys fill most of the array after forming in adjacent slots of the table, the performance deteriorates
Double probing/hashing
The idea here is to make the offset to the next position probed depending on the key value. This is so it can be different for different keys.
Advantages
Good for double number generation
Smaller hash tables can be used.
Disadvantages
As the table fills up, the performance degrades.
Quadratic probing
It is used to resolve collisions in hash tables. It is an open addressing scheme in computer programming.
Advantage
It is more efficient for a closed hash table.
Disadvantage
Has secondary clustering. Two keys have same probe sequence when they hash to the same location.
Answer:
open the header. hope this helps
A compiler is often used when you want to test your code; that would often be your second step.
