Q1) Write the pseudocode for the following. a. Ask a user to enter a number. If the number is between 0 and 10, write the word blue. If the number is between 10 and 20, write the word red. If the number is between 20 and 30, write the word green. If it is any other number, write that it is not a correct colour option. b. Ask user to enter weight. Program will only display status “You’re obese” if the weight is more than 100kg. c. Modify above question. Program will display status based on below condition: weight >100kg, status= “Obese” weight < 30kg, status= “Underweight” others, status = “Normal”
Max Function
Statistical function is of many categories. One of them is a MAX function. The MAX function returns the largest value from the list of arguments passed to it. MAX function always ignores the empty cells when performing the calculation.
Power Function
A power function is a type of single-term function. Its definition states that it is a variable containing a base value raised to a constant value acting as an exponent. This variable may also have a coefficient. For instance, the area of a circle can be given as:
Q1) Write the pseudocode for the following.
a. Ask a user to enter a number. If the number is between 0 and 10, write the word blue.
If the number is between 10 and 20, write the word red. If the number is between 20
and 30, write the word green. If it is any other number, write that it is not a correct
colour option.
b. Ask user to enter weight. Program will only display status “You’re obese” if the
weight is more than 100kg.
c. Modify above question. Program will display status based on below condition:
weight >100kg, status= “Obese”
weight < 30kg, status= “Underweight”
others, status = “Normal”
Q2) Find the complexity of the following code
a. for (cnt2 = 0, i = 1; i<=n;i++)
for (j = 1; j <= i; j++)
cnt2++;
b. for (cnt3 = 0, i = 1; i<=n;i*2)
for (j = 1; j <= n; j++)
cnt3++;
c. for (cnt4 = 0, i =1;i<=n;i*=2)
for (j = 1; j <= i; j++)
cnt4++;
d. for (i = 0; i<n;i++)
for (j=0;j<n;j++)
a[i][j] = b[i][j] + c[i][j];
e. for (i = 0; i<n;i++)
for (j = 0; j <j++)
for (k =a[i][j]=0;k<n;k++)
a[i][j] += b[i][k]*c[k][j];
f. for (i = 0; i < n -1;i++)
for (j = i+1;j<n;j++)
{ tmp = a[i][j];
a[i][j] =a[j][i];
a[j][i] = tmp;}
Q3) Solve the following recursive function for count_partitions(6 , 4). Also draw the
Recursion tree.
def count_partitions(n , m)
if n==0
return 1
elif n < 0
return 0
return count_partitions(n-m , m) + count_partitions(n , m-1)
Q4. Solve the Tower of Hanoi by using 4 disks of different radius. Solve manually and also
build the Recursion Tree of the above problem.
Trending now
This is a popular solution!
Step by step
Solved in 4 steps
