cool.He asked me about quick sort algorithm.I explained him the overview.Then he asked me to write it on paper.I did well.Then he asked me to code and trace using an example.It went well.Then basic questions on HTML.Joins in DBMS

Rounds were very hard .Tested us on all departments.for eg This round had 3 questions and was hosted on cocubes.We had 75 mins to code. 1) Given an array containing integers, zero is considered an invalid number and rest all other numbers are valid. If two nearest valid numbers are equal then double the value of the first one and make the second number as 0.At last move all the valid numbers on the left. Eg: Input : 2 4 5 0 0 5 4 8 6 0 6 8 Output : 2 4 10 4 8 12 8 0 0 0 0 0 2) In a given linked list which contains zero values in some nodes calculate sum of values between two zeros and replace the zero value in the linked list by that sum. Eg: 7 0 4 5 6 0 1 1 will become 7 15 1 1. The zeros are always present in pairs.