TN State Board Samacheer Kalvi Online Test for 12th Std - Computer Science - English - Algorithmic Strategies

Question 1 Of 10

The complexity of linear search algorithm is

O(n) O(log n) O(n2) O(n log n)

Question 2 Of 10

In dynamic programming, the technique of storing the previously calculated values is called ?

Saving value property Storing value property Memoization Mapping

Question 3 Of 10

Which of the following is not a stable sorting algorithm?

Insertion sort Selection sort Bubble sort Merge sort

Question 4 Of 10

From the following sorting algorithms which has the lowest worst-case complexity?

Bubble sort Quick sort Merge sort Selection sort

Question 5 Of 10

If a problem can be broken into sub problems which are reused several times, the problem possesses which property?

Overlapping sub problems Optimal substructure Memoization Greedy

Question 6 Of 10

The Θ notation in asymptotic evaluation represents

Base case Average case Worst case NULL case

Question 7 Of 10

Time Complexity of bubble sort in best case is

θ (n) θ (nlogn) θ (n2) θ n(logn)2)

Question 8 Of 10

The word comes from the name of a Persian mathematician Abu Ja’far Mohammed ibn-i Musa al Khwarizmi is called?

Flowchart Flow Algorithm Syntax

Question 9 Of 10

From the following sorting algorithms which algorithm needs the minimum number of swaps?