New ! Computer Science MCQ Practise Tests



12th Standard English Medium Computer Science Subject Algorithmic Strategies Book Back 1 Mark Questions with Solution Part - II

12th Standard

    Reg.No. :
  •  
  •  
  •  
  •  
  •  
  •  

Computer Science

Time : 01:00:00 Hrs
Total Marks : 5

    1 Marks

    5 x 1 = 5
  1. Which of the following is not a stable sorting algorithm?

    (a)

    Insertion sort

    (b)

    Quick sort

    (c)

    Merge sort

    (d)

    Selection sort

  2. Time complexity of bubble sort in best case is

    (a)

    θ (n)

    (b)

    θ (nlogn)

    (c)

    θ (n2)

    (d)

    θ (n(logn) 2)

  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

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

Reviews & Comments about 12th Standard English Medium Computer Science Subject Algorithmic Strategies Book Back 1 Mark Questions with Solution Part - II

Write your Comment