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  

---

What is a pseudocode example?

0 Answers  

---

What's the difference between a hashtable and a hashmap?

0 Answers  

---

Model a data structure for a DFA that takes an event as parameter and performs a desired action.

0 Answers   Adobe,

---

Does hashset guarantee order?

0 Answers  

---

What is meant by linked list?

0 Answers  

---

Write a recursive c function to calculate the height of a binary tree.

0 Answers  

---

Define right-in threaded tree?

0 Answers  

---

what is the need of data structure

11 Answers  

---

How do you find the complexity of a selection sort?

0 Answers  

---

Write a data structure for a queue.

0 Answers   Tavant Technologies, Zensar,

---

Can arraylist hold different types?

0 Answers  

---