Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
W.A.S.S to check whether a given number is Armstrong number or not.
Program
# W.A.S.S to check that whether a given number is prime or not.
echo "Enter the Number:"
read num
tnum=$num
temp=0
sum=0
while test $num -gt 0 #while loop
do
temp=`expr $num % 10` #extract the digit by digit
temp=`echo $temp^3 | bc` #make the cube of digit using bc - An arbitrary
#precision calculator
sum=`expr $sum + $temp` #calculate sum of cube of all the digit
num=`expr $num / 10`
done
if test $sum -eq $tnum #if the sum of cube of all the digit of given no is same as no
then
echo "Entered no $tnum is Armstrong number"
else
echo "Entered no $tnum is Not an armstrong number"
fi
Output
Enter the Number:
151
Entered no 151 is Not an armstrong number
153
Entered no 153 is Armstrong number
Programming Project Specification: IRC or Internet Relay Chat is an application that lets multiple users communicate via text messages with each other in common "virtual" rooms.
Write a function readPDBfile('filename') that will read the atoms for a protein stored in a PDB file, whose name is provided as an input to the function (note that this name should
basic steps involved in spreadsheet developement
Define Call by value - Computer Programming? Functions are raise by writing their name and an appropriate list of arguments within parenthesis. Usually these arguments are in t
Translate the following formula into a prefix form expression in Scheme: Question 2 Define a procedure that takes three numbers as arguments and returns the sum of the squ
Use recursion to dene a function position which has as input an integer, a character and a string and returns the result of inserting the character in the string at the position s
Your task is to write an application to analyse texts in a file. Your application will employ several kinds of text-analyser objects (which you also have to implement) as descri
A non-empty string β is called a repeat pre x of a string s if ββ is a pre x of s. Give a linear time algorithm to find the longest repeat prefix of s. Hint: Think of using lca
Example : Solve the following differential equation. y (3) - 12 y''+48 y' + 64 y = 12 - 32 e -8t + 2 e 4t Solution : We first require the complementary solution
need a program of any multiplication algorithm implemented in assembly language x86 without using mul command
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd