#include <stdio.h>
int main()
{
int first, second, *p, *q, sum;
printf("Enter two integers to add\n");
scanf("%d%d", &first, &second);
p = &first;
q = &second;
sum = *p + *q;
printf("Sum of entered numbers = %d\n",sum);
return 0;
}
Come grab your articles on C.. I am a budding engineering grad trying to survive in the world of engineering.. i would love it if you all gave me important topics to cover so that i write in good code and give them to you too!
Showing posts with label interview. Show all posts
Showing posts with label interview. Show all posts
Thursday, 24 December 2015
Pascal's Triangle in C programming
1
1 1
1 2 1
1 3 3 1
#include <stdio.h>
long factorial(int);
int main()
{
int i, n, c;
printf("Enter the number of rows you wish to see in pascal triangle\n");
scanf("%d",&n);
for (i = 0; i < n; i++)
{
for (c = 0; c <= (n - i - 2); c++)
printf(" ");
for (c = 0 ; c <= i; c++)
printf("%ld ",factorial(i)/(factorial(c)*factorial(i-c)));
printf("\n");
}
return 0;
}
long factorial(int n)
{
int c;
long result = 1;
for (c = 1; c <= n; c++)
result = result*c;
return result;
}
1 1
1 2 1
1 3 3 1
#include <stdio.h>
long factorial(int);
int main()
{
int i, n, c;
printf("Enter the number of rows you wish to see in pascal triangle\n");
scanf("%d",&n);
for (i = 0; i < n; i++)
{
for (c = 0; c <= (n - i - 2); c++)
printf(" ");
for (c = 0 ; c <= i; c++)
printf("%ld ",factorial(i)/(factorial(c)*factorial(i-c)));
printf("\n");
}
return 0;
}
long factorial(int n)
{
int c;
long result = 1;
for (c = 1; c <= n; c++)
result = result*c;
return result;
}
Floyd's Triangle in C programming
1
2 3
4 5 6
7 8 9 10
2 3
4 5 6
7 8 9 10
#include <stdio.h>
int main()
{
int n, i, c, a = 1;
printf("Enter the number of rows of Floyd's triangle to print\n");
scanf("%d", &n);
for (i = 1; i <= n; i++)
{
for (c = 1; c <= i; c++)
{
printf("%d ",a);
a++;
}
printf("\n");
}
return 0;
}
Fibonacci Series in C programming
#include<stdio.h>
int main()
{
int n, first = 0, second = 1, next, c;
printf("Enter the number of terms\n");
scanf("%d",&n);
printf("First %d terms of Fibonacci series are :-\n",n);
for ( c = 0 ; c < n ; c++ )
{
if ( c <= 1 )
next = c;
else
{
next = first + second;
first = second;
second = next;
}
printf("%d\n",next);
}
return 0;
}
Diamond Pattern in C
*
***
*****
***
*
#include <stdio.h>
int main()
{
int n, c, k, space = 1;
printf("Enter number of rows\n");
scanf("%d", &n);
space = n - 1;
for (k = 1; k <= n; k++)
{
for (c = 1; c <= space; c++)
printf(" ");
space--;
for (c = 1; c <= 2*k-1; c++)
printf("*");
printf("\n");
}
space = 1;
for (k = 1; k <= n - 1; k++)
{
for (c = 1; c <= space; c++)
printf(" ");
space++;
for (c = 1 ; c <= 2*(n-k)-1; c++)
printf("*");
printf("\n");
}
return 0;
}
Reverse A Number in C programming
#include <stdio.h>
int main()
{
int n, reverse = 0;
printf("Enter a number to reverse\n");
scanf("%d", &n);
while (n != 0)
{
reverse = reverse * 10;
reverse = reverse + n%10;
n = n/10;
}
printf("Reverse of entered number is = %d\n", reverse);
return 0;
}
C program Factorial
#include <stdio.h>
int main()
{
int c, n, fact = 1;
printf("Enter a number to calculate it's factorial\n");
scanf("%d", &n);
for (c = 1; c <= n; c++)
fact = fact * c;
printf("Factorial of %d = %d\n", n, fact);
return 0;
}
Sunday, 20 December 2015
Mindtree Interview Experience
My experience in the mindtree Programming test!
We had gone in to a college where students from different colleges had come.
We had to choose any one of three different programming languages being C,C++, and Java.
I went with my strength and chose C.
The two programs that were given to me were.
1. To implement a function that will take two numbers num1 and num2 where num1 is single digit number and num2 can be assumed to be a larger one. We need to count the number of occurences of num1 in num2.
My logic was pretty simple for this program.
getnumber(int num1,int num2)
{
int rem,a;
while(num2<0)
{
rem=num2%10;
if(num1==rem)
{
a++;
}
num2=num2/10;
}
return(a);
}
2. The second question was a pattern based question. The pattern was :-
Given that N=4
The desired pattern would be:
1*2*3*4
9*10*11*12
13*14*15*16
5*6*7*8
This was kinda tricky for me. I have been trying to crack it but i am open to solutions for this one.
Subscribe to:
Posts (Atom)