Interested to Buy Any Domain ? << Click Here >> for more details...
Answer Posted / parvendra
this algorithm is used to work on large databases
| Is This Answer Correct ? | 2 Yes | 3 No |
Post New Answer View All Answers
Explain me what's your favorite algorithm, and can you explain it to me in less than a minute?
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?
Define Routing Algorithm?
Which search algorithm will use a limited amount of memory in online search?
What is bidirectional search algorithm?
Name search algorithm technology?
Which is the most straight forward approach for planning algorithms?
List the different algorithm techniques in machine learning?
list the types of linked list with aid of diagram?
How does deep learning contrast with other machine learning algorithms?
Can you pick an algorithm. Write the psuedo-code for a parallel implementation?
Tell briefly about the Banker's algorithm and what is it used for?
What are disadvantages uniform cost search algorithm?
How are the k-nearest neigh-bors (knn) algorithms different from k-means clustering?
What’s your favorite algorithm, & can you explain it into me in less than a minute?
