Q#1: An algorithm is made up of 2 modules M1 and M2.If order of M1 is F(n) and order of M2 is g (n) then what is the order of the algorithm. Q # 2 : How many binary trees are possible with 3 nodes? with 4 nodes?

4 Answers  

---

Give us a program to reverse a linked list.

0 Answers   DELL, Genpact,

---

What is the logic to reverse the array?

0 Answers  

---

How do you find the height of a binary tree?

0 Answers  

---

What is dangling pointer and how to avoid it?

0 Answers  

---

---

Write a program using mergesort technique.

0 Answers   iNautix,

---

What do you know about different sorting algorithms?

0 Answers   Zomato,

---

What are the types of Collision Resolution Techniques and the methods used in each of the type?

1 Answers  

---

What is the bucket size, when the overlapping and collision occur at same time?

1 Answers  

---

Why is treeset sorted?

0 Answers  

---

ple.. briefly describe the purpose of having a base case and a recursive case in a recursive algorithm

2 Answers  

---

What is the use of data structure in real life?

0 Answers  

---