Answer / Asheesh Kumar Poothia

Here is an example of implementing the quicksort algorithm in Python:nn```ndef quicksort(arr):n if len(arr) <= 1:n return arrn pivot = arr[len(arr) // 2]n left = [x for x in arr if x < pivot]n middle = [x for x in arr if x == pivot]n right = [x for x in arr if x > pivot]n return quicksort(left) + middle + quicksort(right)``

What is a z test?

1 Answers  

---

What is cluster sampling?

1 Answers  

---

What do you understand by term hash table collisions?

1 Answers  

---

How many dentists are there in US?

1 Answers   Facebook,

---

Is anaconda free?

1 Answers  

---

How will you test that there is increased probability of a user to stay active after 6 months given that a user has more friends now?

1 Answers   Facebook,

---

How much ram do I need for data science?

1 Answers  

---

Explain the difference between an analyst and a data scientist?

1 Answers  

---

You have two tables-the first table has data about the users and their friends, the second table has data about the users and the pages they have liked. Write an SQL query to make recommendations using pages that your friends liked. The query result should not recommend the pages that have already been liked by a user.

1 Answers   Facebook,

---

Name the methods for General component analysis and explain them?

1 Answers  

---

List out the libraries in python used for data analysis and scientific computations?

1 Answers  

---

What prior subject is required to become a data analyst?

1 Answers  

---