Answer Posted / parvendra
this algorithm is used to work on large databases
| Is This Answer Correct ? | 2 Yes | 3 No |
Post New Answer View All Answers
What is iterative deepening depth-first search algorithm?
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.
what is software cycle?give a diagramatic representation
Which language is used for artificial intelligence?
What is the most efficient way to store 1 million phone numbers memory-wise?
A lot of questions were asked on sorting for eg. Best algorithm on the basis of number of swaps, number of comparisons etc.
Give an example of an O (n) algorithm and O (n*n) algorithm such that the algorithm is slower.
Can you list some use cases where classification machine learning algorithms can be used?
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 is software cycle? Give a diagrammatic representation?
Tell briefly about the Banker's algorithm and what is it used for?
What is the breadth-first search algorithm?
What is bidirectional search algorithm?
Which algorithm inverts a complete resolution strategy?
Which is the most straight forward approach for planning algorithms?