What is a map in programming?

0 Answers  

---

Explain how is linked list implemented?

0 Answers   BPL,

---

Is complete binary tree?

0 Answers  

---

Which is more efficient merge sort vs quicksort?

0 Answers  

---

What is data and data types?

0 Answers  

---

I am given a sequential algorithm that does a routine search on an unordered list. N = 20. The probability that the value x does NOT appear in the list is exactly 60%, and the probability that x DOES appear is 40%. The 3 questions that I could not get were: A) What is the avg number of element comparisons performed when n = 20 and x does NOT appear in the List. (my answer was 20, is this correct?) B) What is the avg number of element comparisons peformed when n = 20 and x DOES appear in the list? C) What is the avg number of element comparisons performed when n = 20. This should be a single number answer they said.

3 Answers  

---

Explain the Array

0 Answers   Tech Mahindra,

---

Are linked lists considered linear or non-linear data structures?

0 Answers  

---

What stack means?

0 Answers  

---

Explain data structure

1 Answers   Accenture,

---

What are the Difference between tcp and udp?

0 Answers  

---

Are sets sorted?

0 Answers  

---