5. Algorithm We have not studied arrays or strings yet, so you are not allowed to...

Transcribed Image Text:

5. Algorithm We have not studied arrays or strings yet, so you are not allowed to use them to develop you algorithm. Only use primitive math operations to develop following four algorithms. 5.1) Develop an algorithm in pseudo code to find out a reverse of a positive integer number. example if the number is equal to 12345, then its reverse is 54321. 5.2) Develop an algorithm in pseudo code to find out sum of digits of a positive integer numb For example if the number is equal to 12345, then its sum of digits is equal to 1+2+3+4+5 = 5.3) Develop an algorithm in pseudo code to find out number of digits of a given positive inte number. For example if number is equal to 9856, then it returns 4 since the number has four digits. 5.4) Develop an algorithm in pseudo code to right-rotate a positive integer number. For exan if number is equal to 1234, then its right-rotated number is equal to 4123. 6. method: Note: We have not studied arrays or strings yet, so do not use them to implement following programs. Only use primitive math operations and whatever covered up to here in this course. 6.1) (Sum the digits in an integer) Write a Java method that computes the sum of the digits of an integer number and return is sum. Use the following method header: 5. Algorithm We have not studied arrays or strings yet, so you are not allowed to use them to develop you algorithm. Only use primitive math operations to develop following four algorithms. 5.1) Develop an algorithm in pseudo code to find out a reverse of a positive integer number. example if the number is equal to 12345, then its reverse is 54321. 5.2) Develop an algorithm in pseudo code to find out sum of digits of a positive integer numb For example if the number is equal to 12345, then its sum of digits is equal to 1+2+3+4+5 = 5.3) Develop an algorithm in pseudo code to find out number of digits of a given positive inte number. For example if number is equal to 9856, then it returns 4 since the number has four digits. 5.4) Develop an algorithm in pseudo code to right-rotate a positive integer number. For exan if number is equal to 1234, then its right-rotated number is equal to 4123. 6. method: Note: We have not studied arrays or strings yet, so do not use them to implement following programs. Only use primitive math operations and whatever covered up to here in this course. 6.1) (Sum the digits in an integer) Write a Java method that computes the sum of the digits of an integer number and return is sum. Use the following method header: 5. Algorithm We have not studied arrays or strings yet, so you are not allowed to use them to develop you algorithm. Only use primitive math operations to develop following four algorithms. 5.1) Develop an algorithm in pseudo code to find out a reverse of a positive integer number. example if the number is equal to 12345, then its reverse is 54321. 5.2) Develop an algorithm in pseudo code to find out sum of digits of a positive integer numb For example if the number is equal to 12345, then its sum of digits is equal to 1+2+3+4+5 = 5.3) Develop an algorithm in pseudo code to find out number of digits of a given positive inte number. For example if number is equal to 9856, then it returns 4 since the number has four digits. 5.4) Develop an algorithm in pseudo code to right-rotate a positive integer number. For exan if number is equal to 1234, then its right-rotated number is equal to 4123. 6. method: Note: We have not studied arrays or strings yet, so do not use them to implement following programs. Only use primitive math operations and whatever covered up to here in this course. 6.1) (Sum the digits in an integer) Write a Java method that computes the sum of the digits of an integer number and return is sum. Use the following method header: