What is breath-first search algorithm?
Give a general algorithm for converting a m-array tree to a 2-ary tree.
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 language is used for artificial intelligence?
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).
What is local search algorithms?
Tell us how will you know which machine learning algorithm to choose for your classification problem?
Consider the following algorithm: for ( i = 2 ; i <= n ; i++) { for ( j = 0 ; j <= n) { cout << i << j ; j = j + floor(n/4) ; } } (a) What is the output when n = 4 (b) What is the time complexity T(n). You may assume that n is divisible 4.
When an algorithm is considered completed?
A lot of questions were asked on sorting for eg. Best algorithm on the basis of number of swaps, number of comparisons etc.
What was deep learning, & how does it contrast with other machine learning algorithms?
Which algorithm inverts a complete resolution strategy?
What is the bidirectional search algorithm?
what are the minimum requirements for statr testing?
Which is the most straight forward approach for planning algorithms?