2022 2023 EduVark > Education Discussion > Question Papers


  #2  
July 15th, 2014, 09:27 AM
Super Moderator
 
Join Date: Mar 2012
Re: Previous year Tech Mahindra placement question papers free download

As you want to get the previous year Tech Mahindra placement question papers so here it is for you:

1. There are total 15 people. 7 speaks French and 8 speaks Spanish 3 do not speak any language.
Which part of total people speaks both languages.
Ans: 1/5
2. A jogger wants to save ?th of his jogging time. He should increase his speed by how much
%age.
Ans: 33.33 %
3. A is an integer. Dividing 89 & 125 gives remainders 4 & 6 respectively. Find a ?
Ans: 17
4. In a office work is distribute between p persons. If 1/8 members are absent then work increased
for each person.
5. 120, 315, 300, 345, ? ---- 390
6. 2,1, 4, 3, 6, 6, 8, 10, 10, ?, ? --- 12, 15
7. A Child is saying numbers 1, 2, 3, 4. When he says 1 Another child puts white marble in a box.
On saying 2 he puts Blue marble and on saying 3 he puts red ma rble. When child says 4 other
child take out white and blue marble. Child says some no. in a sequence then questions are
based on the no. of marbles in the box. Like this
1,1,2,3,1, 4, 1,1,3,2,2,4,111?
a) Find the no. of Blue marble in the box ?..2
b) Find the no. of White --------do----------- ----2
c) No. of red marbles ------- 7
8. Questions based on logical reasoning (R. S. Agrawal)
a) all pens are hens. All hens are doctor.
(I) all pens are doctor.
(II) all doctors are pen.
Ans: Only first conclusion is correct
9. if M person r buying a thing costing D$ each,, if 3 person get away,, how much each person has
to spend so that total expenditure is same ???
10.which is smallest?
a. 1/7
b 1/8
c 2/9
d 3/13 ...or something similar having denominations as 11 and 13 in option "d" and "e"
11.f Rix can collect 45 pieces in 1 min.. and Rax take 1 and half minute for same,, what is time
require d to collect 300 pieces when both working together??
12.One long quiz followed by 5 quest... 3 cages having 3 tags on them, sum of digit of cage num
not to exceed 10, and other cond.
13.A is shorter than B but taller than E, D is tallest, C is just shorter than A, who is shortest or
similar quest...?
14.Rectangular box,, 25*20*2 converted in to cylinder of dia 10... what is height in terms of "pai"

