New ! Computer Science MCQ Practise Tests

12th Standard Computer Science English Medium Algorithmic Strategies Reduced Syllabus Important Questions 2021

12th Standard

    Reg.No. :
  •  
  •  
  •  
  •  
  •  
  •  

Computer Science

Time : 01:00:00 Hrs
Total Marks : 100

      Multiple Choice Questions

    15 x 1 = 15
  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. From the following sorting algorithms which algorithm needs the minimum number of swaps?

    (a)

    Bubble 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. The Θ notation in asymptotic evaluation represents

    (a)

    Base case

    (b)

    Average case

    (c)

    Worst case

    (d)

    NULL case

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

  6. Which of the following is a finite set of instructions to accomplish a particular task?

    (a)

    Flowchart

    (b)

    Functions

    (c)

    Algorithm

    (d)

    Abstraction

  7. Which of the following are the characteristics of an algorithm?
    (i) Definiteness
    (ii) Correctness
    (iii) Effectiveness

    (a)

    i, ii

    (b)

    ii, iii

    (c)

    Only ii

    (d)

    i, ii and iii

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

    (a)

    Definiteness

    (b)

    Correctness

    (c)

    Data structure

    (d)

    Effectivenes

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

    (a)

    Control statement

    (b)

    Structure

    (c)

    List

    (d)

    Dictionary

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

    (a)

    List

    (b)

    Tuple

    (c)

    Dictionary

    (d)

    All of these.

  11. Which of the following is not a searching technique?
    (i) Linear
    (ii) Binary
    (iii) Selection
    (iv) Merge

    (a)

    Only i

    (b)

    Only ii

    (c)

    Only iii

    (d)

    iii and iv

  12. The way of defining an algorithm is called

    (a)

    Pseudo strategy

    (b)

    Programmic strategy

    (c)

    Algorithmic strategy

    (d)

    Data structured strategy

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

    (a)

    Finiteness

    (b)

    Definiteness

    (c)

    Input

    (d)

    Correctness

  14. How many asymptotic notations are mostly used to represent time complexity of algorithms?

    (a)

    Three

    (b)

    Two

    (c)

    One

    (d)

    Many

  15. Linear search is also called

    (a)

    Sequential search

    (b)

    Quick search

    (c)

    Binary search

    (d)

    Selection search

    1. 2 Marks

    10 x 2 = 20
  16. What is Sorting?

  17. What is searching? Write its types.

  18. Give an example of data structures

  19. How the efficiency of an algorithm is defined?

  20. What does analysis of an algorithm deals with?

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

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

  23. What is algorithmetic strategy?

  24. What are the three asymptotic notations used to represent time complexity of algorithms?

  25. Write a note on Big omega asymptotic notation

    1. 3 Marks

    10 x 3 = 30
  26. List the characteristics of an algorithm

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

  28. Write a note on Asymptotic notation

  29. List the manipulation manipulated effectively through data structures by algorithm

  30. Write a note on time/space trade off

  31. Write a pseudo code for linear search

  32. Write a pseudo code for Binary'search

  33. Write a pseudo code for bubble sort

  34. Write a pseudo code for selection sort.

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

    1. 5 Marks

    7 x 5 = 35
  36. Explain the characteristics of an algorithm.

  37. Discuss about Linear search algorithm

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

  39. Explain complexity of an algorithm.

  40. Write a note on Efficiency of an algorithm

  41. Explain Selection sort sorting algorithm.

  42. Explain the sorting algorithm that uses n-1 number passes to get the final sorted list

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

TN 12th Standard Computer Science free Online practice tests

Reviews & Comments about 12th Standard Computer Science English Medium Algorithmic Strategies Reduced Syllabus Important Questions 2021

Write your Comment