#include<stdio.h>
#include<conio.h>
#include<math.h>
void main()
{
int r,d,t,code;
printf("enter your code 1 for rupees to dollar\n 2 for dollar to rupee");
scanf("%d",&code);
if(code==1)
{
printf("enter your amount");
scanf("%d",&r); d=r/(45);
printf("you have dollar %d",d);
}
elseif (code==2) { printf("enter your amount");
scanf("%d",&d); r=d*(45);
printf("you have rupees %d",r);
}
else printf("invalid code");
getch();
}
algorithm to convert a number representing radix r1 to radix r2
hisince1 pound = 0.45359237 kilogramssoweight_in_kilo = weight_in_pounds * 0.45359237
Here is the algorithm of the algorithm to write an algorithm to access a pointer in a variable. Algorithmically.name_of_the_structure dot name_of_the _field,eg:mystruct.pointerfield
Black and White bakery algorithm is more efficient.
You can't convert an algorithm into code. That is the job of the programmer, not the language. Algorithm's are expressed in plain-English and typically use pseudocode to broadly demonstrate the implementation of the algorithm. However, it is the programmer's job to convert these algorithms into working code. Pseudocode isn't a programming language as such, but it uses structures and statements that are familiar to any programmer and can be easily translated into any language. However, pseudocode is not a standard so there are many different ways to present pseudocode to the programmer. Moreover, pseudocode is generalised and is far too generic to be converted directly into any one language, never mind C++, which can take advantage of the underlying hardware to produce more efficient algorithms than would otherwise be implied by the pseudocode alone. Hence the need for plain-English algorithms in conjunction with the pseudocode. Programmer's can process all this information far more easily than any computer can. Even if you could program a converter for one algorithm, there's no guarantee it would work for any other algorithm. The time spent programming an algorithm converter would be far better spent simply translating the algorithm yourself.
algorithm to convert a number representing radix r1 to radix r2
First we shall convert Rs.1.50 & Rs.20 into paisa = Rs.1.50 = 150 Paisa & Rs.20 = 2000 Paisa Now, We shall find H.C.F. of 150 & 2000 H.C.F. of 150 & 2000 is 50 Therefore, the least number of days in which the boy will convert his saving into Rs.20 => 2000 divided by 50 is 40 days .
by recharging with Rs 2/-
by recharging with Rs 2/-
Linear search(a,item) n=length(a) for i=1 to n do if(a[i]==item) then return i end for return -1
It's 3.16 RS only
tht's one lakh crores Rs @ 50 rs to the dollar
An algorithm can not be written with the following infix expression without knowing what the expression is. Once this information is included a person will be able to know how to write the algorithm.
hisince1 pound = 0.45359237 kilogramssoweight_in_kilo = weight_in_pounds * 0.45359237
To convert 254 Rs into lakhs, you need to know that 1 lakh is equal to 100,000 Rs. Therefore, to express 254 Rs in lakhs, you divide 254 by 100,000, which gives you 0.00254 lakhs. In numerical form, it is written as 0.00254 lakh.
burat na flow chart
Develop an algorithm to display all prime numbers from 2 to 100. Give both the pseudocode version and the flowchart version. Convert your pseudocode into a Java program.