What is the average case running time of an insertion sort algorithm?

The average successful search time taken by binary search on a sorted array of 20 items is

The Rabin-Karp algorithm and the naive pattern searching algorithm have the same worst-case time complexity.

An example of a monoalphabetic substitution cipher is:

Which in-place sorting algorithm requires the minimum number of swaps?

Which of the following sorting algorithms has the lowest worst-case time complexity?

In an AVL tree, the heights of the two child subtrees of any node differ by at most one

Which of the following operations will give a vector that is perpendicular to both vectors m and n?

Consider the two matrices P and Q which are 50 x 60 and 60 x 70 matrices respectively. What is the number of multiplications required to multiply the two matrices?

The cost of extra checking is low when the modulo value (q) is taken: