##### Reference no: EM13338934

1. Define an algorithm. What are the properties of an algorithm ?

2. Write a note on i) devising ii) validating and iii) testing of algorithms.

3. What is a linear data structure ? Give examples. Describe how an array is represented.

4. Write algorithms to implement the following operations on a stack - create, push, pop.

5. What is a first-in-first-out data structure ? Write algorithms to perform the following operations on it - create, insertion, deletion, for testing overflow and empty conditions.

6. What is a graph ? What are the two ways of representing a graph ? Describe with the help of illustrative examples.

7. What is a circular queue ? Write algorithms to implement the insertion and deletion operations.

8. Write an algorithm to find the roots of a quadratic equation.

9. Design an algorithm to check whether a given string is a palindrome or not.

10. Develop an algorithm to generate all the prime numbers between the given 2 limits.