Answer Posted / ankita dey

Linear Search-O(n)
Binary Search-O(log n)

What is the easiest sorting method to use in data structures?

559

---

Construct a doubly linked list using a single pointer in each node?

547

---

Name two algorithms two find minimum spanning tree?

544

---

Difference between calloc and malloc in data structures?

513

---

Can arraylist be empty?

464

---

---

Given M x N matrix with sorted elements row wise and column wise, find elements?

544

---

What is a list of lists?

516

---

How do stacks work?

513

---

Does hashset guarantee order?

470

---

What is sorting an array?

498

---

Define a binary search tree?

563

---

How many parts are there in a declaration statement using data structures?

480

---

Is pointer a variable?

505

---

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

511

---

What exactly is data?

520

---