- Strength to Increase Rep
- +0
- Strength to Decrease Rep
- -0
- Upvotes Received
- 0
- Posts with Upvotes
- 0
- Upvoting Members
- 0
- Downvotes Received
- 12
- Posts with Downvotes
- 8
- Downvoting Members
- 9
11 Posted Topics
The Interviewer Candidate Problem It is a walk-in-interview setup having an interview room with one chair and a waiting room with a number of chairs. The interviewer interviews candidates in the interview room. When the interviewer finishes interviewing a candidate, he dismisses the candidate and goes to the waiting room …
You have a block of platinum that can be exchanged in your bank either for cash or for smaller blocks of platinum. If you exchange a block of m grams, you get three blocks of weight m/2, m/3 and m/4 grams each. You don't get any fractional part, as the …
can any1 explain me how the values r being stored and how union and intersection is takin place please explain me in detail what is happening in program d program is on union and interscetion of graphs pls help me out i m unable 2 understand d program #include<stdio.h> #include<conio.h> …
can any1 tell me the logic of writing prog for union,intersection and ring sum of a graph and also pls tell me the symbols dat are used in progs
is this is the correct way 2 write destructor of copy constructor and parameterised constructor ~a(int x,float y) ~a(a &a1)
How to find this series without using power function in c 1+x/1!+x2/2!+x3/3!+x4/4! please help me out i'm unable to solve these type of questions
There is error in this program it's not showing the correct output so help me out by modifying it. #include <stdio.h> int power(int n1,int n2); int main() { int base, exp; printf("Enter base number: "); scanf("%d",&base); printf("Enter power number(positive integer): "); scanf("%d",&exp); printf("%d^%d = %d", base, exp, power(base, exp)); return …
How to find this series without using power function in c 1+x/1!+x2/2!+x3/3!+x4/4! please help me out i'm unable to solve these type of questions
i want solution of a c prog using functions ie to find lcm and gcd using functions in same program but to find lcm we will be using formula lcm=(a*b)/gcd; please help me out this is my code if modifiction are to be done then please send me modified code …
can any1 give me flowchart and algorithm for 1) counting positive numbers from a given set 2) gcd and lcm of two numbers 3) smallest positive divisor of an integer other than 1 so from above i would be able to make program on my own
want 2 print the following in c using loop |......| |..c...| |..ch..| |..chm..|
The End.