Consider the following algorithm: for ( i = 2 ; i <= n ; i++) { for ( j = 0 ; j <= n) { cout << i << j ; j = j + floor(n/4) ; } } (a) What is the output when n = 4 (b) What is the time complexity T(n). You may assume that n is divisible 4.

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 the bidirectional search algorithm?

0 Answers  

---

Write a code/algorithm to find the frequency of each element in an array?

0 Answers   ITC Indian Tobacco Company,

---

What is the breadth-first search algorithm?

0 Answers  

---

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

0 Answers   Impetus,

---

Given a sorted array of n integers that has been rotated i(unknown) number of times, give a (log n) algorithm that finds an element in the array.

0 Answers   Expedia,

---

What is depth-first search algorithm?

0 Answers  

---

What is the uniform cost search algorithm?

0 Answers  

---

what is software cycle?give a diagramatic representation

0 Answers  

---

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

0 Answers   Tech Mahindra,

---

Draw a flowchart to find the average of four number?

0 Answers  

---