TARGET

Computer Based Online Recruitment Test (on AMCAT) The test had 3 sections :
1. Aptitude and Logical Reasoning(12questions-15min)
2. CS core subject questions [mainly on DSA, OOP, OS, Networks](12questions-15min)
3. 2 coding questions (1hr) -medium level

Round 1:(Technical) 1hr(2 interviewers)
1.Brief us about your resume
2.explain your project
3.shared 2 problems-to write the code for them and time complexity (we can explain the different approaches brute force to optimal solutions)
​Given three sorted arrays find the common elements btw them and count the no. of times each gets repeated
​string manipulations -java string methods
4.subjects u are comfortable with
5.wt is stack, queue, priority queue
6.diff btw list and array
7.to frequently search an element from list or array which data structure is better
8.binary search tree, balanced tree
9.while creating stack and queue which ds is better array or linked list and why
10.have u ever faced situation when u run out of space(recursion)
11.puzzle:there are 2jugs with 4l and 5l pour exactly 7l water in bucket
12.wt is normalization -diff btw 1NF,2NF,3NF,BCNF
13.wt are ACID properties
14.wt are the constraints, why do we need user-defined constraints
15.wt if constraints are violated, Wt happens
16.wt are cascading effects
17.diff btw union and union all
18.how will you filter duplicate records from table
19.wt is inner join, outer join
20.wt is inner query-syntax
21.do u have any questions from us

Round 2:(Technical+Behavioral)-1hr(2 interviewers)
1.introduce yourself
2.write a program to identify anagrams and explain different approaches and which has better time complexity
3.wt are the different sorting algorithms,why we use sorting and searching algos
4.explain each sorting algorithm and where they would be useful, specific use for specific algo(insertion,selection,bubble,
quick,merge, heap sort-advantage and disadvantages and instances where each algorithm is used )
5.write the program to implement merge sort and explain the code and time complexity separately for the merge and mergesort -used divide and conquer
6.algo for quick sort
7.time complexities for each sorting algorithm -best, worst, avg
8.similar kind of questions from DBMS as previous round
9.where would you see yourself after 5 years(suggests u to share ur future plans as well )
10.wt would be ur take on delivering project -taking more time ,complete the whole modules &release or release as modules one after other
11.if u are team lead and there are some bugs not resolved by teammate, will u take responsibility on his/her behalf
12.wt do you know about target (pay attention during pre-placement talk and note some important facts, numbers-scope to impress )
13.what are your strengths
14.how are you different from others (Wt’s unique in u)
15.do you wish to work only in tech side or want to explore even other areas(areas of interest)
16.wt are ur hobbies
17.how the work u are doing is helping the customer -end user
18.oops concepts, static, abstract, interface
19.do u have any questions

Overall my experience was really good.comfortable to express my ideas because they are happy to help by giving hints,value ur ideas.Just be confident, speak out, explain ur thoughts while coding and learn basics well along with some real time applications