Algorithmic Strategies Book Back Questions

12th Standard EM

    Reg.No. :
  •  
  •  
  •  
  •  
  •  
  •  

Computer Science

Time : 00:45:00 Hrs
Total Marks : 30
    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. The Θ notation in asymptotic evaluation represents

    (a)

    Base case

    (b)

    Average case

    (c)

    Worst case

    (d)

    NULL case

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

  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. 3 x 2 = 6
  7. What is an Algorithm?

  8. Who is an Algorist?

  9. What is searching? Write its types.

  10. 3 x 3 = 9
  11. List the characteristics of an algorithm

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

  13. What do you understand by Dynamic programming?

  14. 2 x 5 = 10
  15. Explain the Bubble sort algorithm with example

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

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

TN 12th Standard EM Computer Science free Online practice tests

Reviews & Comments about 12th Standard Computer Science - Algorithmic Strategies Book Back Questions

Write your Comment