1. Consider the following algorithm: for ( i = 1 ; i <= 1 . 5 n ; i++) cout << i ; for ( i = n ; i >= 1 ; i - - ) cout << i ; (a) What is the output when n = 2, n = 4, and n = 6? (b) What is the time complexity T(n)? You may assume that the input n is divisible by 2.

0 Answers  

---

What is meant by 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 software cycle? Give a diagrammatic representation?

0 Answers  

---

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

0 Answers   ITC Indian Tobacco Company,

---

What are the disadvantages of breadth-first search algorithm?

0 Answers  

---

What is informed (heuristic) search strategies algorithm?

0 Answers  

---

list the types of linked list with aid of diagram?

0 Answers  

---

A* algorithm is based on which search method?

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 meant by a * search algorithm?

0 Answers  

---

What features would you use to build a recommendation algorithm for users?

0 Answers   Twitter,

---