Answer / ashish singhal

Persistent Placement Papers | Persistent Interview Procedure |
Persistent Aptitude Questions | PersistentTechnical Questions
| Persistent Interview Questions




I appeared for Persistent campus.

Appered 132 Shortlisted were 20

After 2 TI.

Selected : Only One!!! (

The 1st test was of 30marks & had 60 minutes & no -ve marking. Actually by
this they want to eliminate candidates who Guess options.

C questions were on pointers & arrays, Macros, Scope of variables. read
probability also. (Throwing dice & coins, cards Plz note, they will also
collect your rough sheet along wih answer sheet .


Persistent Placement Papers | Persistent Interview Procedure |
Persistent Aptitude Questions | PersistentTechnical Questions
| Persistent Interview Questions


2nd test was on programming .

2 programs have to be wrtitten .


1) Binary Tree Sort (assume tree is there & use 'inorder' traversal)
2) Finding element in array (Use Binary search if given array is 'sorted')
They focus on complxity also.

1st Technical Interview

Asked all basic of DS, focus was on Link list, trees & OOPs concept.

2nd Technical Interview

They asked to write programs for linklist, quicksort, etc.

HR


Be prepared with all of DS & sorting algorithmss. They love linklist.

Persistent Placement Papers | Persistent Interview Procedure |
Persistent Aptitude Questions | PersistentTechnical Questions
| Persistent Interview Questions

how did you celebrate your last birthday?

0 Answers   HCL,

---

mechanical engg written test question

1 Answers   Elecon, Quest, TATA, Tata Steel Limited,

---

HELP ME OUT !

1 Answers   Wipro,

---

Tech mahindra interview experience

1 Answers   Tech Mahindra,

---

INFOSYS PLACEMENT PAPERS ----- Placement Paper 16

1 Answers   Infosys,

---

---

bhel/ntpc

3 Answers   NTPC,

---

Persistent Selection Procedure In Nagpur 2007 March

1 Answers   Persistent, Satyam, TCS,

---

Texas PLACEMENT PAPERS

6 Answers   Texas,

---

civil site supervisor job

2 Answers   ACC,

---

what is bidirectional?

0 Answers  

---

Please send me the placement papers for Software Testing

0 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,

---