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 are disadvantages uniform cost search algorithm?

0 Answers  

---

A* algorithm is based on which search method?

0 Answers  

---

What is simulated annealing algorithm?

0 Answers  

---

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

0 Answers  

---

What are the disadvantages of depth-first search algorithm?

0 Answers  

---

what is software cycle?give a diagramatic representation

0 Answers  

---

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

0 Answers  

---

Consider the following algorithm, where the array A is indexed 1 through n: int add_them ( int n , int A[ ] ) { index i , j , k ; j = 0 ; for ( i = 1 ; i <= n ; i++) j = j + A[i] ; k = 1 ; for ( i = 1 ; i <= n ; i++) k = k + k ; return j + k ; } (a) If n = 5 and the array A contains 2, 5, 3, 7, and 8, what is returned? (b) What is the time complexity T(n) of the 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  

---

list the types of linked list with aid of diagram?

0 Answers  

---

What is informed (heuristic) search strategies algorithm?

0 Answers  

---