There are numbers from 1 to n, which are inverted such that it results in numbers from n to 1. If only two consecutive numbers are stampled at a time and are inverted, how many moves are required?

1 Answers   IBM, TCS,

---

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  

---

What are disadvantages uniform cost search algorithm?

0 Answers  

---

Given a series of positive integers. Design an efficient algorithm that can detect pairs whose sum is equal to K such that K = ei + ej, and (i not equal to j).

0 Answers   Expedia,

---

What is breadth-first search algorithm?

0 Answers  

---

What is depth-first search algorithm?

0 Answers  

---

Explain the concept behind dead lock avoidance, banker's algorithm.

0 Answers   HPCL, Hughes Systique Corporation,

---

Write the Shortest path algorithm for a graph.

1 Answers   Tech Mahindra,

---

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 are the disadvantages of breadth-first search algorithm?

0 Answers  

---

Which algorithm inverts a complete resolution strategy?

0 Answers  

---

What are the complexities of sorting algorithms and how can this complexity be calculated?

0 Answers   Tech Mahindra,

---