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!
C Program to check FACTORIAL
main()
{
int i,j,m,fact,sum=0;
clrscr();
printf("ENTER THE NO.: ");
scanf("%d",&m);
for(i=1;i<=m;i++)
fact=1;
for(j=1;j<=i;j++)
fact=fact*j;
}
printf(" %d * ",i);
sum=sum+fact;
printf(" = %d",sum);
getch();
OUTPUT :
ENTER NO: 5
1 * 2 * 3 * 4 * 5 * = 120
Create a program WordCount1Main.java doing the following: For each word in the le word.txt { Create an object of the class Word { Add the object to a set of the type java.uti
write a prgm to find minimum total number of shelves including the intial one required for loading process
implement two stacks in one array A[1...n] in such a way that neither stack overflows unless the total number of elements in both stacks together is n. For this you need to produce
Question 1 Write a program in ‘C' to check whether a given number is even or odd Question 2 Explain while and do... while loop with an example Question 3 Write a program
There are ''''n'''' ants on a ''''n+1'''' length rod. The ants are numbered from 1 to n and are initially placed at positions starting from position 1 till position n. They are mov
sir,why we use virtual function
Default assignment operator mange assigning one object to another object of the same class. It is member to member copy as shallow copy.
Write an algorithm to compute sin x in pseudocode
color representation 0,1,2,3,4,5,6,7,.......
After p = new Fred[n], how does the compiler know about n objects to be destructed throughout delete[] p? A: The run-time system hold the number of objects, n, somewhere where
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