| 1. |
Given number in& Write pseudo code to count occurrence of a given number inthe list for example, consider the following list, if user enters 5 then-536 8 15display"2 times"because "5" occurs 2 times in the list. |
|
Answer» Answer: How to write a Pseudo-code?Arrange the sequence of TASKS and write the pseudocode accordingly. Start with the statement of a pseudo code which establishes the MAIN goal or the aim. Example: This program will allow the user to check the number whether it's even or odd. The way the if-else, for, while loops are indented in a program, INDENT the statements likewise, as it helps to comprehend the decision control and execution mechanism. They also improve the readability to a great extent. Example: if "1" print response "I am case 1" if "2" print response "I am case 2" Use appropriate naming conventions. The human tendency follows the approach to follow what we see. If a programmer GOES through a pseudo code, his approach will be the same as per it, so the naming must be simple and distinct. Use appropriate sentence casings, such as CamelCase for methods, upper case for constants and lower case for variables. Elaborate everything which is going to happen in the ACTUAL code. Don’t make the pseudo code abstract. Use standard programming structures such as ‘if-then’, ‘for’, ‘while’, ‘cases’ the way we use it in programming. Check whether all the sections of a pseudo code is complete, finite and clear to understand and comprehend. Don’t write the pseudo code in a complete programmatic manner. It is necessary to be simple to understand even for a layman or client, hence don’t incorporate too many technical terms. Dos and Don'ts in Pseudo Code Writing Example: Let’s have a look at this code // This program calculates the Lowest Common multiple // for excessively long input values
import java.util.*;
public class LowestCommonMultiple {
private static long lcmNaive(long numberOne, long numberTwo) {
long lowestCommonMultiple;
lowestCommonMultiple = (numberOne * numberTwo) / greatestCommonDivisor(numberOne, numberTwo);
return lowestCommonMultiple; }
private static long greatestCommonDivisor(long numberOne, long numberTwo) {
if (numberTwo == 0) return numberOne;
return greatestCommonDivisor(numberTwo, numberOne % numberTwo); } public static void main(String args[]) {
Scanner scanner = new Scanner(System.in); System.out.println("Enter the inputs"); long numberOne = scanner.nextInt(); long numberTwo = scanner.nextInt();
System.out.println(lcmNaive(numberOne, numberTwo)); } } |
|