.
  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 » Ramco Placement Papers »Ramco Placement Paper 5

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

 

Ramco Placement Paper 5


Advertisements
Advertisements





Ramco -Aptitude

Note :Questions are not in order from 1 to 20 ( In original Qsn paper Qsn nos are different)
---------------------------------------------------------
1) 10^2 is how many times ( 0.1)^4 Ans: 10^6
2) 5*6*8*12*35*36 what is the result? Ans: 3628800
3)X*Y is defined as X+Y/Y then (2*3)*4 ? Ans : 17/12
4)Direction sum Ans: towards west
5)A is 25 years greater than B. A is as much as 2 and B is less than 34.Then Bs age is ? My Ans is : 31
6)For first 60 bags,each bag prices X rs.For additional bags with 60,each bag gets 5% discount .Then how much does 150 bags price? Ans: none of the above
7)Two discounts in series 20%,15%,then in single discount ? Ans :32%
8)Two nos are in ratio 5:6 .Their product is 3000.Which one is larger ? Ans :60
9)Total amount is 60.50. A is 5/3 of B, B is 1 of C.
From this,4 stmts followed and which one is true ?
Tips: A=30.25 =18.15 C=12.10 ( Ive calculated ,not presented in Qsn paper,using this u can easily findout the answer) 
10) 0.05 is greater than ? Ans: 0.01
11) 7/15,2/19,40/11 which ratio is larger ? Ans :Ist choice ( 7/15 )
12)I donno the qsn but Ive marked as 87 :56
13)16 + 22 = ? Ans : 42
8 10
14) -10+0.5 which of the following integer is greater than the result? Ans : 9

Qsns following are related to comparison of two statements and ull ve to mark 
A if stmt ( I ) is > stmt ( II )
B if stmt ( II ) is > stmt ( I )
C Both r equal
D Cannot be determined

15)In a map 1 inch represents 2.5 miles.

( I ) Distance b/w two cities is 50 inch
(II) 125 miles
Ans : C (Both r equal)
16) ( I ) Exterior angle of hexagon
( II) Interior angle of pentagon
Ans: A ( i.e Exterior angle is greater ), 


17) ( I ) Distance b/w the points (0,0) to (5,5)
(II) Distance b/w the points (2,3) to (4,6)
Ans : C (Both r equal)
18) ( I ) Area of the circle of radius 5 cm
(II) Area of the rectangle of sides8cm,6cm
Ans :A (i.e Area of circle > Area of Rectangle)
19) ( I ) No of even elements b/w 1 and 25
(II) No of odd elements b/w 1 nad 26
Ans: B 

20)In comparison of stmts last stmt Ans is : C Both r equal)

For reading comprehension i.e Mumbai,Vishagapatinam oil refineries passage the answers Ivemarked is ( Note : Qsn no is same as presented in the original Ramco Qsn paper) 
17)E
18)C
19)C
20)B
21)C
22)E
23)C
24)D
25)C
Total no of Qsns 60 Time : 60 mins 
Here Ive given Ans for 29 Qsns. 
Remaining Qsns are easy except english.
Try to workout Rice,Wheat,Pulses,Other cereals Passage after finishing of No 31-60 Qsns in orginal Qsn paper.After that go for the first pasage i.e Borrower,Industries,.




QUESTION PAPER STARTS.THE FILENAME IS RAMQP.I HOPE ITIS RAMCO


1) A - G are 7 consecutive +ve integers not necessarily in the same order

1) B is the middle number
2) D is 3 less than c
3) the difference between F & A is equal in magnitude and sign
to the difference between E & C
4) Neither F nor C lie between E & G

a) What is the value of B-F

1 2 -1 -2 cannot be determined

b) which is greatest

F C A E cannot be determined

c) Given both A & B are primes what is the lowest value of E

8 6 9 12 cannot


2) Given that a,b,c,d,e each represent one of the digits between
1-9 and that the following multiplication holds

a b c d e 
4
----------
e d c b a 

What digit does e represent

a) 4
b) 6
c) 7
d) 8
e) none


1. How many butes does an array A(1:8,-2:2,1:5) require for storage if
each element of the array is 24 bits long.

