IndustryBuying.com IT System Administrator Interview Questions and Answers

Interview preparation tips for other job seekers - Always be confident before giving the interview and most important is be groomed and well dress .

Round: Test
Experience: An aptitude test which was followed by three rounds of technical interviews and finally the HR interview.

Round: HR Interview
Experience: Snapdeal offered placements for 5 students (3 from CS and 2 from IT).

General Tips: Be extremely well prepared for any company. Research about the company's profile extensively before the company's interview. HR panel always looks for candidates who are well aware of the company in order to measure the candidate's interest. Data structures are absolutely necessary for any company. Improve coding skills through frequent participation in competitive programming arena such as codeForces, codeChef, HackerEarth etc. "Software development job profile was offered to me.
Unnecessary and irrelevant questions are to be avoided. We should raise questions only if we have some genuine questions. However any question related to job profile or location preference could be raised. "
"It was very grueling and tiring at first but the sweet taste of placement makes it all worth it.
Placements are a turning point in everybody's career."
Skill Tips: Snapdeal is more focussed on Data structures and object oriented technology.
For data structures, online materials such as GeeksforGeeks are excellent and in case of OOPS concepts, stronghold in either C++ or java programming language is necessary.
Skills:
College Name: NIT Surathkal

Round: Test
Experience: Keep your Calm
Tips: Practice matters
Duration: 90 minutes
Total Questions: 30

Round: Interview
Tips: They are not going to eat you.. they will help you out only...
So just go inside the interview room as some of your friends called you to ask some question..relax

Skills: Thinking Process
College Name: IIT GUWHATI

Round: Test
Experience: I did both coding question ( 1 full and 2nd partial ) and 5 MCQ only and was shortlisted
Tips: Refer to interview sets on Geeksforgeeks.
Do solve both the coding questions first. Not necessary to pass all test cases for both.
Then go for C based o/p questions. At last aptitude.
Duration: 60 minutes
Total Questions: 23

Round: Technical Interview
Experience: I did not know JAVA and DBMS so could not answer any of the last 2 questions. I told him directly thati had no experience in JAVA / DBMS and justified. I had proficiency in Data Structure and Algorithms and I beleive the interviewer liked my internship work on Cloud / Virtualization
Tips: Focus on Data Strucure-Algorithms, JAVA, DBMS, Puzzles

Round: Test
Experience: All repeated questions from previous interviews.
Tips: Refer interview set from geeksforgeeks.org
Duration: 60 minutes
Total Questions: 3

Round: Technical Interview
Experience: For the first question, I started by exponential solution and reduced it to polynomial. We
discussed various approaches and tried a variety of methods and after
1-1.5 hrs of discussion finally ended up with an O(1) solution with some
pre-processing overhead. After achiveing O(1) time complexity, he asked
to further optimize the space complexity.

Usage of Trie / TST. Internal Implementation of Hashing structure and replacing the hashing mechanism using Trie / TST.
Tips: Focus on Tree, Stacks, Queue, Linked List, Hash Maps, Trie, Hashing, String Algorithms, Ternary Search Tree

Round: HR Interview
Experience: Typical HR

General Tips: Practice programming
Skill Tips: Focus on Data Structure-Algorithms and programming in either C++ / JAVA
Skills: Data Structure, Algorithms, Programing, JAVA, DBMS
College Name: Indian Institute of Information Technology, Design and Manufacturing, Jabalpur
Motivation: -
Funny Moments: -

Round: Technical Interview
Experience: 3.You have a deck of 10 cards.You take one card out and put it on table and put next card in the end of deck.You repeat this sequence till all cards are on the table.Sequence formed on the table is 1,2,3,4,5…10. What was the original sequence of card.After doing some exercise i answered 1,6,2,10,3,7,4,9,5,8.Then he asked me to write a function for this which takes a number and return the array.

Skills: Algorithm, Java, OOP, data structure
College Name: NA

Round: Test
Experience: Online Test-21 (MCQ) +2 (Coding) in 1 hr. Test conducted on hackerrank21 MCQ had almost 10 aptitude and 11 C output based questions.



