Interested to Buy Any Domain ? << Click Here >> for more details...
Write an algorithm to traverse a knight covering all the squares on a chessboard starting at a particular point.
942A lot of questions were asked on sorting for eg. Best algorithm on the basis of number of swaps, number of comparisons etc.
DELL,
1193Given 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).
915Given a sorted array of n integers that has been rotated i(unknown) number of times, give a (log n) algorithm that finds an element in the array.
1177Why size of integer depends on the machine architecture then what the best sorting algorithm and why?
931Post New AI Algorithms Questions
What was deep learning, & how does it contrast with other machine learning algorithms?
Give an example of an O (n) algorithm and O (n*n) algorithm such that the algorithm is slower.
Which language is used for artificial intelligence?
Why size of integer depends on the machine architecture then what the best sorting algorithm and why?
What is depth-first search algorithm?
What is bidirectional search algorithm?
Which algorithm inverts a complete resolution strategy?
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?
Can you list some use cases where classification machine learning algorithms can be used?
Tell us why is naïve bayes machine learning algorithm naïve?
list the types of linked list with aid of diagram?
Which is the most straight forward approach for planning algorithm?
Which search algorithm will use a limited amount of memory in online search?
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.
