TI Round 1: 1.Put and patch difference 2.What is difference between relational and non-relational database ? 3.For messenger application which database I can choose ? 4. given two tables - student: id, name, marks grade: minrange, maxrange, gradename perform query for: 4.1: creating these tables 4.2: return name, gradename sorting by marks if same by alph order except gradename=c 5.Real life examples of OOPs pillers : Laptop 6.what are scheduling algorithms 7. write code for second smallest element in array Round 2: 1.previous work in detail 2.what is IOC in spring 3.what is dependency injection 4.Trigger and procedure in SQL 5.delete vs truncate cmd 6.what are types of joins 7.is usage of join a good practice 8.what is alternative for join 9.Puzzle: 8 balls problem weighing machine 10.what is algorithm 11.what are qualities of program to be an algorithm 12.what is big O 13.which searching algorithm is efficient and why 14.stack vs queue and real life examples of stack and queue 15.what is double linked list and it's real life example. 16. tell approach for : 1234 is input array and return 1234 using stack

1st Technical Interview A little discussion on programs in Written Exam, During the interview, I was asked to write the Delete Nth node from Linked List on paper. Most of the questions were on pointers, Some SQL queries. 2nd Technical Interview Database designs. Few questions on the Project last worked on, Few questions on Project DB design, and then they added some more requirements in my project and asked me to redesign the DB according to modified requirements.