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

What’s your favorite algorithm, & can you explain it into me in less than a minute?

0 Answers  

---

what is software cycle?give a diagramatic representation

0 Answers  

---

Explain me what's your favorite algorithm, and can you explain it to me in less than a minute?

0 Answers  

---

What is the depth-first search algorithm?

0 Answers  

---

What is the breadth-first search algorithm?

0 Answers  

---

A lot of questions were asked on sorting for eg. Best algorithm on the basis of number of swaps, number of comparisons etc.

0 Answers   DELL,

---

What is iterative deepening depth-first search algorithm?

0 Answers  

---

Write the Shortest path algorithm for a graph.

1 Answers   Tech Mahindra,

---

Consider the following algorithm, where the array A is indexed 1 through n: int add_them ( int n , int A[ ] ) { index i , j , k ; j = 0 ; for ( i = 1 ; i <= n ; i++) j = j + A[i] ; k = 1 ; for ( i = 1 ; i <= n ; i++) k = k + k ; return j + k ; } (a) If n = 5 and the array A contains 2, 5, 3, 7, and 8, what is returned? (b) What is the time complexity T(n) of the algorithm?

0 Answers  

---

Name search algorithm technology?

0 Answers  

---

Tell briefly about the Banker's algorithm and what is it used for?

0 Answers   Impetus,

---

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

0 Answers   Tech Mahindra,

---