#### 12th Standard Computer Science English Medium Algorithmic Strategies Reduced Syllabus Important Questions With Answer Key 2021

12th Standard

Reg.No. :
•
•
•
•
•
•

Computer Science

Time : 01:00:00 Hrs
Total Marks : 100

Multiple Choice Questions

15 x 1 = 15
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. 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

3. In dynamic programming, the technique of storing the previously calculated values is called ?

(a)

Saving value property

(b)

Storing value property

(c)

Memoization

(d)

Mapping

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. Which of the following is an example of data structures?

(a)

List

(b)

Tuple

(c)

Dictionary

(d)

All of these.

7. The way of defining an algorithm is called

(a)

Pseudo strategy

(b)

Programmic strategy

(c)

Algorithmic strategy

(d)

Data structured strategy

8. Which characteristics of algorithm defined the operation involving division by zero?

(a)

Finiteness

(b)

Definiteness

(c)

Input

(d)

Correctness

9. An estimation of the time and space complexities of an algorithm is called

(a)

Algorithmic solution

(b)

Algorithmic Strategy

(c)

Algorithmic performance

(d)

Algorithmic analysis

10. Efficiency of an algorithm decided by

(a)

Time, Space

(b)

Definiteness, portability

(c)

Priori, Postriori

(d)

Input/output

11. Time and Space complexity could be considered for an

(a)

Algorithmic strategy

(b)

Algorithmic analysis

(c)

Algorithmic solution

(d)

Algorithmic efficiency

12. How many factors are used to measure the time efficiency of an algorithm?

(a)

Two

(b)

Three

(c)

Six

(d)

Many

13. Which of the following sorting algorithm is too slow and less efficient?

(a)

Bubble

(b)

Selection

(c)

Quick

(d)

Merge

14. A theoretical performance analysis of an algorithm is called_________

(a)

Posteriori testing

(b)

Priori estimates

(c)

Algorithmic efficiency

(d)

Algorithmic testing

15. Which of the following is the reverse of Big O?

(a)

Big $\Omega$

(b)

Big $\mu$

(c)

Big symbol

(d)

Big $\Omega$

1. 2 Marks

10 x 2 = 20
16. What is an Algorithm?

17. Define Pseudo code

18. Who is an Algorist?

19. What is searching? Write its types.

20. What is algorithmic solution?

21. What does analysis of an algorithm deals with?

22. How the analysis of algorithms and performance evaluation can be divided?Explain.

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

24. Write a note on Big omega asymptotic notation

25. Write a note on memorization.

1. 3 Marks

10 x 3 = 30
26. Discuss about Algorithmic complexity and its types

27. What are the factors that influence time and space complexity

28. Write a note on Asymptotic notation

29. What do you understand by Dynamic programming?

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

31. Write the different factors in which the time efficiency of an algorithm its measured

32. Write a pseudo code for bubble sort

33. Write a pseudo code for Insertion sort

34. Write the steps to do dynamic programming.

35. Write a pseudo code that defines Fibonacci Iterative algorithm with Dynamic programming approach.

1. 5 Marks

7 x 5 = 35
36. Explain the characteristics of an algorithm.

37. What is Binary search? Discuss with example

38. Explain the Bubble sort algorithm with example

39. Explain the concept of Dynamic programming with suitable example.

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

41. Differentiate Algorithm and program

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