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  

---

Which search algorithm will use a limited amount of memory in online search?

0 Answers  

---

Can you list some use cases where classification machine learning algorithms can be used?

0 Answers  

---

Define Routing Algorithm?

0 Answers   Maveric,

---

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

0 Answers  

---

---

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

0 Answers   Tech Mahindra,

---

Write the Shortest path algorithm for a graph.

1 Answers   Tech Mahindra,

---

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

0 Answers   ITC Indian Tobacco Company,

---

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

0 Answers   Amazon,

---

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

0 Answers   HPCL, Hughes Systique Corporation,

---

Why size of integer depends on the machine architecture then what the best sorting algorithm and why?

0 Answers   HPCL, Hughes Systique Corporation,

---

A* algorithm is based on which search method?

0 Answers  

---