Write the Shortest path algorithm for a graph.
How does deep learning contrast with other machine learning algorithms?
list the types of linked list with aid of diagram?
Give an example of an O (n) algorithm and O (n*n) algorithm such that the algorithm is slower.
How are the k-nearest neigh-bors (knn) algorithms different from k-means clustering?
What are the complexities of sorting algorithms and how can this complexity be calculated?
A lot of questions were asked on sorting for eg. Best algorithm on the basis of number of swaps, number of comparisons etc.
Tell briefly about the Banker's algorithm and what is it used for?
What was deep learning, & how does it contrast with other machine learning algorithms?
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?
There are numbers from 1 to n, which are inverted such that it results in numbers from n to 1. If only two consecutive numbers are stampled at a time and are inverted, how many moves are required?
What is Na?ve Bayes Algorithm?
what is software cycle?give a diagramatic representation