C-Test Paper
1. #include
* What is wrong in the following problem
main() {
int i,j;
j = 10;
i = j++ - j++;
printf("%d %d", i,j);
}ans: 0, 12
2.#include
* What is the output of the following problem
main() {
int j;
for(j=0;j<3;j++)
foo();
}
foo() {
static int i = 10;
i+=10;
printf("%d\n",i);
}
/* Out put is (***since static int is used i value is retained between
* 20 function calls )
* 30
* 40
*/
3.#include
#include
#include
/* This is asked in PCS Bombay walk-in-interview
* What is wrong in the following code
*/
main()
{char *
c;
c = "Hello";
printf("%s\n", c);
}
/*ans:- Hello, The code is successfully running */
4. #include
/* This problem is given in PCS BOMBAY walk-in-interview.
* What is the final value of i and how many times loop is
* Executed ?
*/
main()
{int i,j,k,l,lc=0;
/* the input is given as 1234 567 */
printf("Enter the number string:<1234 567 \n");
scanf("%2d%d%1d",&i,&j,&k);
for(;k;k--,i++)
for(l=0;l
printf("%d %d\n",i,l);}
printf("LOOPS= %d\n", lc-1);
}/* Ans: i
=
16, and loop is executed for 169 times */
5.#include
/* This is given in PCS Bombay walk-in-interview */
/* What is the output of the following program */
main() {
union {
int a;
int b;
int c;
} u,v;
u.a = 10;
u.b = 20;
printf("%d %d \n",u.a,u.b);
}/* Ans :
The latest value assigned to any of the union member
will be present in the union members so answer is
20 20
*/
6.#include
main()
{
float i, j;
scanf("%f %f", &i, &j);
printf("%.2f %.3f", i, j);
}
/Ans:- 123.34 3. 234 */
7.#include
/* This is given in PCS Bombay walk-in-interview
* What is the out put of the following problem ?
*/
main()
{char *
str =
"
12345";
printf("%c %c %c\n", *str, *(str++), *(str++));
}/* Ans: It is not 1
2
3
* But it is 3 2 1 Why ??
*/
8.#include
/* This problem is asked in PCS Bombay Walk-in-interview
* Write a macro statement to find maximum of a,b
*/
#define max(a,b) (ab)?a:b
main()
{int a,b;
a=3;
b=4;
printf("%d",max(a,b));
}/* Ans is very simple the coding is just for testing it
and output is 4 */
~
9.#include
/* This problem is asked in PCS Bombay
* What is the output of the following coding
*/
main()
{int len=4;
char *st="12345678";
st = st -len;
printf("%c\n",*st);
}/* Ans :
It will print some junk value */
~
10.#include
main()
{
func(1);
}
func(int i){
static char *str ={ "One","Two","Three","Four"};
printf("%s\n",str[i++]);
return;
}/* Ans:- it will give warning because str is pointer to the char but
it is initialized with more values
if it is not considered then the answer is Two */
11.
#include
main()
{int i;
for (i=1;i<100; i++)
printf("%d %0x\n",i,i);
}/* Ans:- i
is from 1
to 99 for the first format,
for the second format 1to9, ato f, 10 to 19,1ato1f, 20 to 29, etc */
12.#include
/* This problem is asked in PCS Bombay walk-in-interview
* In the following code please write the syntax for
* assing a value of 10 to field x of s and id_no 101 of s
*/
struct {
int x;
int y;
union {
int id_no;
char *name;
}b;
}s,*st;
main()
{s
t = &s;
st-x=10;
st-b.id_no = 101;
printf("%d %d\n",s..x,s.b.id_no);
}/* Ans: The answer is st-x=10;
* st-b.id_no=101;
*/
13.#include
/* This problem was asked in PCS Bombay in a walk-in-interview
* Write a recursive function that calculates
* n * (n-1) * (n-2) * ....... 2 * 1
*/
main() {
int factorial(int n);
int i,ans;
printf("\n Enter a Number:");
scanf("%d",&i);
ans = factorial(i);
printf("\nFactorial by recursion = %d\n", ans);
}int factorial(int n)
{if (
n
<= 1) return (
1);
else
return ( n * factorial(n-1));
}
~
14.#include
/* This problem is asked in PCS Bombay walk-in-interview
* What is the output of the following problem
*/
main(){
int j,ans;
j = 4;
ans = count(4);
printf("%d\n",ans);
}int count(int i)
{if (
i
<
0) return(i);
else
return( count(i-2) + count(i-1));
}
/* It is showing -18 as an answer */
15.#include
main()
{int i=4;
if(i=0)
printf("statement 1");
else
printf("statement 2");
}/* statement 2 */
This is pcsb paper.
1. #include
* What is wrong in the following problem
main() {
int i,j;
j = 10;
i = j++ - j++;
printf("%d %d", i,j);
}ans: 0, 12
2.#include
* What is the output of the following problem
main() {
int j;
for(j=0;j<3;j++)
foo();
}
foo() {
static int i = 10;
i+=10;
printf("%d\n",i);
}
/* Out put is (***since static int is used i value is retained between
* 20 function calls )
* 30
* 40
*/
3.#include
#include
#include
/* This is asked in PCS Bombay walk-in-interview
* What is wrong in the following code
*/
main()
{char *
c;
c = "Hello";
printf("%s\n", c);
}/*ans:- Hello, The code is successfully running */
4. #include
/* This problem is given in PCS BOMBAY walk-in-interview.
* What is the final value of i and how many times loop is
* Executed ?
*/
main()
{int i,j,k,l,lc=0;
/* the input is given as 1234 567 */
printf("Enter the number string:<1234 567 \n");
scanf("%2d%d%1d",&i,&j,&k);
for(;k;k--,i++)
for(l=0;l
printf("%d %d\n",i,l);}
printf("LOOPS= %d\n", lc-1);
}/* Ans: i
=
16, and loop is executed for 169 times */
5.#include
/* This is given in PCS Bombay walk-in-interview */
/* What is the output of the following program */
main() {
union {
int a;
int b;
int c;
} u,v;
u.a = 10;
u.b = 20;
printf("%d %d \n",u.a,u.b);
}/* Ans :
The latest value assigned to any of the union member
will be present in the union members so answer is
20 20
*/
6.#include
main()
{
float i, j;
scanf("%f %f", &i, &j);
printf("%.2f %.3f", i, j);
}
/Ans:- 123.34 3. 234 */
7.#include
/* This is given in PCS Bombay walk-in-interview
* What is the out put of the following problem ?
*/
main()
{char *
str =
"
12345";
printf("%c %c %c\n", *str, *(str++), *(str++));
}/* Ans: It is not 1
2
3
* But it is 3 2 1 Why ??
*/
8.#include
/* This problem is asked in PCS Bombay Walk-in-interview
* Write a macro statement to find maximum of a,b
*/
#define max(a,b) (ab)?a:b
main()
{int a,b;
a=3;
b=4;
printf("%d",max(a,b));
}/* Ans is very simple the coding is just for testing it
and output is 4 */
~
9.#include
/* This problem is asked in PCS Bombay
* What is the output of the following coding
*/
main()
{int len=4;
char *st="12345678";
for(i=0; i<6; i++)
st = st -len;
printf("%c\n",*st);
}/* Ans :
It will print some junk value */
~
10.#include
main()
{
func(1);
}
func(int i){
static char *str ={ "One","Two","Three","Four"};
printf("%s\n",str[i++]);
return;
}/* Ans:- it will give warning because str is pointer to the char but
it is initialized with more values
if it is not considered then the answer is Two */
11.
#include
main()
{int i;
for (i=1;i<100; i++)
printf("%d %0x\n",i,i);
}/* Ans:- i
is from 1
to 99 for the first format,
for the second format 1to9, ato f, 10 to 19,1ato1f, 20 to 29, etc */
12.#include
/* This problem is asked in PCS Bombay walk-in-interview
* In the following code please write the syntax for
* assing a value of 10 to field x of s and id_no 101 of s
*/
struct {
int x;
int y;
union {
int id_no;
char *name;
}b;
}s,*st;
main()
{s
t = &s;
st-x=10;
st-b.id_no = 101;
printf("%d %d\n",s.x,s.b.id_no);
}/* Ans: The answer is st-x=10;
* st-b.id_no=101;
*/
13.#include
/* This problem was asked in PCS Bombay in a walk-in-interview
* Write a recursive function that calculates
* n * (n-1) * (n-2) * ....... 2 * 1
*/
main() {
int factorial(int n);
int i,ans;
printf("\n Enter a Number:");
scanf("%d",&i);
ans = factorial(i);
printf("\nFactorial by recursion = %d\n", ans);
}int factorial(int n)
{if (
n
<= 1) return (
1);
else
return ( n * factorial(n-1));
}
~
14.#include
/* This problem is asked in PCS Bombay walk-in-interview
* What is the output of the following problem
*/
main(){
int j,ans;
j = 4;
ans = count(4);
printf("%d\n",ans);
}int count(int i)
{if (
i
<
0) return(i);
else
return( count(i-2) + count(i-1));
}
/* It is showing -18 as an answer */
15.#include
main()
{int i=4;
if(i=0)
printf("statement 1");
else
printf("statement 2");
}/* statement 2
*/


Quick Reply
Your Username: Click here to log in

Message:
Options



All times are GMT +5.5. The time now is 02:42 PM.


Powered by vBulletin® Version 3.8.7
Copyright ©2000 - 2022, vBulletin Solutions, Inc.
Content Relevant URLs by vBSEO 3.6.0

1 2 3 4 5 6 7 8