DAA Prefinals

This sorting algorithm chooses the smallest element in the unsorted portion of a list and then swaps with the element at the beginning of the sorted portion of the list.

• Bubble sort

• Merge sort

• Insertion sort

• Selection sort

It is used to find minimum matches in which the time of completion or cost of making all activities by the number of persons is minimized.

• Hungarian Method

• Traveling Salesman Problem

• Hamiltonian Circuit

• Brute Force String Matching

It is sometimes referred to as linear search.

• Sequential search

• Exhaustive search

• Selection sort

• Bubble sort

It is a path that begins and ends at the same vertex and passes through all other vertices of the graph exactly one time.

• String matching

• Maximization

• Minimization

• Hamiltonian circuit

It is the process of finding the exact copy of patterns with all the substrings of a given text.

• String trimming

• String matching

• String concatenation

• String initialization

It is also known as the Matrix Reduction method.

• Brute Force Method

• Recursion Method

• Hungarian Method

• Divide-and-Conquer Method

It essentially generates a list of all potential solutions to a problem and evaluates them one by one.

• Sequential search

• Exhaustive search

• Selection sort

• Bubble sort

Its goal is to find the least expensive or shortest way to visit through a given set of cities once and return to the original starting point.

• Assignment Problem

• Sequential Search

• Traveling Salesman Problem

• Exhaustive Search

It is also known as proof by exhaustion.

• Divide-and-Conquer Algorithm

• Brute Force Algorithm

• Selection Sort

• Bubble Sort

In an assignment problem, how many tasks are assigned to each entity?

• 1

• 2

• 3

• 4