Answer / gokul s

n=6:
(1, 1)
(2, 1)
(2, 2)
(3, 1)
(3, 2)
(3, 3)

n=8:
(1, 1)
(2, 1)
(2, 2)
(3, 1)
(3, 2)
(3, 3)
(4, 1)
(4, 2)
(4, 4)
(4, 4)

n=10:
(1, 1)
(2, 1)
(2, 2)
(3, 1)
(3, 2)
(3, 3)
(4, 1)
(4, 2)
(4, 3)
(4, 4)
(5, 1)
(5, 2)
(5, 3)
(5, 4)
(5, 5)


b) Time complexity is ((n/2) * (n/2)+1)/2

Give an example of an O (n) algorithm and O (n*n) algorithm such that the algorithm is slower.

1 Answers   Aspiring Minds,

---

Give a general algorithm for converting a m-array tree to a 2-ary tree.

1 Answers   Tech Mahindra,

---

Which is the most straight forward approach for planning algorithms?

1 Answers  

---

what are the minimum requirements for statr testing?

1 Answers   QA,

---

Define Routing Algorithm?

1 Answers   Maveric,

---

What is the bidirectional search algorithm?

1 Answers  

---

Write an algorithm to traverse a knight covering all the squares on a chessboard starting at a particular point.

1 Answers   Amazon,

---

Tell us how will you know which machine learning algorithm to choose for your classification problem?

1 Answers  

---

Tell me how do you choose an algorithm for a classification problem?

1 Answers  

---

what is software cycle?give a diagramatic representation

1 Answers  

---

Draw a flowchart to find the average of four number?

1 Answers  

---

Give an algorithm for the following problem. Given a list of n distinct positive integers, partition the list into two sublists, each of size n/2, such that the difference between the sums of the integers in the two sublists is minimized. You may assume that n is a multiple of 2.

1 Answers  

---