Golgappa.net | Golgappa.org | BagIndia.net | BodyIndia.Com | CabIndia.net | CarsBikes.net | CarsBikes.org | CashIndia.net | ConsumerIndia.net | CookingIndia.net | DataIndia.net | DealIndia.net | EmailIndia.net | FirstTablet.com | FirstTourist.com | ForsaleIndia.net | IndiaBody.Com | IndiaCab.net | IndiaCash.net | IndiaModel.net | KidForum.net | OfficeIndia.net | PaysIndia.com | RestaurantIndia.net | RestaurantsIndia.net | SaleForum.net | SellForum.net | SoldIndia.com | StarIndia.net | TomatoCab.com | TomatoCabs.com | TownIndia.com
Interested to Buy Any Domain ? << Click Here >> for more details...


HP Testing - RelQ

Answers were Sorted based on User's Feedback



HP Testing - RelQ..

Answer / guest

1. What is performance testing..How would you test the performance of a
flash object
2. What is the difference between a bug and a defect
3. What is the difference between retesting and regression testing
4. Explain bug life cycle
5. What is the most critical bug you found
6. Consider a moblie phone : when you save the number, the number gets
saved under a different name . What is the priority and severity of the bug
7. Write code for binary search

Is This Answer Correct ?    5 Yes 0 No

HP Testing - RelQ..

Answer / lund

Maa ki chuttttttt...in kiiiii

Is This Answer Correct ?    0 Yes 0 No

Post New Answer

More Placement Papers Interview Questions

i want question and answers

1 Answers  


MBT PLACEMENT PAPERS ---- Placement Paper 1

1 Answers   MBT,


Zero setting of sejong rottary press

0 Answers   Sharon,


Tech mahindra interview experience

1 Answers   Tech Mahindra,


Accenture Placement Papers 14 oct 2006 - Placement Paper

2 Answers   Accenture,


Robert Bosch 3 Mar 2007 Coimbatore Written Test Paper

6 Answers   Bosch,


Bangalore IFlex Interview {16/05/2007}

3 Answers   iFlex,


Accenture Group Discussion & Interview Questions & HR Interview - 10 Sep 2006

15 Answers   Accenture, HDFC, Infosys, Ruchi Group, TCS, Unisys, Wipro,


CDM,SAS Clinical Programming,SDTM Training & Placement

1 Answers  


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,


placement paper

1 Answers   Wipro,


iti tecnical paper

1 Answers  


Categories