Answer / reem

HP has 3 rounds

1.Preliminary -consists of 4 sections namely english,reasoning,aptitude
and comprehension.

English-just preliminary consisting of articles,jumbled up sentences,
antonyms & synonyms etc.

HP Placement Papers | HP Interview Procedure |
HP Aptitude Questions | HP Technical Questions |
HP Interview Questions


Reasoning round : this is the part which most students found to be the
tough eventhough half of the questions were very easy.


The ones which were tough are venn diagram puzzles,the type of problems
were one has to decide if the person is to be selected, rejected or
referred clock puzzles, cube(which part is painted etc).

Aptitude round : just prelimanaries involving time & distance, binary
numbers, clocks, simple but lenghy mathematical calculations.

HP Placement Papers | HP Interview Procedure |
HP Aptitude Questions | HP Technical Questions |
HP Interview Questions

Conprehension : Apassage from MIcroprocesor was given from which
conclusion was to be drawn.It was a tough one.


2. Technical Interview : Just simple questions involving C,C++,DBMS
(must),SQL, software engg,d.s.

3. HR : Lengthy (for me it was approximately 40 min) but quite cordial.


Just general questions like family background,hobbies from biodata,last
movie seen it's story,last book which you read and so on.

The major eliminating round was the preliminary section.

HP Placement Papers | HP Interview Procedure |
HP Aptitude Questions | HP Technical Questions |
HP Interview Questions

NOVELL PLACEMENT PAPERS -------- Placement Paper 3

1 Answers   Novell,

---

Tibco Software India pvt. ltd.

1 Answers   Tibco,

---

faq of datawarehousing

1 Answers  

---

samcys technologies

1 Answers  

---

Hcl Placement Paper - May 2006 Chennai

2 Answers   HCL, Wipro,

---

Accenture Interview and Placement Paper March 9 2007

2 Answers   Accenture,

---

MBT PLACEMENT PAPER

1 Answers   MBT,

---

COGNIZANT TECHNOLOGY SOLUTION placement PAPER

1 Answers   Cognizant, CTS,

---

An array of size k contains integers between 1 and n. Compress the original array by removing duplicates in it in O(k) time What if k << n?

1 Answers   HCL, Microsoft, Veritas,

---

what is placement paper?

0 Answers   Airtel, TATA, Value Labs,

---

database management systems

2 Answers   Infosys,

---

Texas PLACEMENT PAPERS ------- Placement Paper-2

1 Answers   Texas,

---