Answer:
int half(int x){
int a=x/2;
return a;
}
Explanation:
function <em>half(x)</em> which has return type <em>integer</em> and accept an <em>integer </em>type parameter <em>'x'</em> and return the an <em>integer </em>value in variable <em>'a' </em>which is closest to <em>half</em> that of the parameter '<em>x'</em>.
<h2>Solution :</h2>
The given problem is solved in Python.
def ComputeSquare():
side = float(input('Enter the side of the square: '))
if side > 0:
perimeter = 4 * side
area = side * side
print('Perimeter of the square is:',
perimeter, 'unit.')
print('Area of the square is:', area, 'square unit.')
<h3> else:</h3>
print('Invalid input.')
ComputeSquare()
<h2>Explanation :-</h2>
- In this program, we create a function ComputeSquare() to calculate the perimeter and area of a square.
- The function asks the user to enter the side of the square. The side is then stored in a variable.
- Now, we check whether the side is greater than 0 or not using if-else statement.
- If the condition is true, the perimeter and area is calculated which is displayed using print() statement.
- If the condition is false, the else blocks executes printing the error message.
<h3>Refer to the attachment for output.</h3>
Answer:
Check the explanation
Explanation:
When there are situations of obviously misspelled queries, you will have to base the Needs Met rating on the user intent
The reason is that, even when query is misspelled it won’t mean that it is less important. Therefore, the queries should be assigned degree of rating based on the respective priority.
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.
