.
  Vyom World.com . Let's Touch the Sky Together!  
.

Home
VyomWorld.com Home
Interview Questions
VyomLinks.com Home
JobsAssist.com Home
Vyom Network
Contact Us
Jobs & Careers
Resume Submitter
Placement Papers
IT Companies Directory
Computer Jobs
Interview Questions
Online Exams
Vyom Career eMag.
Fun
Send FREE SMS!
SMS Jokes
Source Codes Library
Source Codes Home
ASP Source Codes
C Source Codes
C++ Source Codes
COBOL Source Codes
Java Source Codes
Pascal Source Codes
Submit Source Codes
GATE
GATE an Overview
GATE Preparation
Study Materal
GRE
GRE an Overview
GRE Questions
GRE Preparation
GRE Universities
TOEFL Preparation
TOEFL Resources
GMAT Preparation
GMAT Resources
MBA Preparation
MBA Resources
Networking Concepts
Networking Concepts
Testing Preparation
Testing Resources
Webmasters
Free Traffic Builder
Webmaster Articles
Web Hosting
Tutorials
Hardware Tutorial
1500 Free eBooks New!
Get 30,000 Interview Questions & Answers in an eBook.

Interview Success Kit - Get Success in Job Interviews





Interview Success Kit - Get Success in Job Interviews Interview Success Kit - 30,000 Interview Que. & Ans.
Home » Placement Papers » MBT Placement Papers »MBT Placement Papers

New Click here to Download 2017 Latest placement papers of this company New

 

MBT Placement Paper


Advertisements
Advertisements


M.B.T:paper pattern only


Section-1. Passage (10 min reading ,5 questions)

Section-2. English (error finding,15 questions)

Section-3. Number series (Letter series also)

Section-4. Analytical ability (5 questions)

Section-5 Numerical ability (additions,multiplications etc)

note: -marking 1:1



Analytical. 1.seating arrangement

2.Inferences

(Ref. GRE book)

C-language. 48 questions - 45 min.


1. Diff.between inlinefunction((++)-macns(c)

2. 3 to 4 questions on conditional operator :?:

3. Write a macro for sqaring no.

4. Trees -3 noded tree ( 4 to 5 questions fundamentals)

Maximum possible no.of arrnging these nodes

5. Arrange the nodes in depth first order

breadth first order

6. Linked lists Q) Given two statments

1. Allocating memory dynamiccaly

2. Arrays

Tree the above both and find the mistake

7. Pointers (7 to 8 questions) Schaum series

Pointer to functions, to arrays

4 statements ->meaning,syntax for another 4 statements

