Algorithms

Question 1

What is an algorithm?

Answer 1

An algorithm is an ordered set of unambigious, executable steps that defines a terminating process

Question 2

Algorithm Representation

Answer 2

Requires well-defined primitives
A colleciton of primitives constitutes a programming language

Question 3

Polya’s Problem Solving Steps

Answer 3

1. Understand the problem
2. Devise a plan for solving the problem (düzenlemek)
3. Carry out the plan (apply)
4. Evaluate the solution for accuracy and its potential as a tool for solving other problems

Question 4

Components of repetitive control

Answer 4

Initialize : Establish an initial state that will be modified toward the termination condition

Test : Compare the current state to the termination condition and terminate the repitition if equal

Modify :Change the state in such a way that it moves toward the termination condition

Question 5

Pretest and posttest loop

Answer 5

while and do while

Question 6

Recursion

Answer 6

++The execution of a procedure leads to another execution of the procedure
++Multiple activations of the procedure are formed, all but one of which are waiting for other activations to complete

Question 7

Algorithm efficiency

Answer 7

-Measured as number of instructions executed
-Big theta notation : Used to represent efficiency classes
+Example : Insertion sort is in Θ(n^2)
-Best, worst, average case analysis

Question 8

Graph of the worst-case analysis of the insertion sort algorithm

Answer 8

artarak artan

Question 9

Graph of the worst-case analysis of the binary search algorithm

Answer 9

azalarak artan sağdan başlayan grafik