Skip to content
Related Articles

Related Articles

PayPal Interview Experience | Set 7 (On-Campus)
  • Difficulty Level : Medium
  • Last Updated : 22 Oct, 2016

1) Dangling pointer
2) Singleton class implementation
3) DBMS – Different types of joins
4) Example programs for polymorphism
5) Explain Binary Tree and Binary search tree
6) Program for Binary search
7) Program to implement stack using classes in C ++
8) Virtual functions
9) Virtual destructor
10) What happens when you create an object using a base class pointer
11) Why java uses interfaces
12) Diamond structure problem
13) Explain deadlock
14) Difference between array and linked list. Adv of array
(Accessing k-th element is easier in array than LL)
15) Difference between pre and post increment (there’s some difference in how they are accessed in memory)

If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready. To complete your preparation from learning a language to DS Algo and many more, please refer Complete Interview Preparation Course. In case you are prepared, test your skills using TCS, Wipro, Amazon and Microsoft Test Serieses.

My Personal Notes arrow_drop_up