What was deep learning, & how does it contrast with other machine learning algorithms?
No Answer is Posted For this Question
Be the First to Post Answer
What is the uniform cost search algorithm?
Consider the following algorithm: j = 1 ; while ( j <= n/2) { i = 1 ; while ( i <= j ) { cout << j << i ; i++; } j++; } (a) What is the output when n = 6, n = 8, and n = 10? (b) What is the time complexity T(n)? You may assume that the input n is divisible by 2.
A lot of questions were asked on sorting for eg. Best algorithm on the basis of number of swaps, number of comparisons etc.
Which is the most straight forward approach for planning algorithm?
A* algorithm is based on which search method?
What do you mean by overfitting and underfitting algorithms?
Given 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.
What features would you use to build a recommendation algorithm for users?
Write an algorithm to traverse a knight covering all the squares on a chessboard starting at a particular point.
Which is the most straight forward approach for planning algorithms?
What was deep learning, & how does it contrast with other machine learning algorithms?
Explain the Canny's Algorithm.