list the types of linked list with aid of diagram?
What do you mean by overfitting and underfitting algorithms?
What is the depth-first search algorithm?
Sorting algorithms and time complexity of various 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.
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 are the complexities of sorting algorithms and how can this complexity be calculated?
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?
Give an example of an O (n) algorithm and O (n*n) algorithm such that the algorithm is slower.
what is software cycle?give a diagramatic representation
Which is the most straight forward approach for planning algorithm?
Tell us how will you know which machine learning algorithm to choose for your classification problem?
Which language is used for artificial intelligence?
what are the minimum requirements for statr testing?
Explain the concept behind dead lock avoidance, banker's algorithm.