What are the disadvantages of depth-first search algorithm?
No Answer is Posted For this Question
Be the First to Post Answer
Which algorithm is used for solving temporal probabilistic reasoning?
What is Back propagation in Neural Networks?
Which is the most straight forward approach for planning algorithm?
list the types of linked list with aid of diagram?
Give a general algorithm for converting a m-array tree to a 2-ary tree.
Which search algorithm will use a limited amount of memory in an online search?
What is the uniform cost search algorithm?
Explain me what's your favorite algorithm, and can you explain it to me in less than a minute?
Explain the concept behind dead lock avoidance, banker's algorithm.
0 Answers HPCL, Hughes Systique Corporation,
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?
Which is the most straight forward approach for planning algorithms?
How are the k-nearest neigh-bors (knn) algorithms different from k-means clustering?