Tip 1 : Do at least 2 projects
Tip 2 : Focus on CS fundamental
Tip 1 : Good projects
Tip 2 : Mention your DSA skills
This round is all about AMCAT exam type.
In which of the following cases dynamic arrays are not preferred?
a) If the size of the array is unknown
b) If the size of the array changes after few iterations
c) If the memory reallocation takes more time i.e. expensive
d) If the array holds less number of elements
In special case, the time complexity of inserting/deleting elements at the end of dynamic array is __________
a) O (n)
b) O (n1/2)
c) O (log n)
d) O (1)
There are two coding questions and some pseudocode, and also the DSA concept. This level is not hard, it is of moderate level. At last, there is a psychometric test which is very simple and easy. the platform is AMCAT/SHL.
In the given linked list, there is a cycle, hence we return true.
Traverse the list individually and keep putting the node addresses in a Hash Table.
At any point, if NULL is reached then return false
If the next of the current nodes points to any of the previously stored nodes in Hash then return true.
If N = 5 and arr[ ] = {1, 2, 3, 4, 5} then output will be 5 1 2 3 4.
If N = 8 and arr[ ] = {9, 8, 7, 6, 4, 2, 1, 3} then output will be 3 9 8 7 6 4 2 1.
Following are steps.
1) Store last element in a variable say x.
2) Shift all elements one position ahead.
3) Replace first element of array with x.
Alok has three daughters. His friend Shyam wants to know the ages of his daughters. Alok gives him first hint.
1) The product of their ages is 72.
Shyam says this is not enough information Alok gives him a second hint.
2) The sum of their ages is equal to my house number.
Shyam goes out and looks at the house number and tells “I still do not have enough information to determine the ages”.
Alok admits that Shyam can not guess and gives him the third hint
3) The oldest girl likes strawberry ice cream.
Shyam is able to guess after the third hint. Can you guess what are the ages of the three daughters?
There are 3 devils and 3 Priests.They all have to cross a river in a boat.Boat can only carry two people at a time.As long as there are equal number of devils and priests,then devils will not eat Priest.If the number of devils are greater than the number of priests on the same side of the river then devils will eat the priests.So how can we make all the 6 peoples to arrive to the other side safely?
Why you made projects based on Android?
Your role in projects?
Is growing of technology suitable for humans?
Would you prefer hard work or smart work?
Who is your inspiration?
What made you choose the IT sector?
153 = 1^3 + 5^3 + 3^3.
Therefore 153 is an Armstrong number.
Which of the following is not an example of DBMS?
a) MySQL
b) Microsoft Acess
c) IBM DB2
d) Google
Consider if ‘N’ = 4, the Factorial of 4 will be the product of all numbers from 1 to 4, which is 1 * 2 * 3 * 4 = 24. Hence, the answer is 24.
This round is all about yourself and some discussion. HR told you everything about the company.
Tell me about yourself.
Why do you want to work for our company?
What are your greatest strengths and weaknesses?
How would you rate yourself on a scale of 1 to 10?
Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
Which array operation has O(n) worst-case time complexity?