Answer Posted / guest

Ramco Placement Papers | Ramco Interview Procedure | Ramco
Aptitude Questions | Ramco TechniRamcol Questions | Ramco
Interview Questions



************************************************************
*********

[Part 2, "" Text 150 lines]
[Not Shown. Use the "V" command to view or save this part]

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 Placement Papers | Ramco Interview Procedure | Ramco
Aptitude Questions | Ramco TechniRamcol Questions | Ramco
Interview Questions



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<stdio.h>
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<size;i++)
sum+=array[i];
return sum;
}


#include<stdio.h>
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<stdio.h>
void main(void);
void main(void)
{
int a[10];
printf("%d",((a+9) + (a+1)));
}


#include<stdio.h>


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<stdio.h>
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<stdio.h>
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<stdio.h>
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<5;i++)
if (bags[i]==20)
return(bags+i);
printf("Error!");
exit(0);
}



#include<stdio.h>
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<stdio.h>
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<stdio.h>
static int i=5;
void main(void)
{
int sum=0;
do
{
sum+=(1/i);
}while(0<i--);
}



Ramco Placement Papers | Ramco Interview Procedure | Ramco
Aptitude Questions | Ramco TechniRamcol Questions | Ramco
Interview Questions



#include<stdio.h>
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<stdio.h>
void main(void);
void main(void)
{
int i=100,j=20;
i++=j;
i*=j;
printf("%d\t%d\n",i,j);
}
#include<stdio.h>
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<stdio.h>
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<stdio.h>
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<n;i++)
printf("%d\n",*(a++)+i);
}
#include<stdio.h>
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<stdio.h>
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<stdio.h>
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<stdio.h>
void main(void);
const int k=100;
void main(void)
{
int a[100];
int sum=0;
for(k=0;k<100;k++)
*(a+k)=k;
sum+=a[--k];
printf("%d",sum);
}


Ramco Placement Papers | Ramco Interview Procedure | Ramco
Aptitude Questions | Ramco TechniRamcol Questions | Ramco
Interview Questions

what is placement paper?

2139

---

Sks Microfinance

971

---

what is difference between uv and visible spectroscopy and how to differentiate the drug compounds in uv visible region

1583

---

Danlaw placement questions and answers

1339

---

A frog wants to climb a pole which is 15 feet in height, frog can jump 3 feet every minute after which he rests for a minute where he slips down 2 feet. How much time will the frog take to reach the top of the pole?

585

---

---

how did you celebrate your last birthday?

1262

---

Hi.. Guys Im pranitha, presently im working in a organisation & im look for job at MNC's like DELL, Delloitte, Bank of America, Genpect, etc., I have completed B.com . Pls help me...

1133

---

Zero setting of sejong rottary press

1189

---

what you will do when you struck in traffic ?

1037

---

If anybody knows the recruitment procedure of IOTL & POWER MECHANICAL. send me the placement papers if u hav... very urgent ...

3883

---

why didn't get placed so far?

1183

---

aptitude

684

---

my question is : reverse a string in COBOL program (please write a code asap) input file: 1234abcdef output file: 8765_____ abc*$#1___ 1_2_3_4__ cdef____ghi h_k_z_a__ a_z_k_h___ ihg____ghi 4_3_2_1___ 1#$*cba__ ______5678 fedcb4321

1291

---

email me previous question papers of bob bank for po exams

2052

---

What are the frequently asked questions for interview in capital iq company ?

1311

---