#### Algorithmic Strategies Model Question Paper

12th Standard EM

Reg.No. :
•
•
•
•
•
•

Computer Science

Time : 01:00:00 Hrs
Total Marks : 50
5 x 1 = 5
1. The word comes from the name of a Persian mathematician Abu Ja’far Mohammed ibn-i Musa al Khowarizmi is called?

(a)

Flowchart

(b)

Flow

(c)

Algorithm

(d)

Syntax

2. The Θ notation in asymptotic evaluation represents

(a)

Base case

(b)

Average case

(c)

Worst case

(d)

NULL case

3. If a problem can be broken into subproblems which are reused several times, the problem possesses which property?

(a)

Overlapping subproblems

(b)

Optimal substructure

(c)

Memoization

(d)

Greedy

4. Which of the following is not a characteristic of an algorithm?

(a)

Definiteness

(b)

Correctness

(c)

Data structure

(d)

Effectivenes

5. Which of the following is not an example of data structures?

(a)

Control statement

(b)

Structure

(c)

List

(d)

Dictionary

6. 5 x 2 = 10
7. Define Pseudo code

8. Who is an Algorist?

9. What is searching? Write its types.

10. Name the two factors, which decide the efficiency of an algorithm.

11. Give an example. How the time efficiency of an algorithm is measured.

12. 5 x 3 = 15
13. Discuss about Algorithmic complexity and its types

14. Write a note on Asymptotic notation

15. What do you understand by Dynamic programming?

16. Write a pseudo code for bubble sort

17. Write the steps to do dynamic programming.

18. 4 x 5 = 20
19. Discuss about Linear search algorithm

20. Explain the Bubble sort algorithm with example

21. Differentiate Algorithm and program

22. Explain the sorting algorithm that uses n-1 number passes to get the final sorted list