Answer / Abhinav Kumar Srivastav

Arrays and linked lists are both data structures used to store collections of elements, but they differ in their implementation and performance characteristics. An array is a contiguous block of memory where each element has a fixed offset from its address. Arrays offer constant time O(1) access to elements using indexing, but have limitations on dynamic size changes as they require reallocating memory. A linked list, on the other hand, consists of nodes that store data and references to the next node in the sequence. Linked lists allow for dynamic insertion and deletion of elements with average time complexity O(1) for insertions at the end (append) and O(n) for insertions at arbitrary positions or deletions, but have slower access times due to the need to traverse through nodes.

How is knn different from k-means?

1 Answers  

---

What is the standard approach to supervised learning?

1 Answers  

---

Explain what is a recommendation system?

1 Answers  

---

Can you explain bias-variance trade-off?

1 Answers  

---

How do you control for biases?

1 Answers  

---

What was bayes’ theorem? How was it useful in a machine learning context?

1 Answers  

---

Which is best language for machine learning?

1 Answers  

---

How is decision tree pruned?

1 Answers  

---

What is the convex hull?

1 Answers  

---

Why machine learning is popular now?

1 Answers  

---

What are the classification problems in machine learning?

1 Answers  

---

Which classifier is best in machine learning?

1 Answers  

---