PayPal Interview Experience | Set 7 (On-Campus)

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


Write your Interview Experience or mail it to contribute@geeksforgeeks.org



My Personal Notes arrow_drop_up


Article Tags :
Practice Tags :


1


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.