8. Booting-def(When you on the system the process that takes place is ------

9. -----Type of global variable can be accessible from any where in the 

working environment ( external global variable)

10. Which of the following can be accessed randomly

Ans. a. one way linked list

b. two way "

c. Arrays

d. Trees

11. Write a class for a cycle purchase(data items req.)



MBT Paper

one to one negative marking is there.it is tough to qualify unless u 
know the paper.totally there are 105 questions. 70 min.
three flow sheets------ 10 min.
sections are quantitative(23),analytical(about 20) ,series&venn 
diagrams,logical(20) questions from a passage (about 10). time span for 
each section is different.sit at the back so that u can turn pages if u 
want.different colored papers
are used.
for flow sheets
first one is relatively easy
1.u will be given conditions like
if a wins he gets 100 pts,if b wins he gets 50 pts etc
2.there is flow sheet& there are empty cells(4) at "yes' or 'no" 
decision points.
3.for each cell 4 choices will be given which should be chosen by 
following through initial conditions &flow sheet logic.
4.rem. -ve marking is there.
no verbal questions.

rs aggarwals verbal& nonverbal book
verbal---
pg. 254 pr. 53 to56(almost same)
246 eg.2
pg 104 exer.3a about 5to 6 series qu.are there.so do well
pg.354-355 8,13,
6th doubt
4 conclusions r there in all ques.
pg.115----qu.36
nonverbal----pg.5
41,54,108,145,158
241 is doubtful
---------------
ans. to one quant. is 200/3 %

anals
1.six persons will be there.
killer,victim,hangman,judge,police,vitness
a,b, c,d,e,f 
u have to match
conditions like,a is the last person to the victim alive,will be given 
as
clues.so we can conclude that a is the killer.
this is an easy one .paragraph will be very big .don' worry
5 to 6 ques.
2.
5 persons will be there.
cashier, clerk,buyer,manager,floorwalker(check in info. paper for exact
ques.)
a,b,c,d,e will be their names.
conditions will be given&we have to match who is who
3 r women&2 r men in this
sample condition,
cashier&clerk if get married, b will be wise man
mrs.c husband has some business prob with manager
manager&cashier(or clerk) r classmates
etc. will be given

do quantitative qu. from back.

data graphs on turnover,gross profit &net profit will be given&
u have to extract data from that &find out few ratios.(easy one)



1. #include <stdio.h
* 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 <stdio.h
* 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 <stdio.h
#include <stdio.h
#include <string.h
/* 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 <stdio.h
/* 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<j;l++) { lc++;
printf("%d %d\n",i,l);}
printf("LOOPS= %d\n", lc-1);
}
/* Ans: i = 16, and loop is executed for 169 times */

5.#include <stdio.h
/* 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 <stdio.h
main()
{
float i, j;
scanf("%f %f", &i, &j);
printf("%.2f %.3f", i, j);
}

/Ans:- 123.34 3. 234 */

7.#include <stdio.h
/* 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 <stdio.h
/* 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 <stdio.h
/* 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 <stdio.h
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 <stdio.h
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 <stdio.h
/* 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()
{
st = &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 <stdio.h
/* 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 <stdio.h
/* 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<stdio.h
main()
{
int i=4;
if(i=0)
printf("statement 1");
else
printf("statement 2");
}
/* statement 2 */


This is pcsb paper.

1. #include <stdio.h
* 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 <stdio.h
* 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 <stdio.h
#include <stdio.h
#include <string.h
/* 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 <stdio.h
/* 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<j;l++) { lc++;
printf("%d %d\n",i,l);}
printf("LOOPS= %d\n", lc-1);
}
/* Ans: i = 16, and loop is executed for 169 times */

5.#include <stdio.h
/* 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 <stdio.h
main()
{
float i, j;
scanf("%f %f", &i, &j);
printf("%.2f %.3f", i, j);
}

/Ans:- 123.34 3. 234 */

7.#include <stdio.h
/* 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 <stdio.h
/* 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 <stdio.h
/* 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 <stdio.h
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 <stdio.h
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 <stdio.h
/* 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()
{
st = &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 <stdio.h
/* 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 <stdio.h
/* 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<stdio.h
main()
{
int i=4;
if(i=0)
printf("statement 1");
else
printf("statement 2");
}
/* statement 2 */


This is pcs pune.

1. Men in the order type - Eswar Rao
2. Optional
3. Latter
4. Cease

5. There r 3 boys 7 4 girls; Howmany ways they r arranged
such that boys should be always together ???

(Ans: 240

6. If n.....; What is the max no that divides

(Ans: 8)

7. A,B,C,D has values from 0 to 9.... What is D ?

(Ans: 6)

8. A wodden piece taken which is in shape of Triangle ,
of 10 X 24 X 26 ; Then cut at some ..... which is rearranged
in rectangle format; so what is ...

(Ans: 5)

9. There r 5 numbers. The average is 25; the highest value
excluded then average is 25, if the lowest is excluded the avg is ..
Then average of remaining is ?

(Ans: 30)

10. The square is cut such that the end point of one side is
shown in fig.. This is repeated two times, what is the area ??

(Ans: 3.61)

11. The route problem... what is the shortest rout to p1 to p2...
(There may be circle figure......)

(Ans: From p1 to 0 & form 0 to p8)

12. Two motor cycles A & B are started from one point at
4 Kmph & 6 Kmph; After 45 min B starts returning , at what
time they will reach....

(Ans: 3.6 km)

13. All integer from 0 to 9, what is the smallest no perfectly devides;

(Ans: c)

14. Some figure (Triangle in a rectangle)..... What is perimeter 
if triangle

(Ans: 20)



appeared mbt walkin in pune on 19th
the test was aptitude: 55 min,, (68 quest)
(6 section, 
[section][time][no of quest][type]
1 10 15 small logical/mathematical quiz (most of from old paper
2 10 10 numerical series completeion and visual seies completion[3 quest repeated from old papers[
3 10 16 [mix type quest,, such as reasoning (eg all A r B, all B r C so all A r C ,,some C r A etccc..,, one quiz followed by 4 quest] 
4 10 9 [2 flow chart: means,, one puzzle was described as steps of flow chart, and condition was also given,, in flow chart some fields were having ? ,, u have to select appropriate option from the given option to place instead of ? ,so that logic is correct...
2nd flow chart was very easy(4 quest),, while in 1st first 3 were easy rest 2 were not hard, but very time consuming,, so i skipped last 2 of them and attended 2nd flow chart...]
5 10 8 [RC, really tough,, 5 minute to read longgg (with lot of data of course)the rc and remember whatever u can,, followed by 9/8 quest in 5 minutes,, u r not allowed to see rc again,,,i was able to attend only one in this section...
6 5 10 [data sufficency,, very easy and scoring section,but only 5 moniutes to answer 10 quest...]

no section cut off
only overall cut off
strictly 1:1 -ve marking...
shortlisted candidates will be informed by email within 10 days for HR & Technical Int...
test was only for BE (CSE,IT ,IS) and BSc(maths, chemi, physics,,, and one other discipline) ,No EC,ECT, or MCA,,,,
60% or more aggregate at ssc,hsc and BE, should be cleared on 1st attempt..

some of quest I remember:
1. 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 ???

2. which is smaleest?
a. 1/7
b 1/8
c 2/9
d 3/13 ...or something similar having denom. as 11 and 13 in option "d" and "e"

3. if Rix can collect 45 pieces in 1 min.. and Rax take 1 and half minute for same,, what is time require d to colloect 300 pieces when both working togetthre??
4. 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...
5. one quest of grandfather-father-son type quest..
6. A is shortr than B but taller than E, D is tallest, C is just shorter than A, who is shorttest or similar quest...?
7. rectangualr box,, 25*20*2 converted in to cylinder of dia 10... what is height in terms of "pai"

section 2: series...
1. find the numer for ? 
2. find the numer for ?
3 1,3,4,8,15,27,? 
4. 2,5,9,19,37,?
5. these were reapeat from old quest...

section 3. 
simple reasoning,4-5 quest.
1 quest followed by 3 quest.
1 quest followed by 3/4 quest. 
other quiz...

section 4. 2flowchart .. 2nd was, A & B drawing ball. 2 ball Red & yellow,, if red is the drawen ball 100 points r awaredrd,otherwise 200 points awareded... if A or B score 500,, their points r forfieted,, 
if A or B score 1000 or more, he is winner...

four quest based on this puzzle, given as missing ? in flowchart

section 5. RC related to turnover of companies etc...(8 quest)
section 6 data sufficiency 
1. whether n is odd?
a. m+5n is odd
b. 2m+9n is odd
these quest were easy, but u required speed to attend all



New Click here to Download 2017 Latest placement papers of this company New




 


.

Recently Updated: New Placement Papers added.
Vyom Network : Web Hosting | Dedicated Server | Free SMS, GRE, GMAT, MBA | Online Exams | Freshers Jobs | Software Downloads | Programming & Source Codes | GRE Preparation | Jobs, Discussions | Software Listing | Free eBooks | Free eBooks | Free Business Info | Interview Questions | Free Tutorials | International Business Information | IAS Preparation | Jokes, Songs, Fun | Free Classifieds | Free Recipes | FAQs | Free Downloads | Bangalore Info | Tech Solutions | Project Outsourcing, Web Hosting | GATE Preparation | MBA Preparation | SAP Info | Excellent Mobiles | Software Testing | Interview Questions | Freshers Jobs | Server Insiders | File Extension Directory

Copyright ©2003-2017 Vyom Technosoft Pvt. Ltd., All Rights Reserved. Read our Privacy Policy