Answer / Anubhav Gupta

An array is generally faster than an ArrayList when accessing elements at fixed positions. This is because arrays have constant-time O(1) average-case access.

What is a Stack? Explain with example?

1 Answers  

---

Is Linked List 'linear' or 'Non-linear' data structure?

1 Answers   Accenture,

---

Explain quick sort?

1 Answers  

---

What do you mean by Base case, Recursive case, Binding Time, Run-Time Stack and Tail Recursion?

2 Answers   TCS,

---

Why is data structure important?

1 Answers  

---

Can binary tree have 1 child?

1 Answers  

---

What is a static structure?

1 Answers  

---

Is quicksort a stable algorithm?

1 Answers  

---

Explain recursive function & what is the data structures used to perform recursion?

1 Answers   TCS,

---

What is a hash index?

1 Answers  

---

How is a queue works?

1 Answers  

---

What is sorting with example?

1 Answers  

---