What is informed (heuristic) search strategies algorithm?

0 Answers  

---

What is simulated annealing algorithm?

0 Answers  

---

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

0 Answers  

---

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  

---

Give an algorithm for the following problem. Given a list of n distinct positive integers, partition the list into two sublists, each of size n/2, such that the difference between the sums of the integers in the two sublists is minimized. You may assume that n is a multiple of 2.

0 Answers  

---

Give an example of an O (n) algorithm and O (n*n) algorithm such that the algorithm is slower.

0 Answers   Aspiring Minds,

---

Sorting algorithms and time complexity of various algorithms.

0 Answers   InterGraph,

---

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,

---

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

0 Answers  

---

What is meant by uniform cost search algorithm?

0 Answers  

---

What is local search algorithms?

0 Answers  

---