INTRODUCTION TO DAA

10 flashcards · Computer Science · by Joelanandraj Edwardraj

1. An algorithm is a set of steps of operations to solve a problem performing calculation, data processing, and automated reasoning tasks.

2. An algorithm design technique is a general approach to solving problems algorithmically that is applicable to a variety of problems from different areas of computing.

3. Pseudocode is a mixture of a natural language and programming language-like constructs.

4. In some situations a single operation can be expensive, but the total time for the entire sequence of n such operations is always significantly better that the worst case efficiency of that single operation multiplied by n. this is called amortized efficiency.

5. Measuring the performance of an algorithm based on the input size n is called order of growth.

6. Binary search is a remarkably efficient algorithm for searching in a sorted array.

7. Dynamic programming is an algorithm design method that can be used when a solution to the problem is viewed as the result of sequence of decisions

8. Dijkstra‘s algorithm is used to solve the single-source shortest-paths problem.

9. A node in a state-space tree is said to be non-promising if it backtracks to the node‘s parent to consider the next possible solution for its last component.

10. Bipartite graph is a graph whose vertices can be partitioned into two disjoint sets V and U, not necessarily of the same size, so that every edge connects a vertex in V to a vertex in U.