How helpful is abstract data type of data structures?

0 Answers  

---

Is boolean a data type?

0 Answers  

---

Is array faster than arraylist?

0 Answers  

---

What are the types of map?

0 Answers  

---

Is hashmap synchronized?

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  

---

What is a postfix expression?

0 Answers  

---

Explain the types of linked lists.

0 Answers  

---

How does variable declaration affect memory allocation?

0 Answers  

---

Now you are given an array of a characters (both ASCII and Kanji) and, an index into the array. The index points to the start of some character. Now you need to write a function to do a backspace (i.e. delete the character before the given index).

0 Answers  

---

Can we modify final arraylist?

0 Answers  

---

What is difference between stack and queue?

0 Answers  

---