ROUND 1: Online aptitude+coding in HirePro Platform

• Section 1: General Aptitude questions were from: ✓ Quants (find profit, find age, find age, find avg weight, ratio) ✓ Ratio and percentage take more time. ✓ Piecharts and Graph interpretation of probability takes more time.

• Section 2: Technical Aptitude questions were from: ✓ Networking – devices, OSI layers, duplex. ✓ Cloud – characteristics, types, advantages, disadvantages. ✓ DSA - binary tree, stack. ✓ C++ - passing and returning objects, goto, virtual function. ✓ Java - packages, class, rules of inheritance. ✓ Python output questions, inbuilt functions. ✓ C output questions, keywords. ✓ OS - fragmentation, deadlock.

Section 3: Coding (Choose two languages: C or C++ or Java or Python)

✓ MY CHOICE-1: C language (2 Qns from C): One was very easy. Find factors of given number. Example: Input: n=100 Output: 1 2 4 5 10 20 25 50 100

Other one was medium: Given a matrix, replace each element of the matrix that are not divisible by 5 with the immediate next number that will be divisible by 5. Example: Input matrix: Output matrix: 1 13 15 5 15 15 10 21 16 10 25 20 87 33 105 90 35 105

✓ MY CHOICE-2: Java language (2 Qns from Java): One was very easy. Print all unique elements in an array. Example: Input: arr[ ] = {12, 10, 9, 45, 2, 10, 10, 45} Output: 12, 10, 9, 45, 2

Other one was again medium difficult. Count of n digit numbers with sum k. Example: n digit number with sum of digits=k Input: n = 2, k = 5 Output: 5 Explanation: Numbers are 14, 23, 32, 41 and 50.

ROUND 2: Technical Interview - Online in MS Teams meeting

(27 shortlists from the Online test) Panel consists of Two members. Session duration: 1 hour.

• Firstly, the Panelist introduced themselves and asked me to introduce myself. Then I stated my area of interest as Networks and Object-oriented programming with Java. • I also mentioned I know socket programming in Java. I explained TCP and 3-way handshake and demonstrated how to program TCP socket programming in Java. Tip: Share your screen and demonstrate the working of Chat server and client server. • Explain about your project – I had one on image processing and one more on GPS and GSM based vehicle tracking system. How does a GSM communication work? • Qns from Computer Science theory: i. Basics of operating systems: I told them I am not familiar with. ii. Computer networks: I answered every sort of question like diff btw tcp/udp, what does a switch do? working of DHCP. iii. Computer architecture: What is a cache? What does a compiler do? • What do you know about HPE Aruba and HPE Values? Tip: Know about HPE and their projects. • They also checked for how you react when you are given a tough problem and how well you are communicating your clarity of ideas. • The session ended when the panelist asked if you have any questions.

ROUND 3: Managerial Round - Online in MS Teams meeting

(17 shortlists from the Technical) One to One Round Session duration: 30 mins.

• The interviewer came so late; I had to wait at the link. A test for patience.

• He asked me to introduce myself. After I did introduce, he again switched off his camera and acted busy. I was sitting with my cam On. A test for patience.

• He then asked if I like SQL. I am very much weak in SQL, but I did not admit that; instead, I tried saying I like Java, C, and even C++ but I am not really comfortable at SQL. A test for patience.

• He gave a link and then asked me to write code for finding the length of a string. I wrote in the link provided. I executed, still I didn’t get any output. He asked me to do debugging by explaining line-by-line what the code does. I did that too; we tried debugging in many ways. Then I suggested him to execute in my compiler. I executed, and the output came. A test for patience.

• Then he asked about my extracurricular activities and my eagerness in that. That’s all the session ended with me asking questions to him. It was planned to be 30 mins but was hardly not more than 15 mins. Tip: Don’t lose your patience, be cool, smile as you communicate, face the problem boldly.