Algorithms Answers

Design an algorithm to solve the problem using pseudocode:

(Print a table) Write a program that displays the following table:

p p*5 p*10

5 25 50

10 50 100

25 125 250

50 250 500

Design an algorithm to solve the problem using Pseudocode:

(Display two messages) Write a program that displays Introduction to Programs and Welcome to Computer Fundamentals and Programming. 

(Sum the digits in an integer) Write a program that reads an integer between 0 and 1000 and adds all the digits in the integer. For example, if an integer is 932, the sum of all its digits is 14. 

Hint: Use the % operator to extract digits, and use the / operator to remove the extracted digit. For instance, 932 % 10 = 2 and 932 / 10 = 93. 

(Convert pounds into kilograms) Write a program that converts pounds into kilograms. The program prompts the user to enter a number in pounds, converts it to kilograms, and displays the result. One pound is 0.454 kilograms.

Compute the volume of a cylinder) Write a program that reads in the radius and length of a cylinder and computes the area and volume using the following formulas:

area = radius * radius * π

volume = area * length

write an algorithm to read 100 numbers then display the largest

you have to make a data structure for Binary Tree.

You should have at least these three data types in your class of Node, left child

pointer and right child pointer and data.

You will have to make a function that adds a number in its correct location. User will decide where to enter the data, so your program should ask whether to move towards right child or left child

An instructor calculates the grade percentage based on the highest score on a test.

Given the highest score and one student’s score, write a solution to calculate and

print that student’s test percentage.

Represent the following expression by means of binary tree :

a*c/d+(R-5^a*d)/2*x -(-d) 

a. Describe the concept of a Binary heap and the heap order property. [10 marks]

b. Explain the use of the binary heap as an effective implementation for a priority queue [10 MARKS]