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  

---

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

0 Answers  

---

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,

---

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 are the disadvantages of depth-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  

---

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

0 Answers   Aspiring Minds,

---

What is the depth-first search algorithm?

0 Answers  

---

What do you mean by overfitting and underfitting algorithms?

0 Answers  

---

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

0 Answers  

---

When an algorithm is considered completed?

0 Answers  

---

what are the minimum requirements for statr testing?

0 Answers   QA,

---