Tag Archives: GATE-GATE-CS-2002

In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is (A) log2… Read More

The minimum number of colours required to colour the vertices of a cycle with η nodes in such a way that no two adjacent nodes… Read More

The solution to the recurrence equation T(2k) = 3 T(2k-1) + 1, T (1) = 1, is: (A) 2k (B) (3k + 1 – 1)/2… Read More

The trapezoidal rule for integration give exact result when the integrand is a polynomial of degree: (A) 0 but not 1 (B) 1 but not… Read More

The rank of the matrix  is :  (A) 0  (B) 1  (C) 2  (D) 4  Answer: (B)Explanation:     Rank of the matrix is defined as… Read More