Unit 3- Part 1

Question 1

What is the definition of an algorithm?

Answer 1

It is an ordered sequence of well defined finite instructions that given an initial state, performs some task and halts in finite time

Question 2

What does an algorithm offer?

Answer 2

a clear start and end points for the system/task

Question 3

What is the order of the Software Development Cycle?

Answer 3

-Specification
-Design
-Implementation
-Testing

Question 4

What are the ways that Algorithms can be illustrated in?

Answer 4

-Pseudo Code
-Flow Charts
-Natural Language

Question 5

Representations of algorithms are generally grouped in what 3 levels?

Answer 5

-High Level Description
-Implementation Description
-Formal Description

Question 6

How does a Divide and Conquer algorithm work?

Answer 6

Repeatedly divide a problem into smaller subproblems until they are easy to solve
-then combine the solutions to the subproblems to solve the original problem

Question 7

What is an example of Divide and Conquer algorithm?

Answer 7

-Merge Sorting Algorithm

Question 8

How does Dynamic Programming work?

Answer 8

-constructs optimal solution to a problem from optimal solutions to subproblems

Question 9

What is an example of Dynamic Programming?

Answer 9

All-Pair Shortest Path Algorithm

Question 10

How does a Greedy Algorithm work?

Answer 10

-Makes locally optimal decisions even if they are inaccurate

Question 11

How does a Search and Enumeration algorithm work?

Answer 11

Systemically checking all possible candidates for the solution