If T(x) = T(x/2) + 1, then T(x) is equal to:

Which sorting algorithm is the fastest?

The number of possible min-heaps containing each value from {1, 2, 3, 4, 5, 6, 7} exactly once is

In an undirected connected planar graph G, there are eight vertices and five faces. The number of edges in G is

Which of the following concepts make extensive use of arrays?

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

The last step in solving a problem using an algorithm is

Under the first case of the Master's theorem, which sorting algorithm's recurrence relation falls?

Which of the following is not an inherent application of stack?

What is the main advantage of selection sort over other sorting techniques?