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).
Give a brief description of the term Merge Sort?
A Linked List Instead Of an Array When Should You Use?
Describe the term two-dimensional array by using example?
What are the main uses of data structures?
Write down the difference between BFS and DFS?
Give a small description of the term Arrays?
Briefly describe the term B tree?
Define testing?
Write down the differentiation between STACK and ARRAY?
Explain about the process management of operating system.
18,76,764
1961364 Asked
3,689
Active Tutors
1425567
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!