The minimum number of colours that is sufficient to vertex-colour any planar graph is 

What is the running time of merge sort for a already sorted array?

Which of the following data structures is not a linear data structure?

What is the other name for a postfix expression?

Diminishing increment sort is the other name for a

The correct formula for generating random numbers in the range (lower, upper) is:

If the GCD (Greatest Common Divisor) of two numbers is 20 and the LCM (Least Common Multiple) is 100, then what is the second number if the first number is 50?

 Design an algorithm that finds the number of ways in which you can traverse N meters by doing jumps of 1, 2, 3, 4, or 5 meter lengths. Assume that N can be a very large number. What is the resulting complexity? 

Let A be an array of 31 numbers consisting of a sequence of 0’s followed by a sequence of 1’s. The problem is to find the smallest index i such that A[i] is 1 by probing the minimum number of locations in A. The worst case number of probes performed by an optimal algorithm is

Consider an undirected graph G with vertices {A, B, C, D, E}. In graph G, every edge has a distinct weight. Edge CD has the minimum weight, and edge AB has the maximum weight. Which of the following statements is false?