200 480 600 800 none


2. begin

i:=0; 
j:=0; | block d

loop:

if(i != 0) 
i := i-1;
else
i := i+1;

i := i+1; | block a
j := j+1; | block b

if (j <= 25)
goto loop;

end | block c


a) What is the value of i at [c] 
2 ?
b) How many times is the goto executed 
25 ?
c) How many times is the loop executed if i is initialized to 1
in [d] 26
d) How many times is the loop entered if the block [b] is changed
to j=j+1 ?

e) What is the value of i at [c] interchanging blocks [a] and [b] ?
2 ?

Follow the instructions given below [ From 1 to 8 ]

1. A cause B or C but not both

2. F occurs only if B occurs

3. D occurs if B or C occurs

4. E occurs if only c occurs

5. J occurs only if E or F occurs

6. H occurs if E occurs

7. D causes G, H or Both.

8. G occurs if F occurs.


Ramco Questions
---------


1. If A occurs which of the following may occur

1. F & G (ii) E & H (iii) D

Ans
---
(a) 1 only (b) 2 only (c) 3 only (d) 1,2,3 or 2 & 3 but not 1

(e) 1,2 & 3


2. If B occurs which must occur

Ans
--- (a) F & G (b) D & G (c) D (d) G & H (e) J

3. If J occurs which must occur

Ans
---
(a) E (b) Both E & F (c) Either B or C (d) B (e) Both B & c


4. Which may occur as a result by a cause not mentioned.

(I) D (II) A (III) F

Ans
---
(a) I only (b) II (c) I & II (d) II & III (e) I,II,III


5. If E occurs which cannot occur.

(a) F (b) A (c) D (d) C (e) J



