Tip 1 : Practice dynamic programming coding questions
Tip 2 : Be strong on data structures
Tip 3 : Make sure to know all the basics and fundamentals of CS subjects like operating system, compiler design(linker, loader etc.,)
Tip 1 : Include more projects if you have done it will add weightage
Tip 2 : Important sections in resume are projects and skill set. Make sure to put them only when you are confident.
Tip 3 : Try to prepare a short and crisp resume
getSize: Returns an integer. Gets the current size of the stack
isEmpty: Returns a boolean. Gets whether the stack is empty
push: Returns nothing. Accepts an integer. Puts that integer at the top of the stack
pop: Returns nothing. Removes the top element of the stack. It does nothing if the stack is empty.
getTop: Returns an integer. Gets the top element of the stack. Returns -1 if the stack is empty
It was easy to do this
Implemented using struct node.
Based on stack or queue performed operation of push pop or add delete element
1. Constructor: It initializes the data members as required.
2. enqueue(data): This function should take one argument of type integer. It enqueues the element into the queue.
3. dequeue(): It dequeues/removes the element from the front of the queue and in turn, returns the element being dequeued or removed. In case the queue is empty, it returns -1.
4. front(): It returns the element being kept at the front of the queue. In case the queue is empty, it returns -1.
5. isEmpty(): It returns a boolean value indicating whether the queue is empty or not.
Query-1(Denoted by an integer 1): Enqueues integer data to the queue.
Query-2(Denoted by an integer 2): Dequeues the data kept at the front of the queue and returns it to the caller, return -1 if no element is present in the queue.
Query-3(Denoted by an integer 3): Fetches and returns the data being kept at the front of the queue but doesn't remove it, unlike the dequeue function, return -1 if no element is present in the queue.
Query-4(Denoted by an integer 4): Returns a boolean value denoting whether the queue is empty or not.
It was easy to do this Implemented using struct node. Based on stack or queue performed operation of push pop or add delete element
We have a linked list 1->2->3->4->5->6->7 and so on. You are supposed to swap pairs of a linked list like swap (1,2), (3,4), (5,6), and so on.
1. You may not modify the data in the list’s nodes; only nodes themselves may be changed. Because imagine a case where a node contains many fields, so there will be too much unnecessary swap.
2. If a pair of a node does not exist, then leave the node as it is.
In case of swap, I have taken 2 pointers, next will be traversing the list to search for data, prev will be point just before the next pointer. (Both will be traversing but oreg will be one node behind)
If data matches, swap next and prev and reorder the links
• The reference to the head of the linked list is not given.
• The node to be deleted is not a tail node.
• The value of each node in the Linked List is unique.
• It is guaranteed that the node to be deleted is present in the linked list.
a, b
a= a+b
b= a-b
a= a-b
Given 3 tables and a problem statement on how to get the data
1. Used inner join and where conditions to get the data
2. For another question, used group by and sum, count functions ( this question is based on how to get the Ntg highest salary)
Tip 1 : Thorough with ER relationships like association etc
Tip 2 : Strong on SQL querying
It was managerial round.
They were testing both my technical skills and behavioural skills
Tip 1 : Casual discussion with manager
Tip 2 : Ask questions about the role and company and their experience
Tip 1 : Focus on your core academics subjects
Tip 2 : Don't ignore the college lectures
It was a HR round which was basically focused on personality and character
Tip 1 : Research more about the company
Tip 2 : Note some points on recent products released of that company
Tip 3 : Note some points about the performance and any awards or recognition received by company
Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is inheritance in C++?