Answer / Prashant Shukla

The complexity of an algorithm can be found by analyzing its runtime behavior, usually in terms of Big O notation. This involves counting the number of basic operations (like comparisons or assignments) as a function of the input size.

What is doubly linked list in data structure?

1 Answers  

---

List the area of applications where stack data structure can be used?

1 Answers  

---

What is a node in it?

1 Answers  

---

Is there any difference between int[] a and int a[]?

1 Answers  

---

Why arraylist is not efficient for manipulation?

1 Answers  

---

What does sorting an array do?

1 Answers  

---

Explain the Queue

1 Answers   Tech Mahindra,

---

Define primary data structures?

1 Answers  

---

What are different techniques for making hash function? Explain with example.

1 Answers  

---

What is meant by heap sort?

1 Answers  

---

Does list allow null values?

1 Answers  

---

Why is it important to sort waste?

1 Answers  

---