Vserve Ebusiness Solutions Interview Questions and Answers

Brownian motion is the random motion of particles in a fluid due to collisions with other particles.

• Brownian motion was first observed by Robert Brown in 1827.

• It is named after the botanist Robert Brown.

• The motion is caused by the random movement of fluid molecules.

• Brownian motion is a continuous-time stochastic process.

• It is often used to model various phenomena in physics, finance, and biology.

• Properties of Brownian motion include random walk, Gaussian distribution, and sel...read more

A Martingale is a mathematical concept used in probability theory and statistics. Markov Processes are stochastic processes that satisfy the Markov property.

• A Martingale is a sequence of random variables where the expected value of the next variable, given the current and past variables, is equal to the current variable.

• Markov Processes are stochastic processes where the future state depends only on the current state and not on the past states.

• A Martingale is not necessarily ...read more

Find missing number from 1 to n without using extra space and O(n) tc

• Use XOR operation to find the missing number

• Iterate through the array and XOR each element with its index and the result

• The missing number will be the final result after XORing all elements and indices

I handle big data by using advanced analytics tools and techniques to extract valuable insights.

• Utilize data visualization tools like Tableau or Power BI to analyze and present data

• Use programming languages like Python or R for data manipulation and statistical analysis

• Implement machine learning algorithms to uncover patterns and trends in large datasets

• Leverage cloud computing platforms like AWS or Google Cloud for scalable data processing

• Ensure data quality and integrity th...read more

Sorting algorithms are methods used to arrange elements in a list in a specific order.

• Bubble Sort - compares adjacent elements and swaps them if they are in the wrong order

• Merge Sort - divides the list into smaller sublists, sorts them, and then merges them back together

• Quick Sort - selects a 'pivot' element and partitions the list into two sublists around the pivot

• Insertion Sort - builds the final sorted list one element at a time by inserting elements into their correct pos...read more