New ! Computer Science MCQ Practise Tests



Algorithmic Strategies Model Question Paper

12th Standard

    Reg.No. :
  •  
  •  
  •  
  •  
  •  
  •  

Computer Science

Time : 02:00:00 Hrs
Total Marks : 50
    10 x 1 = 10
  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. From the following sorting algorithms which has the lowest worst case complexity?

    (a)

    Bubble sort

    (b)

    Quick sort

    (c)

    Merge sort

    (d)

    Selection sort

  4. Time complexity of bubble sort in best case is

    (a)

    θ (n)

    (b)

    θ (nlogn)

    (c)

    θ (n2)

    (d)

    θ (n(logn) 2)

  5. 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

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

    (a)

    Definiteness

    (b)

    Correctness

    (c)

    Data structure

    (d)

    Effectivenes

  7. Which of the following is an example of data structures?

    (a)

    List

    (b)

    Tuple

    (c)

    Dictionary

    (d)

    All of these.

  8. Which of the following is not a sorting technique?

    (a)

    Bubble

    (b)

    Binary

    (c)

    Insertion

    (d)

    Quick

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

    (a)

    Finiteness

    (b)

    Definiteness

    (c)

    Input

    (d)

    Correctness

  10. Performance measurement of an algorithm is called

    (a)

    Posteriori testing

    (b)

    Priori estimates

    (c)

    Efficiency testing

    (d)

    Algorithmic analysis

  11. 8 x 2 = 16
  12. What is an Algorithm?

  13. Who is an Algorist?

  14. What is Sorting?

  15. What is searching? Write its types.

  16. Give an example of data structures

  17. What is algorithmic solution?

  18. What is algorithm analysis?

  19. Define memorization.

  20. 3 x 3 = 9
  21. List the characteristics of an algorithm.

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

  23. What do you understand by Dynamic programming?

  24. 3 x 5 = 15
  25. Explain the characteristics of an algorithm.

  26. What is Binary search? Discuss with example

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

*****************************************

Reviews & Comments about 12th Standard Computer Science - Algorithmic Strategies Model Question Paper

Write your Comment