Un-Answered Questions { AI Algorithms }

what are the minimum requirements for statr testing?

1648


what is software cycle?give a diagramatic representation

1791


what is software cycle?give a diagramatic representation

1556


Draw a flowchart to find the average of four number?

3119


list the types of linked list with aid of diagram?

1675





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

1552


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.

1123


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.

649


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?

928


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.

1258





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

4


Write an algorithm to traverse a knight covering all the squares on a chessboard starting at a particular point.

2


Explain the concept behind dead lock avoidance, banker's algorithm.

1