Give preference to coding questions. Try to solve both questions ( Pass all test cases for one of the questions and do attempt the other question ( even brute force would pass many test cases )



Aptitude can’t be solved just within a minute. Solve C o/p based questions first.Questions-



1. Overlapping paintings, find no. of paintings that can be seen distinctly, extreme co-ordinates of paintings are given. Ordering of paintings matter. ( Assume heights of all paintings are same, start and end coordinates are given )E.g.



5
1 4
2 6
3 4
8 10
7 10


XXXX
XXXXXX
XX
XXX <- This painting is hidden completely
XXXX Simple O(N^2) solution. Starting from rightmost painting, check if it completely hides any painting or not based on start and end coordinates. ( modification of interval selection problem )2- Given points of two lines segments A(x1,y1 x2,y2) & B(x3,y3 x4,y4) find whether the 2 segments intersect or not.



Simpler approach ( short code )-



-----?module=Static&d1=tutorials&d2=geometry2#line_line_intersectionLength / complicated soln-



----- cut-off -



I solved 2nd question and passed 1 test case for first question ( misunderstood the question during online round !! :p ) and solved 4 MCQ's only ( all fluke )



So my advice, do solve both coding questions for sure and solve C o/p questions in last 15 min
Duration: 60 minutes

Round: Technical Interview
Experience: Avg 20-30 mins. 22 shortlisted



My went on for 1 hr to 1hr 15 minsInternship based dicussion (20-30 mins ). Based on Cloud, Virtualization, Networking



Q1- Given N, find LCM from of all numbers from 2 to N. Give the complexity expressed in the form of Number of prime numbers <= N. Had to be really precise in terms of complexity ( in terms of prime factors, maximum recurrences, each recurrence complexity ). Long dicussion on complexity. Don't say any method whose complexity you cannot prove. (E.g saying that i can use Sieve of Eratosthenes for prime pre-processing will lead to question of complexity of Sieve which is O( Log LogN), that cannot be proved trivally. ) So avoid using any such termsQ3- Spring / Hibernate in JAVA



Told him i work in C/C++ only. No experience in JAVAQ2- Types of SQL- NoSQL and SQL(Relational DBMS ). Why the need of NoSQL- Big Data AnalyticsQ3- How would you design DBMS for Snapdeal's website's shoe section.



Now if you want to further break it into Sports and Casual Shoe would you break the DB into two or add another entity ? Full justificdation



I initially answered with a multi-level indexed structure for DBMS storage. Could not answer on the second part of the question. He asked if i knew DBMS and i told him I do not know DBMS. He skipped the question and ended the interview. Told him i had advanced DBMS lab in my course currenlty and would learn it before graduating.

Round: Puzzle Interview
Experience: Q1- -----/



Q2- -----/



Q3- ----- was the first one to solve all 3 in 45 mins roughly and went for next interview. Shortlisting criteria- 2 questions in 1 hr – 1hr 15 mins even though they said that we had 2 hrs to solve all 3 questions !!

Round: Technical Interview
Experience: 4 shortlisted. This round went for almost 1hr 45 min - 2 hrs for me since I solved the Round 2 question earliest. Other 3 had almost 45 mins interview.Q1- Variation of



-----/



Given a dictionary of words and a number n. Find count of all words in dictionary that can be formed by given number n.



I started by exponential solution and reduced it to polynomial. We discussed various approaches and tried a variety of methods and after 1-1.5 hrs of discussion finally ended up with an O(1) solution with some pre-processing overhead. After achiveing O(1) time complexity, he asked to further optimize the space complexity.



Usage of Trie / TST. Internal Implementation of Hashing structure and replacing the hashing mechanism using Trie / TST.Q2- Given an array of elements. We can perform following operation only- Increase an array element. Cost of operation is the amount of increment made per array element. Now for a given H, we need to make any H ( not necessarily consecutive ) elements of array equal with minimum cost.E.g.



N=6, H=4



2 3 5 6 4 4changes to -> 4 4 5 6 4 4



Cost is ( 4-2 + 4-3 = 3 )N=6, H=3



2 3 5 6 4 4changes to -> 2 4 5 6 4 4



Cost is ( 4-3 = 1 )



Optimal complexity- O(N)

Round: HR Interview
Experience: 3 shortlistedTypical HR round.I would like to thank geeksforgeeks for a exhaustive set of interview questions and study material on data structures-algorithms.

College Name: NA