Wednesday, March 12, 2008

HoneyWell Placement Paper 2

Honeywell conducted a test in IIT and Interview was in their office at B'lore.

HONEYWELL came yesterday to our college;
QUESTIONs were very tough and
They are screwing in interview

Pattern:
1st round
thecnical(cs and ece sperate papers)-35q in 30 min
apti(10anal,1 logic,remaining numeric)-30 in 30 min
20 c in 15 min

2nd round
G.D
topics:
impact of globalisation or westernisation on indian
culture

love marriage -arranged - which is better?????

actors entering politics---is it good?

ragging- should be prevented ???

3rd round
technical interview
may be 2 rounds in this ...

4rd
final roud is this .
this is HR

I attended the written test for Honeywell at NCE,Kovilpatti.

There came a crowd of 1000(I batch) & they selected 50.
And I got selected for GD round,which is on 2-aug.
Can u help me to prepare for GD with GD topics & GD preparation tips.
If u had any GD experience please share with me, so that it would be very helpful for me.
Some of the questions asked:
. Aptitude - 20
Reasoning - 10
- 30 minutes
2. Technical - 35
- 30 minutes
3. C - 15
- 15 minutes

1.Aptitude:
Simple train pbms
age
ratio - proportion
Profit - loss
Time & work
Time & Distance
Pipe & Cisterns
Shaded area
Volume ( cylinder ,cone ..)

Reasoning
2 sections
a part with 4 questions
b part with 6 questions

There must 4 domocrats & 3 republicans out of the
12 professors.
No of X professors are A,B,C,D.
No of Y professors are E,F,G,H,I.
If A comes f & G r absent ..
so on.

Easy to solve.

2.Technical(Computer Science)
OS
cache access time -100ns
Primary memory access time -1000ns
...then some data & condition
find the actual access time.
microprocessor
( lot of questions )
8085 no of 16 bit registers.
8086 Instruction queue byte length?
8088 Instruction queue byte length?
6800 what is it?
8085 pgms...
port no calculations
Data Structures
Which Data Structures to use for infix to prefix conversion
Worst case complexity for quick sort
preorder traversal
Binary tree ...

C
Only one pgm - recursive fn - find the value..
quite easy.

Number conversion hexa , octal

3.C
1. int *data[10];
what does the variable data denotes?
2.{
int a[]={10,20,30,40,50};
fun(a+1);
}
fun(int *p)
{
for(int i=1;i<=3;i++) printf("%d",*(p+i)); } 3.enum day { saturday, sunday=3, monday, tuesday }; value of saturday,tuesday. 4. enum day { saturday, sunday=-1, monday, tuesday }; int x=monday; value of x? 5. #define ADD(X,Y) X+Y main() { - #undef ADD(X,Y) fun(); } fun() { int y=ADD(3,2); printf("%d",y); } o/p? 6. #define ADD(X,Y) X+Y main() { #undef ADD; fun(); } fun() { #if not defined(ADD) define ADD(X+Y) X*Y int y=ADD(3,2); printf("%d",y); } o/p? 7. ptr sums... 8. int x; int *p; int **p1; int ***p2; How to assign each one? 9.malloc pbms..

No comments: