MSc Placement Experience 2018 -19

Placement Preparation:   I started refreshing my programming skills from december (after my 7th semester internship) by solving problems from hackerrank ( my hackerrank profile ). I started my intense preparation from may. I followed the IPL schedule , given by our seniors. Though I couldn't able to cover all the domains listed over there, I have concentrated on programming tasks since I had Data structures as my area of interest.   I have uploaded the programs and concepts ( problems drive link ) and posted a part of it in this blog . SAP Interview experience:   There were 5 rounds   1. online test  2. Technical (panel)  3. Technical (Face to Face)  4. Managerial  5. HR 1. Online test: SAP online test  In the two programming questions I have solved one question (6 out of 9 sample test cases passed) and did mcq quite well.   The test was attended by 500+ students. They shortlisted 18 students.  I got shortlisted in the online test. 2. Technical (panel):   

Date of visit: 30.7.2018 Criteria: CGPA 7 above No current arrear Platform: Hackerrank Duration: 1.15 hrs Overview:    There were 25 MCQ's based on fundamentals like OOPS(both in c++ and java), computer networks, Data structures and Algorithms and also Arithmetic aptitude questions (probability, time and work..). There were different sets both the MCQ's and programming problems were either completely different or shuffled. MCQ 1. Given a circular queue how many additional pointers are needed to perform enqueue and dequeue in O(1) time.     2. Regarding method overloading and method  overriding. 3. How many static methods are created for a class (common for class, individual for objects..) 4. class xyz{} what is the size of this class 5. Given an array how many swaps are performed in bubble sort 6. i = 5 , j= 2  System.out.print(i<<j, i>>j) 7. #define numbers 2 + 3    code: res = numbers * numbers . Guess the output. Coding: 1. Triplets

Date of visit: 25.7.2018 Criteria: CGPA 7 above (there was no restriction reg. current arrears) Platform: Hackerearth  Duration: 2.30 hrs Objective 10 questions: ( with varying weightage of 6 to 4 points) The questions were based on data structures and algorithms. Que 1 : Given an expression like this "*+pq-rs", you have to write the postfix version of the expression. Ans: pq+rs-* ( explanation ) ------------------------- Que 2 : For a given set of integers, where N is no. of elements in the set, choose a data structure with O(logN) to find the minimum element in the set and to insert a new element in the set which is not already present. Options : (min-heap, binary search tree, binary tree..) Ans: AVL-Tree ( Solution ) ------------------------- Que 3 : For a given postorder traversal of a tree (10, 9, 23, 22, 27, 25, 15, 50, 95, 60, 40, 29), find the inorder traversal for the given. Ans: <try to solve it, and if done just update the answer.> --

Date of visit: 18.7.2018 Criteria: CGPA 7 above no current Arrear Platform: cocubes Duration: 1.15 mins Overview:     There were three questions in total. There were some three to four question sets with the problems shuffled. Each set consisted of   a 2 marks question, 3 marks question and 5 marks question. Questions: SET -1 1. Word average: Given a word as input you have to find the average of the word. It is calculated by the ascii values all the characters present divided by the total number of characters. Sample Input:      source Sample Output:  109.5 Explanation: Ascii value of  s is 115 Ascii value of o is 111 Ascii value of u is 117 Ascii value of r is 114 Ascii value of c is 99 Ascii value of e is 101                    Total = 657                    Average = total / string_length = 657 / 6 = 109.5 2. Given a linked list , write a function to reverse every k nodes (where k is an input to the function). Inputs: 1->2->3->4->