Give a general algorithm for converting a m-array tree to a 2-ary tree.
- 0 Answers
- 613 Views
- Tech Mahindra, I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
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 algorithm is used for solving temporal probabilistic reasoning?
Sorting algorithms and time complexity of various algorithms.
When an algorithm is considered completed?
What is Back propagation in Neural Networks?
Explain the concept behind dead lock avoidance, banker's algorithm.
0 Answers HPCL, Hughes Systique Corporation,
What is iterative deepening depth-first search algorithm?
What is meant by a * search algorithm?
What was deep learning, & how does it contrast with other machine learning algorithms?
What is greedy best first search algorithm?
Tell me how do you choose an algorithm for a classification problem?
What’s your favorite algorithm, & can you explain it into me in less than a minute?
-
AI Algorithms (74) - AI Language Processing (96)
- AI Knowledge Representation (12)
- AI Robotics (183)
- AI Recognition (13)
- AI Neural Networks (66)
- AI Fuzzy Logic (31)
- AI Games (8)
- AI Languages (141)
- AI Tools (11)
- AI Machine Learning (659)
- Data Science (671)
- Data Mining (120)
- TensorFlow (197)
- AI Deep Learning (111)
- AI General (197)
- AI AllOther (6)
