Answer Posted / hemant belwal

linear search=n/2
binary search=iog2n,2 in the base of log.

Why is sorting and classifying important?

465

---

What is adt example?

549

---

What do you mean by linear probing?

594

---

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

576

---

You are given a singly linked list. How would you find out if it contains a loop or not without using temporary space?

689

---

---

What is sort order?

492

---

What is mergesort and hashtable?

648

---

How is a hashset implemented?

473

---

Explain stacks and queues in detail.

730

---

Is hashmap a collection?

519

---

What is array and its types in data structure?

500

---

Mention the data structures which are used in graph implementation.

470

---

What is stack and queue in data structure?

478

---

What is adt and its advantages?

568

---

What are the difference between malloc() and calloc()?

558

---