Tip 1 : Prepare OOPS very well, because they ask a lot of questions from OOPS.
Tip 2 : Practice Coding problems as much as you can because they will ask you to write codes.
Tip 3 : Prepare Your course subjects such as Operating system, Java, DBMS.
Tip 1 : Keep Your resume at most of one page
Tip 2 : Mention only those things at which you have great knowledge. Don't write anything just to make your resume attractive.
Tell the difference Between array and linked List. And according to which conditions Linked List and Array should be used.
Tip 1 : Tell the basic definition of both Data structures
Tip 2 : Read basics of every Data structures carefully and their uses
Tip 3 : Answer the question completely i.e. Tell all the differences Between array and Linked List and describe it deeply.
Describe all the basic principles of OOPS . What is difference between Abstraction and Encapsulation.
Tip 1 : Read basics of OOPS carefully.
Tip 2 : Try to tell and describe things in simpler words as much as you can.
Tip 3 : Read difference and similarities between terms carefully.
Tell about Constructors and types of Constructors in C++. Why Virtual Destructors are possible while virtual Constructors are not Possible?
Tip 1 : Read about Constructor and Destructor topic carefully
Tip 2 : Do read about Copy Constructor.
Tip 3 : Give valid reason that why virtual constructors aren't possible.
Tell what is Polymorphism and what is difference between operator overloading and polymorphism. How Runtime Polymorphism is Implemented. What is abstract Classes and virtual functions.
Read about run time polymorphism and compile time polymorphism
Step 1 : The interviewer gave me an example and describe me the question statement.
Step 2 : I told him my approach. I have done a similar question from gfg.
Step 3 : Then he ask me to write code.
Step 4 : I write the code and calculated complexity for the same.
Step 5 : He approved my Code and was happy form my approach.
What is complexity of finding Height of tree in case of symmetric tree, Left skewed tree and Right skewed tree.
Read about different types of trees.
What is heap sort and what is complexity of heap sort?
Study all the sorting algorithms, their worst and best case time complexity and what are the test cases at which best and worst time complexity occurs.