AI Algorithms Interview Questions
Questions Answers Views Company eMail

What is Na?ve Bayes Algorithm?

2 3589

What is Back propagation in Neural Networks?

1 6106

what are the minimum requirements for statr testing?

QA,

1725




what is software cycle?give a diagramatic representation

1886

what is software cycle?give a diagramatic representation

1635

Draw a flowchart to find the average of four number?

3223

list the types of linked list with aid of diagram?

1768

can anyone help me with some suggestions and improvemnts for sage line 50?

1650




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?

IBM, TCS,

1 3043

1. Consider the following algorithm: for ( i = 1 ; i <= 1 . 5 n ; i++) cout << i ; for ( i = n ; i >= 1 ; i - - ) cout << i ; (a) What is the output when n = 2, n = 4, and n = 6? (b) What is the time complexity T(n)? You may assume that the input n is divisible by 2.

1380

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.

1 2073

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.

770

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?

1029

Give an algorithm for the following problem. Given a list of n distinct positive integers, partition the list into two sublists, each of size n/2, such that the difference between the sums of the integers in the two sublists is minimized. You may assume that n is a multiple of 2.

1400

What features would you use to build a recommendation algorithm for users?

Twitter,

70


Post New AI Algorithms Questions






Un-Answered Questions { AI Algorithms }

Draw a flowchart to find the average of four number?

3223


What was deep learning, & how does it contrast with other machine learning algorithms?

50


Define Routing Algorithm?

67


Can you pick an algorithm. Write the psuedo-code for a parallel implementation?

35


What is the depth-first search algorithm?

49






How does deep learning contrast with other machine learning algorithms?

44


What is simulated annealing algorithm?

57


Which is the most straight forward approach for planning algorithm?

57


What is iterative deepening depth-first search algorithm?

67


Which is the most straight forward approach for planning algorithms?

46


Write the Shortest path algorithm for a graph.

84


1. Consider the following algorithm: for ( i = 1 ; i <= 1 . 5 n ; i++) cout << i ; for ( i = n ; i >= 1 ; i - - ) cout << i ; (a) What is the output when n = 2, n = 4, and n = 6? (b) What is the time complexity T(n)? You may assume that the input n is divisible by 2.

1380


What is depth-first search algorithm?

74


What is meant by a * search algorithm?

68


What are the disadvantages of breadth-first search algorithm?

72