#include
int SumElement(int *,int);
void main(void)
{
int x[10];
int i=10;
for(;i;)
{
i--;
*(x+i)=i;
}
printf("%d",SumElement(x,10));
}
int SumElement(int array[],int size)
{
int i=0;
float sum=0;
for(;i
void main(void);
int printf(const char*,...);
void main(void)
{
int i=100,j=10,k=20;
int sum;
float ave;
char myformat[]="ave=%.2f";
sum=i+j+k;
ave=sum/3.0;
printf(myformat,ave);
}


#include
void main(void);
void main(void)
{
int a[10];
printf("%d",((a+9) + (a+1)));
}


#include
void main(void);
void main(void)
{
struct s{
int x;
float y;
}s1={25,45.00};
union u{
int x;
float y;
} u1;
u1=(union u)s1;
printf("%d and %f",u1.x,u1.y);
}


#include
void main(void)
{
unsigned int c;
unsigned x=0x3;
scanf("%u",&c);
switch(c&x)
{
case 3: printf("Hello!\t");
case 2: printf("Welcome\t");
case 1: printf("To All\t");
default:printf("\n");
}
}


#include
int fn(void);
void print(int,int(*)());
int i=10;
void main(void)
{
int i=20;
print(i,fn);
}
void print(int i,int (*fn1)())
{
printf("%d\n",(*fn1)());
}

int fn(void)
{
return(i-=5);
}


#include
void main(void);
void main(void)
{
char numbers[5][6]={"Zero","One","Two","Three","Four"};
printf("%s is %c",&numbers[4][0],numbers[0][0]);
}


int bags[5]={20,5,20,3,20};
void main(void)
{
int pos=5,*next();
*next()=pos;
printf("%d %d %d",pos,*next(),bags[0]);
}
int *next()
{
int i;
for(i=0;i
void main(void)
{
int y,z;
int x=y=z=10;
int f=x;
float ans=0.0;
f *=x*y;
ans=x/3.0+y/3;
printf("%d %.2f",f,ans);
}


#include
void main(void);
double dbl=20.4530,d=4.5710,dblvar3;
void main(void)
{
double dbln(void);
dblvar3=dbln();
printf("%.2f\t%.2f\t%.2f\n",dbl,d,dblvar3);
}
double dbln(void)
{
double dblvar3;
dbl=dblvar3=4.5;
return(dbl+d+dblvar3);
}



#include
static int i=5;
void main(void)
{
int sum=0;
do
{
sum+=(1/i);
}while(0
void main(void)
{
int oldvar=25,newvar=-25;
int swap(int,int);
swap(oldvar,newvar);
printf("Numbers are %d\t%d",newvar,oldvar);
}
int swap(int oldval,int newval)
{
int tempval=oldval;
oldval=newval;
newval=tempval;
}



#include
void main(void);
void main(void)
{
int i=100,j=20;
i++=j;
i*=j;
printf("%d\t%d\n",i,j);
}



#include
void main(void);
int newval(int);
void main(void)
{
int ia[]={12,24,45,0};
int i;
int sum=0;
for(i=0;ia[i];i++)
{
sum+=newval(ia[i]);
}
printf("Sum= %d",sum);
}
int newval(int x)
{
static int div=1;
return(x/div++);
}



#include
void main(void);
void main(void)
{
int var1,var2,var3,minmax;
var1=5;
var2=5;
var3=6;
minmax=(var1>var2)?(var1>var3)?var1:var3:(var2>var3)?var2:var3;
printf("%d\n",minmax);
}



#include
void main(void);
void main(void)
{
void pa(int *a,int n);
int arr[5]={5,4,3,2,1};
pa(arr,5);
}

void pa(int *a,int n)
{
int i;
for(i=0;i
void main(void);
void print(void);
void main(void)
{
print();
}
void f1(void)
{
printf("\nf1():");
}

#include "6.c"
void print(void)
{
extern void f1(void);
f1();
}
static void f1(void)
{
printf("\n static f1().");
}



#include
void main(void);
static int i=50;
int print(int i);
void main(void)
{
static int i=100;
while(print(i))
{
printf("%d\n",i);
i--;
}
}
int print(int x)
{
static int i=2;
return(i--);
}



#include
void main(void);
typedef struct NType
{
int i;
char c;
long x;
} NewType;
void main(void)
{
NewType *c;
c=(NewType *)malloc(sizeof(NewType));
c->i=100;
c->c='C';
(*c).x=100L;
printf("(%d,%c,%4Ld)",c->i,c->c,c->x);
}



#include
void main(void);
const int k=100;
void main(void)
{
int a[100];
int sum=0;
for(k=0;k<= 25)
goto loop;

end | block c


a) What is the value of i at [c] 
2 ?
b) How many times is the goto executed 
25 ?
c) How many times is the loop executed if i is initialized to 1
in [d] 26
d) How many times is the loop entered if the block [b] is changed
to j=j+1 ?

e) What is the value of i at [c] interchanging blocks [a] and [b] ?
2 ?

Follow the instructions given below [ From 1 to 8 ]

1. A cause B or C but not both

2. F occurs only if B occurs

3. D occurs if B or C occurs

4. E occurs if only c occurs

5. J occurs only if E or F occurs

6. H occurs if E occurs

7. D causes G, H or Both.

8. G occurs if F occurs.


Questions
---------

1. If A occurs which of the following may occur

1. F & G (ii) E & H (iii) D

Ans
---
(a) 1 only (b) 2 only (c) 3 only (d) 1,2,3 or 2 & 3 but not 1

(e) 1,2 & 3


2. If B occurs which must occur

Ans
--- (a) F & G (b) D & G (c) D (d) G & H (e) J

3. If J occurs which must occur

Ans
---
(a) E (b) Both E & F (c) Either B or C (d) B (e) Both B & c


4. Which may occur as a result by a cause not mentioned.

(I) D (II) A (III) F

Ans
---
(a) I only (b) II (c) I & II (d) II & III (e) I,II,III


5. If E occurs which cannot occur.

(a) F (b) A (c) D (d) C (e) J



#include
int SumElement(int *,int);
void main(void)
{
int x[10];
int i=10;
for(;i;)
{
i--;
*(x+i)=i;
}
printf("%d",SumElement(x,10));
}
int SumElement(int array[],int size)
{
int i=0;
float sum=0;
for(;i
void main(void);
int printf(const char*,...);
void main(void)
{
int i=100,j=10,k=20;
int sum;
float ave;
char myformat[]="ave=%.2f";
sum=i+j+k;
ave=sum/3.0;
printf(myformat,ave);
}


#include
void main(void);
void main(void)
{
int a[10];
printf("%d",((a+9) + (a+1)));
}


#include
void main(void);
void main(void)
{
struct s{
int x;
float y;
}s1={25,45.00};
union u{
int x;
float y;
} u1;
u1=(union u)s1;
printf("%d and %f",u1.x,u1.y);
}


#include
void main(void)
{
unsigned int c;
unsigned x=0x3;
scanf("%u",&c);
switch(c&x)
{
case 3: printf("Hello!\t");
case 2: printf("Welcome\t");
case 1: printf("To All\t");
default:printf("\n");
}
}


#include
int fn(void);
void print(int,int(*)());
int i=10;
void main(void)
{
int i=20;
print(i,fn);
}
void print(int i,int (*fn1)())
{
printf("%d\n",(*fn1)());
}

int fn(void)
{
return(i-=5);
}


#include
void main(void);
void main(void)
{
char numbers[5][6]={"Zero","One","Two","Three","Four"};
printf("%s is %c",&numbers[4][0],numbers[0][0]);
}


int bags[5]={20,5,20,3,20};
void main(void)
{
int pos=5,*next();
*next()=pos;
printf("%d %d %d",pos,*next(),bags[0]);
}
int *next()
{
int i;
for(i=0;i
void main(void)
{
int y,z;
int x=y=z=10;
int f=x;
float ans=0.0;
f *=x*y;
ans=x/3.0+y/3;
printf("%d %.2f",f,ans);
}


#include
void main(void);
double dbl=20.4530,d=4.5710,dblvar3;
void main(void)
{
double dbln(void);
dblvar3=dbln();
printf("%.2f\t%.2f\t%.2f\n",dbl,d,dblvar3);
}
double dbln(void)
{
double dblvar3;
dbl=dblvar3=4.5;
return(dbl+d+dblvar3);
}



#include
static int i=5;
void main(void)
{
int sum=0;
do
{
sum+=(1/i);
}while(0
void main(void)
{
int oldvar=25,newvar=-25;
int swap(int,int);
swap(oldvar,newvar);
printf("Numbers are %d\t%d",newvar,oldvar);
}
int swap(int oldval,int newval)
{
int tempval=oldval;
oldval=newval;
newval=tempval;
}



#include
void main(void);
void main(void)
{
int i=100,j=20;
i++=j;
i*=j;
printf("%d\t%d\n",i,j);
}



#include
void main(void);
int newval(int);
void main(void)
{
int ia[]={12,24,45,0};
int i;
int sum=0;
for(i=0;ia[i];i++)
{
sum+=newval(ia[i]);
}
printf("Sum= %d",sum);
}
int newval(int x)
{
static int div=1;
return(x/div++);
}



#include
void main(void);
void main(void)
{
int var1,var2,var3,minmax;
var1=5;
var2=5;
var3=6;
minmax=(var1>var2)?(var1>var3)?var1:var3:(var2>var3)?var2:var3;
printf("%d\n",minmax);
}



#include
void main(void);
void main(void)
{
void pa(int *a,int n);
int arr[5]={5,4,3,2,1};
pa(arr,5);
}

void pa(int *a,int n)
{
int i;
for(i=0;i
void main(void);
void print(void);
void main(void)
{
print();
}
void f1(void)
{
printf("\nf1():");
}

#include "6.c"
void print(void)
{
extern void f1(void);
f1();
}
static void f1(void)
{
printf("\n static f1().");
}



#include
void main(void);
static int i=50;
int print(int i);
void main(void)
{
static int i=100;
while(print(i))
{
printf("%d\n",i);
i--;
}
}
int print(int x)
{
static int i=2;
return(i--);
}



#include
void main(void);
typedef struct NType
{
int i;
char c;
long x;
} NewType;
void main(void)
{
NewType *c;
c=(NewType *)malloc(sizeof(NewType));
c->i=100;
c->c='C';
(*c).x=100L;
printf("(%d,%c,%4Ld)",c->i,c->c,c->x);
}



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