Home »
Placement Papers »
Honeywell Placement Papers 22 JULY 2006, Bangalore »
Honeywell Placement Paper 29th JANUARY AT PUNE
Honeywell Placement Paper 29th JANUARY AT PUNE
HONEYWELL PAPER ON 29th JANUARY AT PUNE
Date: 29th January, 2007
Locaion: CDAC, ACTS, Pune
Mode: Campus placement
Hi guys & guls,
This is Prashant Kr. Agrawal. I m trying to give some important topics about interviews, plz read it, they may give u some confidence.
Most of the question were from SOFTWARE ENGINEERING, C programming, Data structures, Operating systems such as-
-> SDLC (software development life cycle)-what r various models [waterfall, prototype, iterative enhancement, spiral], wht r the steps under these models.
-> some question about Testing, unit testing, integration testing, alpha, beta testing ,system testing.
-> What is CMM levels, Six sigma, ISO standards.
->what r various steps under which a C program is converted into .exe file (preprocessing, compilation, linking)
->Program for any sorting method (I made bubble sort, he discussed complexity issues of various sorting algorithms)
->Program for matrix multiplication.
->What are the different kinds of tree (questions about Binary tree, Binary search tree, AVL tree)
->Difference between arrays and linked list, which one is better (I said it depends upon application, if we want to store some name ie character string of predefined length array will be better option b�coz more memory is required to store pointers etc)
-> Some question about Aerospace, aviation etc(I said these thing were not part of my syllabus at all, but I if I get a chance to learn the these I can quickly learn them)
->Which data structure is used in expression evaluation, how a infix expression is evaluated (first converted into postfix, then evaluate using stack)
-> Some operating system questions (about scheduling, semaphore, mutexes)
-> what is Real time system, difference between hard and soft real time systems with examples(hint: in hard real time systems strict dead lines r imposed, THE SYSTEM WILL FAIL if the processing is not done within defined time constrains ex. Firing a missile on a aircraft, whereas in soft real time system deadlines are important but missing the deadline will not lead to system failure, for ex. DVD player when a command is given thru remote, the delay of few millisecond will not lead to serious implications)
-> I suggest you all to focus about your projects more. He may drive several questions from ur projects itself.
There is procedure of two technical rounds, (In my batch, for some candidates 1 technical round was face-to-face and another one is telephonic, I suggest to be prepare for telephonic interview also, practice for describing your project etc on phone also, b�coz it is a bit hard to make understand to a person who is not present in front of u, so practice it also)
So, ALL THE BEST, be prepare, have FAITH on GOD��. He has thought something for u��, don�t worry�.
(I know it is good to write or read, but vry hard to implement���., but try it, surely it will work)���,
For written test: Two set of papers were there, 1 for EC & 1 for CS. I opted for CS.
50 technical: most of the weightage was given to DBMS, data structures etc.
30 C programming: Read exploring C completely, in my suggestion that is vry good & sufficient book for C questions.
20 aptitude question:
Few questions were like-
1> Arrange Them in the order of space complexity
Merge sort, quick sort, heap sort
2> Void main()
{
complete=10;
complete1=11;
if(complete=12)
{
printf (�hi�);
}
else
{
printf(�hello�);
}
printf(�%d %d �,complete,complete1);
}
o/p- hi 12 11
3> How many times in a day the hr. & min. hands of a clock are in straight line.
4> How many times in a day the hr. & min. hands of a clock meet each other.
5> Structure A
{
int x;
float y;
}a;
union B
{
int p;
float ;
}b;
choices: 1.all the times a & b have same size, 2. such declaration r not possible
3. a & b have same size. 4��..
6> a simple qus on flow in a switch-case block.
OK BEST OF LUCK
|