Technology Analyst Interview Questions
12T
Technology Analyst interview questions shared by candidates
Load a file using Pig which has a custom field delimiter and line terminator
12 Answers↳
You need to write a UDF for Load extending the class LoadFunc
↳
Short Term goals:bug discovery,bug prevention Long Term goals:quality,risk management,customer satisfaction Less
↳
no comments
Are you willing to work 80 hours a week?
6 Answers↳
I just got hired there as a bra, easily willing to work the 80 hours. Never saw a company that treats you with so much respect and trust right out of the gate. Also spend a lot of money per employee in technology which most people don't know and don't care about. I know and appreciate it as even if a company has the money, most won't spend it. Deloitte realizes their people are their biggest asset. Less
↳
It depends on a person to person - if a resource is efficient and having skill to automate, the 16 hour work for a normal resource can be done in less than 8 hours ! Less
↳
No, I am not interested in working for a company that doesn't value life/work balance. Thank you for your time and good day. Less
An analytical question about: Say you have ten stacks of coins with ten coins in each stack, each coin weighing 1g. However, one of the stacks has 2g coins instead of 1g coins. If you have a weighing scale and can only make one measurement, how do you determine which stack of coins weighs 2g each coin?
6 Answers↳
It's simple. Take 1 coin from the first stack, 2 coins from the second, 3 from the thirds - you see where this is going - finally 10 from tenth stack. put them on weighing scale. If in result you get 56 - it was first stack, 57 - second.... 65 - tenth stack. Less
↳
1-If all the coins are made from the same material and same diameter, then the heavier coin stack should be slightly taller. 2- Weight all the stacks at once, and remove each stack until you see a dip in the tota weight . Less
↳
I didn't quite understand what you meant. So there are 10 coins, 9 weigh 1 gram, and one weighs 2 grams? The second sentence seems contradictory. If you can only make one measurement, then you would divide the stacks into two. Place each stack on either scale, and whichever one is heavier contains the 2g coin. Less
A company has acquired many other companies resulting in multiple transaction and report generating systems and technologies within the main company resulting in a $10 million maintenance bill. As a consultant how would you integrate all the technologies and reduce the maintenance costs.
5 Answers↳
Tech interview frameworks are pretty simple as they are few in number. For this question I applied the implementation strategy framework which turned out to be right. But please do not jump to a conclusion right away. I had to ask many questions and I eventually managed to whittle down the problem to that of an effective and common data management solution where the interviewer offered me multiple choices and I decided to go with the ERP system. And then she asked me how I would go about installing it in multiple offices across the world and in a given time frame etc....It was pretty straightforward from that. The important takeaway is frameworks are important but do not be bound by them. And they do not look for a right or wrong answer from you, but instead study your thought process and your approach to problems you have no idea about...Hope this helped. Best of luck!! Less
↳
What other frameworks are there in tech interviews?
↳
What framework did you use in this case? I'm pretty new to case interview, and feel the frameworks are mostly about profit or market. How to use them in tech case interview? Thank you!! Less
Design an efficient algorithm that checks if a LinkedList, that holds a trillion elements, is circular or not.
5 Answers↳
The stack overflow answer, Tortoise and hare algorithm, of having a fast and slow node traversal is best as it's O(n). The other answers doesn't make sense because if you knew what the last node is, then you've already proven if it's circular or not. Without the benefit of google, I think logically, checking addresses or setting some sort of checked flag for every single node are both acceptable answers as they are O(n) but not as memory efficient O(1) vs. O(n). Personally, it would be very suspicious if someone tries to make it as if they came up with Floyd's algo right on the spot as there are math proofs that needs to be done. Hard to say which is the better answer, since the googled answer just proves that you're good at memorizing stuff vs. the more inefficient answer but that proves you understand performance and linked lists. Less
↳
I feel like this is very simple, but my solution is expensive memory-wise. Simply make use of a hashset and add elements as you iterate through the list. If you have a hash collision, there is a loop. Less
↳
Make two pointers that will through the array the first one jumping one step and the second two steps each loop. If they ever meet again that means it's circular. Less
How to find whether a linked list has a loop within it.
5 Answers↳
Use 2 pointers, varying the speeds of both. If at sometime they meet each other, that means there exists a loop, else if the reach the end of linked list that means there does not exists a loop. Less
↳
The previous answer has an indefinite worst case running time, which usually is something you want to avoid. You can search through the list once adding the pointer addresses to a hashmap. If ever you reach an address that already exists in the hashmap, then there is a loop. In the worst case you have to read through the whole list once. On average, you have to read (n+1)/2 elements. Less
↳
While traversing the list from the starting node, you can leave a mark behind, if you encounter a mark in a node, then it's linked. If you reach the end without finding your mark, then it is not linked. Less
Why are man-hole covers round?
5 Answers↳
I would also think so that they can be rolled instead of carried when being moved. Less
↳
Because that is the standard.
↳
Because cars are not
Why Accenture?
4 Answers↳
Job description
↳
To learn and contribute to achieve the success of Accenture
↳
Best company profile i ever heared
Out of 25 horses, pick the fastest 3 horses. In each race, only 5 horses can run at the same time. What is the minimum number of races required?
4 Answers↳
I believe there are six. After you determine the fastest 5 out of the 25 you can just have one more race and choose ranking 1, 2, 3 Less
↳
Only 5. Becuase after 5 races, I have time performance of all 25 horses. I simply select the 3 best! Less
↳
You need 7; first 5 races to determine ranking among groups of 5, then you can race the winners from each 5 group and that will give you the fastest one. Then to get 2nd and 3rd horse, you need one more race. So in total 7. Less
In JavaScript how can you have the statement: if(a==1 && a== 2 && a==3) evaluate to true?
4 Answers↳
didnt know.
↳
var a = 0; if(++a==1 && ++a== 2 && ++a==3) // returns true
↳
<p></p> const a = { num:0, valueOf: function(){ return this.num +=1; } }; const equality = (a==1 && a ==2 && a==3); document.getElementById("demo").innerHTML = equality; Less