Introduction

Question 1

It is a sequence of unambiguous instructions for solving a problem, i.e., for obtaining a required output for any legitimate input in a finite amount of time.

Answer 1

Algorithm

Question 2

An algorithm for finding the greatest common divisor.

Answer 2

Euclid’s Algorithm

Question 3

Fill in the blanks:
In Euclid’s Algorithm, the m and n should be _____.

Answer 3

Nonnegative/ no both zeros

Question 4

Fill in the blanks:
Euclid’s algorithm is base on _____ application of equality. gcd(m,n) = gcd(n, m mod n)

Answer 4

repeated

Question 5

It is rearranging of the items of a given list in ascending order.

Answer 5

Sorting

Question 6

GIve an example of sorting algorithm.

Answer 6

• Selection Sort
• Bubble Sort
• Insertion Sort
• Merge Sort
• Heap Sort

Question 7

What are the two properties of sorting algorithm.

Answer 7

Stability and In place

Question 8

An algorithm wich finds a given value called search key in a given set.

Answer 8

Searching

Question 9

Give an example of searching algorithm.

Answer 9

• Sequential Search
• BInary Search

Question 10

A _____ is a sequence of characters from an alphabet.

Answer 10

String

Question 11

A _____ is a collection of points called vertices, some of wich are connected by line segments called edges

Answer 11

graph

Question 12

GIve an example of Graph Algortihm.

Answer 12

• Graph traversal algorithm
• Shortest-path algorithms
• Topological sorting