What is the most efficient way to store 1 million phone numbers memory-wise?

0 Answers   Aspire, Infogain,

---

Consider the following algorithm: j = 1 ; while ( j <= n/2) { i = 1 ; while ( i <= j ) { cout << j << i ; i++; } j++; } (a) What is the output when n = 6, n = 8, and n = 10? (b) What is the time complexity T(n)? You may assume that the input n is divisible by 2.

1 Answers  

---

Sorting algorithms and time complexity of various algorithms.

0 Answers   InterGraph,

---

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

0 Answers   ITC Indian Tobacco Company,

---

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  

---

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  

---

Tell me how do you choose an algorithm for a classification problem?

0 Answers  

---

what is software cycle?give a diagramatic representation

0 Answers  

---

Which language is used for artificial intelligence?

0 Answers   Flextronics,

---

Which algorithm is used for solving temporal probabilistic reasoning?

0 Answers  

---

What was deep learning, & how does it contrast with other machine learning algorithms?

0 Answers  

---