New ! Computer Science MCQ Practise Tests



Algorithmic Strategies Model Question Paper 1

12th Standard

    Reg.No. :
  •  
  •  
  •  
  •  
  •  
  •  

Computer Science

Time : 01:00:00 Hrs
Total Marks : 50
    5 x 1 = 5
  1. From the following sorting algorithms which algorithm needs the minimum number of swaps?

    (a)

    Bubble sort

    (b)

    Insertion sort

    (c)

    Selection sort

    (d)

    All the above

  2. Which of the following is not a stable sorting algorithm?

    (a)

    Insertion sort

    (b)

    Quick sort

    (c)

    Merge sort

    (d)

    Selection sort

  3. Time complexity of bubble sort in best case is

    (a)

    θ (n)

    (b)

    θ (nlogn)

    (c)

    θ (n2)

    (d)

    θ (n(logn) 2)

  4. Which of the following is not an example of data structures?

    (a)

    Control statement

    (b)

    Structure

    (c)

    List

    (d)

    Dictionary

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

    (a)

    List

    (b)

    Tuple

    (c)

    Dictionary

    (d)

    All of these.

  6. 5 x 2 = 10
  7. What is an Algorithm?

  8. What is Sorting?

  9. What is searching? Write its types.

  10. What is algorithmic solution?

  11. What is best algorithm?

  12. 5 x 3 = 15
  13. List the characteristics of an algorithm.

  14. Write a note on Asymptotic notation.

  15. What do you understand by Dynamic programming?

  16. Write a pseudo code for bubble sort algorithm

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

  18. 4 x 5 = 20
  19. What is Binary search? Discuss with example

  20. Explain the Bubble sort algorithm with example.

  21. Explain complexity of an algorithm.

  22. Explain the selection sort Algorithm with an example.

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

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

Write your Comment