Which search algorithm will use a limited amount of memory in online search?
No Answer is Posted For this Question
Be the First to Post Answer
Give an example of an O (n) algorithm and O (n*n) algorithm such that the algorithm is slower.
Write an algorithm to traverse a knight covering all the squares on a chessboard starting at a particular point.
Name search algorithm technology?
What is the breadth-first search algorithm?
What are disadvantages uniform cost search algorithm?
What is greedy best first search algorithm?
What is meant by uniform cost search algorithm?
A lot of questions were asked on sorting for eg. Best algorithm on the basis of number of swaps, number of comparisons etc.
What is the iterative deepening depth-first search algorithm?
Write a code/algorithm to find the frequency of each element in an array?
0 Answers ITC Indian Tobacco Company,
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.
What is the uniform cost search algorithm?