New ! Computer Science MCQ Practise Tests



Algorithmic Strategies Two Marks Questions

12th Standard

    Reg.No. :
  •  
  •  
  •  
  •  
  •  
  •  

Computer Science

Time : 00:45:00 Hrs
Total Marks : 30
    15 x 2 = 30
  1. What is an Algorithm?

  2. Define Pseudo code.

  3. Who is an Algorist?

  4. What is Sorting?

  5. What is searching? Write its types.

  6. Give an example of data structures

  7. What in algorithmic strategy? Give an example.

  8. What is algorithmic solution?

  9. How the efficiency of an algorithm is defined?

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

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

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

  13. Define algorithmetic strategy?

  14. Write a note on Big omega asymptotic notation.

  15. Define memorization.

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

Reviews & Comments about 12th Computer Science - Algorithmic Strategies Two Marks Questions

Write your Comment