Tip 1 : Begin early, but do not regret your timing.
Tip 2 : Be consistent. Do something everyday. Small progress every single day is better than no a rushed, hard-work day and then nothing for a week
Tip 3 : Relax and don't stress. Never doubt even if you don't see progress or have to face rejection. Trust your timing.
Tip 1 : Include only genuine information.
Tip 2 : It should never be of more than one page
Explain how heaps are implemented
Step 1: Heaps require the property of sorting themselves such that the smallest or largest element is at the top. So we need something that can sort itself in reasonable time complexity every-time a new element is added or deleted. A good way to get that is a binary search tree which can do this in O(log n).
Diamond problem is when more than one class inherits a class and one class inherits those classes. Ex. Classes B and C inherit class A, and class D inherits classes B and C. If B and C have the same function and class D calls that function, then there will be an error as the compiler won't know which class's function to call.
Either use scope-resolution operator or virtual functions
A destructor is a member function that is invoked automatically when the object goes out of scope or is explicitly destroyed by a call to delete . A destructor has the same name as the class, preceded by a tilde ( ~ ). For example, the destructor for class String is declared: ~String()
Sorted it using recursion, wherein the current element (top) is taken out and the function called by recursion to sort the remaining stack. Then the element is inserted in its right place.
Tip 1 : Know all about your project.
Tip 2 : Abide by organisation norms while making a system
Tip 1 : Be goal-oriented and see yourself at the finish-line, at the point when you have already completed the job.
Tip 1 : Be ready for such questions before-hand and keep answers and situation examples ready.
Tip 1 : Read well about the company.
Tip 1 : As a self-sufficient, independent person who has grown personally and professionally.