DAA Finals

It is a general algorithm design technique that solves a problem by dividing it into several smaller subproblems of the same type (ideally, of about equal size), solving each of them recursively, and then combining their solutions to get a solution to the original problem.

• Divide and Conquer Algorithm

• Greedy Algorithm

• Dynamic Programming

• Backtracking

What are the Importance of Divide and Conquer Algorithm? (4)

• Solving difficult problems

• Algorithm Efficiency

• Parallelism

• Memory Access

• Partitioning

It is a type of sorting algorithm that repeatedly divides the data in half, sorts each half separately, and combines the sorted halves into one sorted array.

• Selection Sort

• Bubble Sort

• Merge Sort

• Quick Sort

It is a type of sorting algorithm in which the main idea is to partition the array into two (2) regions: small items are moved to the left side of the array and large items are moved to the right side. After partitioning, the sort is repeated on the left and right sides.

• Selection Sort

• Bubble Sort

• Merge Sort

• Quick Sort

It is a type of search algorithm that is used to locate an element in an ordered array. It is advisable to use it whenever the list starts to become larger.

• Selection Sort

• Binary Search

• Merge Sort

• Quick Sort

The steps of the Binary search starts by?

• Testing the target

• Divide the array into two sub-arrays about half as large.

• Divide the sub-array by determining whether the target is in that sub-array.

• Obtain the solution to the array from the solution to the sub-array.

If the target is equal to the middle item

• Quit

• Continue

• Divide

• Obtain

It is a type of tree data structure in which no node can have more than two (2) subtrees. In other words, a node can have zero, one, or two subtrees. These subtrees are designated as the left subtree and right subtree.

• Mango Tree

• Heap Tree

• Ternary Tree

• Binary Tree

It requires that each node of the tree be processed once and only once in a predetermined sequence.

• Binary Search

• Tree Hashing

• Binary Tree Traversal

• Node Partitioning

It is where the processing proceeds along a path from the root through one child to the most distant descendant of that first child before processing a second child. In other words, all of the descendants of a child are processed before going on to the next child.

• Breadth-First Traversal

• In-order Threading

• Depth-First Traversal

• Level-Order Traversal