Associate scientist Interview Questions | Glassdoor.co.in

# Associate scientist Interview Questions

1,530

associate scientist interview questions shared by candidates

## Top Interview Questions

Sort: RelevancePopular Date

### Data Scientist at Human Resocia was asked...

2 Sep 2019

11 Sep 2016
 1. Given an empty BST consist of n nodes and and an array consist of n numbers. The n nodes in a BST have been already arranged in some fashion(i.e. the BST is not empty), and none of the nodes in BST are having any data, that means we have to pick the n numbers from the given array and have to fill in the given BST. We have to make sure that the structure of the BST doesn't change. That means all the left subtree and right subtree at any given node should not change at all. 2. We have a function which returns a value among {1, 0, -1}. When the function returns -1 that means we have to terminate. we have to keep on calling this function and till we get -1. this means we will get series of 1's and 0's which we have to treat like bit pattern and has to check whether the given number is divisible by 3 or not. for e.g. the function call returns the below output. 101-1=> 101=> it's a 5 which is not divisible by 3.4 AnswersI have answered the second question saying that we can keep storing the 1's and 0's in a vector and the moment we hit -1, we will reverse iterate the vector and can get the integer number out of the bit stream and can see whether %3 is zero or not. he told me to optimize the program in terms of space and time complexity. I told we can compress the bit stream in such a way so that when we have continuous 1's and 0's can be replaced by only single 1's and 0's. He was not satisfied with the answer.Keep dividing while storing stream e.g - 10101-1 will be like 1 -> 1 0 -> 10 1 -> 101(5) divided and remain 10 0 -> 100 (4) divided and remain 1 1 -> 11(3) divided and remain 0For Question1 : Traverse BST in inorder store into node array. Sort integer array given. Now iterate both array simultaneously & update node value with the value at same index in integer array.Show more responsesQuestion 2 is damn easy and can be done in o(1) space complexity:- This is basically a conversion of base-2 to decimal base-10 . int finalNum = 0; keep reading the val of (1's and 0's till we hit -1), for each received input, follow the below logic. finalNum = 2 * finalNum +

### Scientist/Engineer 'SC' at Government of India, Department of Space, Indian Space Research Organisation was asked...

25 Aug 2013
 How do you design a pipeline (to a distant village)? Main factors u take care? u would go for laminar or turbulent flow4 AnswersI was selected as one of the 4 from mechanical total 19 were selected from Electronics They also recruit from telecomunication and computersI think turbulent is the answer,Because of more volume flow rate of waterFirst of all, Turbulence is taken into account as the velocity of flow is higher (Reynold's no. increases). Now, the factors are : How much long the pipeline must be? Friction Loss No. of Bends and Power required to send it to the datum position.Show more responsesFor design of pipeline we would need to consider the amount of frictional head loss. The flow will be turbulent nature . The dia of the pipe would be large enough to minimise head loss. Also we need to ensure that the roughness value of the pipe is minimum. Since water is not used all the time and closure of tap can lead to water hammer that situation should be addressed by gradual closure of valves within the pipeline. From the manufacturing feasibility we cannot have a continuous pipe. So we need to weld each segment of pipes.

### Scientist/Engineer - SC at Government of India, Department of Space, Indian Space Research Organisation was asked...

16 Aug 2014

17 Feb 2018
 Desgin a search system for a document search.3 AnswersUse Trie data structure or any graph based representation.take a map with string and vector in cpp, and store positions of a particular element in vector, the best part vector will be sorted.take a map with string and vector in cpp, and store positions of a particular element in vector, the best part vector will be sorted.

14 Mar 2018

29 Apr 2017

### Scientist/Engineer - SC at Government of India, Department of Space, Indian Space Research Organisation was asked...

12 May 2013
 What is the size of Ethernet packet frames and why is it so? How does it help synchronization?3 Answers1585 bytes for synchronization (Couldn't answer why the exact number)A data packet on the wire is called a frame . The frame ends with a 32-bit which is used to detect corruption of data in transit. Types OF Ethernet There are 3 types of Ethernet available in the market right now. 1. Traditional Ethernet – 10 Mbps 2. Fast Ethernet – 100 Mbps 3. Gigabit Ethernet – 1000Mbps A general requirement for SyncE was that any NE should have at least two reference clocks, and in addition, Ethernet interfaces must be able to generate their own synchronization signal in case they lose their external reference. If such is the case, it is said that the Ethernet Node (EN) is in holdover. The synchronous signal must be filtered and regenerated by PLL at the Ethernet nodes since it degrades when passing through the network.Size of ethernet frame is ranges from 72 to 1526 bytes and in the the frame structure first field preamble which is of size 7 bytes and second field start frame delimiter(SFD) which of size 1 byte are used for the sychronization between sender and receiver. SFD bit format is xx110011 which indicate the start of actual data.So that by getting those bits the receiver is alert and receiver the actual data without any problem.

### Data Scientist at Fidelity Investments was asked...

21 Dec 2017
 What is AUC? What lies on x-axis and y-axis of AUC curve?3 AnswersTPR and FPRTPR on y-axis and FPR on x-axisAUC (Area Under the Curve) can be anything.. ROC has TPR and FPR

### Computer Scientist at Belzabar Software Design was asked...

30 Jun 2012
 Find an element from a rotated sorted array.2 AnswersIt's a variation of binary searchtry to imagin the graph . . . .if the previous array was in increasing order then after rotation the two sub aarays will also be in increasing order except one sudden fall . . O(log n/2)
110 of 1,530 Interview Questions