Define the types of an algorithm
Define the types of an algorithm.
Expert
Types of algorithms:
• Simple recursive algorithms, for illustration: Searching an element in a list
• Backtracking algorithms, for illustration: Depth-first recursive search in a tree
• Divide and conquer algorithms. For illustration: Quick sort and merge sort
• Dynamic programming algorithms. For illustration: Generation of Fibonacci series
• Greedy algorithms, for illustration: Counting currency
• Branch and bound algorithms. For illustration: Travelling salesman (as visiting all cities once and minimize the whole distance travelled)
• Brute force algorithms. For illustration: Finding the best path for a travelling salesman
• Randomized algorithms. For illustration: Using a random number to select a pivot within quick sort).
Write down in brief the working process of Merge Sort?
Describe any two merits using single linked list over the doubly linked list and vice-versa?
What do you mean by the term matrix? Describe its uses with an illustration.
Explain Tree database briefly.
Elucidate pre-order and in-order tree traversal?
What is known as error tracking?
What do you mean by Huffman algorithm?
What is the competent data structure used within the internal storage representation in RDBMS?
Illustrates term binary searching?
Explain the difference between a stack and a Queue.
18,76,764
1929734 Asked
3,689
Active Tutors
1426719
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!