" /> -->

#### Algorithmic Strategies Important Questions

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. Two main measures for the efficiency of an algorithm are

(a)

Processor and memory

(b)

Complexity and capacity

(c)

Time and space

(d)

Data and space

3. Time complexity of bubble sort in best case is

(a)

θ (n)

(b)

θ (nlogn)

(c)

θ (n2)

(d)

θ (n(logn) 2)

4. The Θ notation in asymptotic evaluation represents

(a)

Base case

(b)

Average case

(c)

Worst case

(d)

NULL case

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

(a)

Definiteness

(b)

Correctness

(c)

Data structure

(d)

Effectivenes

6. 6 x 2 = 12
7. What is Sorting?

8. What is searching? Write its types.

9. Give an example of data structures

10. What in algorithmic strategy? Give an example.

11. What is algorithmic solution?

12. What are the three asymptotic notations used to represent time complexity of algorithms?

13. 6 x 3 = 18
14. Write a note on Asymptotic notation

15. What do you understand by Dynamic programming?

16. List the manipulation manipulated effectively through data structures by algorithm

17. Design an algorithm to find square of the given number and display the result.

18. Write a note on time/space trade off

19. Write a note on two factors in which space required by an algorithm is decided.

20. 3 x 5 = 15
21. Explain the concept of Dynamic programming with suitable example.

22. Explain Best, worst and Average case efficiency of an algorithm with an example

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