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  

---

Which language is used for artificial intelligence?

0 Answers   Flextronics,

---

Tell us how will you know which machine learning algorithm to choose for your classification problem?

0 Answers  

---

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

0 Answers   HPCL, Hughes Systique Corporation,

---

---

What is simulated annealing algorithm?

0 Answers  

---

What is informed (heuristic) search strategies algorithm?

0 Answers  

---

Write the Shortest path algorithm for a graph.

1 Answers   Tech Mahindra,

---

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

0 Answers   Amazon,

---

How are the k-nearest neigh-bors (knn) algorithms different from k-means clustering?

0 Answers  

---

What is greedy best first search algorithm?

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  

---