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  

---

Does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes?

1 Answers  

---

What are the categories of avl rotations?

0 Answers  

---

What is adt and its advantages?

0 Answers  

---

Convert following infix expression to the prefix expression. a - b + c * (d / e - (f + g))

33 Answers   Amazon, Microsoft, Star Technologies, Sun Microsystems, Wipro,

---

What are the tasks performed during inorder traversal?

0 Answers  

---

What is dequeue in data structure?

0 Answers  

---

Is hashmap get thread safe?

0 Answers  

---

What are the difference between arraylist and linkedlist from the perspective of sorting?

0 Answers  

---

For addition and deletion. Which one is most preferred: array list or linked list?

0 Answers  

---

Explain the term run-time stack?

0 Answers  

---

why it is difficult to store linked list as an array?

1 Answers  

---