Answer / Mohd Danish

An acyclic graph (DAG) is a graph which does not contain any cycles, meaning it is impossible to start at any vertex and return to that same vertex by following the edges.

What are the advantages of linked list?

1 Answers  

---

How do you find the depth of a binary tree?

1 Answers  

---

Advanced problems related to Data Structures were asked

1 Answers   Motorola,

---

Define non linear data structure.

1 Answers  

---

What is static array?

1 Answers  

---

What is merge sort and how it works?

1 Answers  

---

How does variable declaration affect memory allocation?

1 Answers  

---

What is the difference between list, set and map?

1 Answers  

---

How does dynamic memory allocation help in managing data?

1 Answers  

---

Explain about set and their types in a collection?

1 Answers  

---

Explain about Merge Sort?

1 Answers  

---

What is binary tree used for?

1 Answers  

---